Re: Play and win the word morph game with the help of Perl :)

I was asked for the explanation of how my algorithm works. I found in Wikipedia that it's called bidirectional search — but when I wrote the script i didn't know its name :) The idea is better explained in WP than I can do it here :)

I run two simultaneous searches: one forward from the source word, and one backward from the target word, and stop when the two trees meet.

Comment on Re: Play and win the word morph game with the help of Perl :)

Replies are listed 'Best First'.
Re^2: Play and win the word morph game with the help of Perl :) by Limbic~Region (Chancellor) on Jun 29, 2006 at 15:59 UTC
Ieronim, This is the very idea (I didn't know it had a name either) I had this morning before coming into work. After converting DBM::Deep over to Storable though, I found all the speed boost I needed and didn't explore it. I know you said in a /msg that you will try to play with a variant using the precompiled datastructure - so will I. Cheers - L~R	[reply]