Re^5: Challenge: 8 Letters, Most Words

in reply to Re^4: Challenge: 8 Letters, Most Words
in thread Challenge: 8 Letters, Most Words

choroba,
I am bleary eye tired but I wanted to review your code because you mentioned it didn't consider all combinations - only possible combinations.

If I have understood what you have done, this is not guaranteed to produce the correct answer on all dictionary files. It happens to get the right answer for 2of12inf.txt however. You appear to only be considering the combinations of letters of individual words rather than considering taking some from one word and some from another. Consider the following dictionary:

abcd
acdb
adbc
dabc
bcad
efgh
fgeh
hegf
egfh
fegh
abcdxy
efghlm
[download]

The obvious answer is 'abcdefgh' which will get 10 words but your code chooses both 'abcdxy' and 'efghlm' with 6 words each.

Cheers - L~R

Comment on Re^5: Challenge: 8 Letters, Most Words Download Code

Replies are listed 'Best First'.
Re^6: Challenge: 8 Letters, Most Words by choroba (Cardinal) on Oct 05, 2013 at 07:27 UTC
One should probably postprocess the results if the winner is shorter than 8. I will look into it later. لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ	[reply]
Re^7: Challenge: 8 Letters, Most Words by choroba (Cardinal) on Oct 05, 2013 at 08:22 UTC
Something like the following? It slows the algorithm terribly, though... Read more... (3 kB) لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ	[reply] [d/l]
Re^8: Challenge: 8 Letters, Most Words by choroba (Cardinal) on Oct 05, 2013 at 11:28 UTC
Another idea: preprocess the input, adding all the combinations of the shorter words. Then run the original code without postprocessing. I will try to test it later, not much time at the moment... لսႽ† ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ	[reply]

In Section Seekers of Perl Wisdom