Re^6: Challenge: Mystery Word Puzzle

BrowserUk,
Sorry - see the 3rd assumption.
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

dukes has 5 letters in common with dukes
krems has 3 letters in common with seams
makes has 3 letters in common with seams
pokes has 35 letters in common with pokes

I didn't finish the list as you can see you have a flaw in your code (which I am interested in seeing).

Cheers - L~R

Comment on Re^6: Challenge: Mystery Word Puzzle

Replies are listed 'Best First'.
Re^7: Challenge: Mystery Word Puzzle by BrowserUk (Patriarch) on Jan 12, 2005 at 20:45 UTC
... you have a flaw in your code ... Not really. It's doing exactly what I thought the challenge required. Then I strongly suggest that you completely re-word the text of your challenge. Something along the lines of: The mystery word has exactly* 2 unique letters in common with 'bumps'* As the rules stand, with the details spread all over the place like that, it is very misinterpretable. As for my "code", it was originally a hand-coded single regex applied to all the 5 characters words in my words file. I had just finished writing a script to generate the regex from command line input of the form: `P:\test>421692-1 5 bumps:2 seams:2 domes:3 shake:3 pokes:3 dukes:3 8 dukes house krems makes pokes smoke spade spoke` [download] When I read your reply that I was misinterpreting your spec. I'll have to take a look and see if it is adaptable to my new understanding of the rules. Examine what is said, not who speaks. Silence betokens consent. Love the truth but pardon error.	[reply] [d/l]
Re^7: Challenge: Mystery Word Puzzle by wolfger (Deacon) on Jan 12, 2005 at 21:06 UTC
# pokes has 3 letters in common with pokes boggle Count that again? ;-) -- Linux, sci-fi, and Nat Torkington, all at Penguicon 3.0 perl -e 'print(map(chr,(0x4a,0x41,0x50,0x48,0xa)))'	[reply] [d/l]