I need to get all possible combinations out of those letters, so I can compare them to the word list and display the real words to the user. But, its not like cracking a password, where you may have all symbols at any space, here you got adjacent nodes wich you have to connect, so the resulting combinations are limited.
I have no idea how to make a function to get all possible combinations between the letters. I dont want to hard-code the possible combinations so I can compare the resulting letters to the word list.
I cant even explain it well
I just saw its called Boggle solver in google.
*EDIT*
use a 2d-array, write some lines of code which check every possible direction (shouldn't be too hard if it's a recursive function) and iterate through the whole array.
OK. You got me thinking
I can define the rules - from wich node you can go to wich node , and 16 temp variables to check if a node has been 'visited'...And generate all possible 'paths' for each node to every other,right?
