All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Word Ladders (Posted on 2003-09-24) Difficulty: 4 of 5
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.

See The Solution Submitted by Charlie    
Rating: 3.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(3): Finding adjacent words Comment 11 of 11 |
(In reply to re(2): Finding adjacent words by Charlie)

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.
  Posted by SilverKnight on 2003-09-26 12:16:52

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information