Re^3: Challenge: 8 Letters, Most Words (2of12int.txt in 20^H^H 10 secs; Pure Perl)

It does recurse through all 8-letter combos, but short-circuits at each level if the combination so far cannot be derived from the dictionary supplied.

        next unless exists $tree->{ $_ };
[download]

If the letter combination for your 'eehnortw' existed in the dictionary, it would be found very quickly:

[17:25:23.81] C:\test>type hdb.dict
exactest
one
two
three
four
five
six
seven
eight
nine
ten
torewhen

[17:25:47.91] C:\test>1056884-calc hdb.dict
0.00380706787109375

[5] eehnortw : torewhen three one two ten
[1] aceesttx : exactest
[download]

Comment out the short-circuit and it will consider all 8-letter possibilities .. and run more slowly.

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re^3: Challenge: 8 Letters, Most Words (2of12int.txt in 20^H^H 10 secs; Pure Perl) Select or Download Code


Pathologically Eclectic Rubbish Lister
	PerlMonks