Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^12: Challenge: 8 Letters, Most Words

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


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

Hi L~R,

you're right with all. It is the result of putting code together when it's too late. I let the program run with Devel::NYTProf on a small subset of the dict. The result is what I assumed: Answering the question if a combination of letters is able to produce a word is the most expensive task. I tried to make it faster with a C-like implementation in perl, but it was slower than the hash-approach.

The program is still running. Currently at iteration 879000. So, a long time to go... ;-)

Anyway, a very very intersting puzzle. And it was fun looking at the different approaches and seeing that some of the "old" monks took that challenge.

Best regards
McA


Comment on Re^12: Challenge: 8 Letters, Most Words
Replies are listed 'Best First'.
Re^13: Challenge: 8 Letters, Most Words
by Anonymous Monk on Oct 05, 2013 at 17:14 UTC
    Re^12: Challenge: 8 Letters, Most Words

    ^12 just seems wrong somehow :)

        HAR HAR ;-)

        P.S.: Iterations done: 2634000. I'm not sure whether the next week is enough.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (7)
As of 2015-07-31 06:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (274 votes), past polls