Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Solving word ladder puzzles

by jweed (Chaplain)
on Jan 28, 2005 at 06:52 UTC ( [id://425874]=note: print w/replies, xml ) Need Help??


in reply to Solving word ladder puzzles

I haven't had a chance to read through your code yet, but I would suggest perusing the chatter surrounding MJD's Perl Quiz of the Week (Expert #22) published last year-- http://perl.plover.com/qotw/. The perl-qotw-discuss archives are a bit hard to wade through, but at least read the summary and problem text posted on perl-qotw.

Good luck!



Code is (almost) always untested.
http://www.justicepoetic.net/

Replies are listed 'Best First'.
Re^2: Solving word ladder puzzles
by bobf (Monsignor) on Jan 28, 2005 at 06:59 UTC

    *smack*
    OK, now I am really embarassed! Thanks for the link. I just subscribed - I wish I had done that earlier. :)

    To atone for my ignorance, I will give myself 50 lashes with an array of hashes and wash all of the Monastery's windows...

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://425874]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others perusing the Monastery: (4)
As of 2024-03-28 08:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found