Write an algorithm to solve word ladders such as Word Meld 1
or Word Meld 2
. Input consists of the
starting and ending words and the maximum number of steps allowed. Available are files containing lists of
words of any given length; call one such file, say WORDS5.TXT containing a list of words of 5 letters each, and so on.
(In reply to re(2): Finding adjacent words
I most certainly agree with you (and him) regarding that. It would be much faster, provided we have a sorted list, prepared ahead of time.
What I was last asking about is... is the "double headed" aspect a significant gain, in terms of "relevant transactions". For instance... perhaps we have to do only half as many 'cycles' through the list, but now we have to do twice as much during each cycle (because of two trees). And now, we're ALSO doing a check between the two trees, so that we can determine if we've "met in the middle", so to speak.