Anyway you don't need to check against all words in the dictionary, only taking the (at most) 256 subsets of a potential 8 letter combination. (less if letters are repeated)
This can be done in a lookup in a prepared count-hash with normalized keys.
Cheers Rolf
( addicted to the Perl Programming Language)
In reply to Re^7: Challenge: 8 Letters, Most Words
by LanX
in thread Challenge: 8 Letters, Most Words
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |