Re^12: Challenge: 8 Letters, Most Words

[McA]

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

[Anonymous Monk]

Re^12: Challenge: 8 Letters, Most Words

^12 just seems wrong somehow :)

[davido]

So does Devel::NYTProf being mentioned in the same thread. :)

[McA]

HAR HAR ;-)

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