Syntactic Confectionery Delight | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
I have the start of an idea that the puzzle can be looked at as
For the 'house' example, we'd get the system:
Where each of the variables (a,b,d,e,...,u) can be 0 or 1. IF there is/are solution(s) to this system, we're done. The word(s) must contain only those letters--a very simple anagram search. If there isn't an exact solution, the system can be reduced, reducing the rules set for the dictionary search. Update: Given the OP's additional rule:
There will be no letters in the mystery word that are not covered by the hint words. Added 2005-01-12 16:10:00 EST I'm more convinced this approach is sound, but I won't get to coding anything until the weekend. --Solo
In reply to Re: Challenge: Mystery Word Puzzle
by Solo
|
|