Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re^6: Challenge: 8 Letters, Most Words

by Limbic~Region (Chancellor)
on Oct 05, 2013 at 02:38 UTC ( #1056987=note: print w/ replies, xml ) Need Help??


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

LanX,
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


Comment on Re^6: Challenge: 8 Letters, Most Words
Re^7: Challenge: 8 Letters, Most Words
by LanX (Canon) on Oct 05, 2013 at 14:51 UTC
    Yeah I agree about 12_461_993

    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)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1056987]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (7)
As of 2014-08-23 16:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (174 votes), past polls