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
Been there, done that by Bruce)
I meant breadth-first not depth-first.
|
|
Posted by Bruce
on 2003-09-26 09:05:06 |
re: Been there, done that
