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

Re^7: Challenge: 8 Letters, Most Words

by LanX (Chancellor)
on Oct 05, 2013 at 14:51 UTC ( #1057041=note: print w/ replies, xml ) Need Help??

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

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)

Comment on Re^7: Challenge: 8 Letters, Most Words

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (4)
As of 2015-11-27 06:04 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (719 votes), past polls