in reply to
Re^5: Challenge: 8 Letters, Most Words
in thread Challenge: 8 Letters, Most Words
I did that but it didn't reduce it dramatically. As I pointed out elsewhere, that only gets it down to 12_461_993.
Cheers - L~R
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.
( addicted to the Perl Programming Language)
Use two parentheses: (Like this: :) )
Use one parenthesis: (Like this: :)
Reverse direction of the smiley: (Like this: (: )
Use angle/square brackets instead of parentheses
Use C-style commenting to set the smiley off from the closing parenthesis
Make the smiley a dunce: (:>
I disapprove of emoticons
Results (136 votes),