|
|
|
| Perl-Sensitive Sunglasses | |
| PerlMonks |
Re^3: Challenge: Mystery Word Puzzleby Solo (Deacon) |
| on Jan 13, 2005 at 05:10 UTC ( [id://421879]=note: print w/replies, xml ) | Need Help?? |
|
Per the OP:
The number of letters in common is the exact number of unique letters in common. A 't' would only be counted once even if it existed twice in both the mystery word and the hint word Update:That is why the final equation is LESS THAN or equal to. The letters may appear more than once, reducing the total number of unique letters, but no more than the number of letters in the secret word can be used.
--Solo
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||