Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re: Challenge: 8 Letters, Most Words

by McA (Priest)
on Oct 13, 2013 at 19:03 UTC ( #1058096=note: print w/replies, xml ) Need Help??

in reply to Challenge: 8 Letters, Most Words

Hi L~R, hi all other interested monks.

It's done. My program presented at Re^10: Challenge: 8 Letters, Most Words ended. My estimation was not too bad, as you can see:

real 11330m25.517s user 11319m0.142s sys 1m29.073s

This is worth of 7 days, 20 hours, 50 minutes, 25.517 seconds.

IMHO THIS is a really (stupid) brute force solution. ;-)

So, now to the result: I found two winners:

aeinprst aeilprst

With both the program was able to build 337 words out of the dictionary.

Here you can find the dictionary I worked on and the detailed result:

Probably I will investigate the differencet to the solution of L~R. I'm sure it would be faster if he would run his script/program on my dictionary. :-)

Best regards

P.S.: If anybody is saying to you the well known mantra: Code first, optimize later! show him this node and answer: Time, resources and runtime are requirements, even when secondary ones. ;-)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1058096]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (11)
As of 2018-06-22 12:03 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (124 votes). Check out past polls.