Perl Monk, Perl Meditation | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
dragonchild,
You have a list of words that is guaranteed to contain the mystery word
I am not sure I agree with you on 2 and 3 with regards to the problem being intractable otherwise. If you strip each hint word to the unique set of letters first, you can still end up with a candidate list of letters. You then only need to allow the possibility that each letter in your candidate list be allowed to repeat one or more times when matching against the dictionary. The number of letters allowed to repeat and up to how many times is dictated by how many less candidate letters you have then your mystery word's length. I fully admit that may be flawed reasoning. I also freely admit that my assumptions were not "rules" written in stone - remember my code was unfinished. If you would like to redefine the assumptions and move forward, be my guest. It is a fun problem regardless. Cheers - L~R In reply to Re^2: Challenge: Mystery Word Puzzle
by Limbic~Region
|
|