I was shown them as "dictionaries" but in java its hashing or mapping so I'll have to read but,
If we make an algorithm to map of all the words that are 1 letter different from their "neighbors" we can see if all the words are connected by at least a single thread. If this is the case than a random call to the list indice with only 1 or 2 restrictions will suffice as a manner of generating our 'win condition'. Otherwise we'll have to to reverse-legal-moves to get the target word.
I was shown them as "dictionaries" but in java its hashing or mapping so I'll have to read but,
If we make an algorithm to map of all the words that are 1 letter different from their "neighbors" we can see if all the words are connected by at least a single thread. If this is the case than a random call to the list indice with only 1 or 2 restrictions will suffice as a manner of generating our 'win condition'. Otherwise we'll have to to reverse-legal-moves to get the target word.