Re^12: Challenge: 8 Letters, Most Words

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

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 :)	[reply]
Re^14: Challenge: 8 Letters, Most Words by davido (Cardinal) on Oct 05, 2013 at 17:45 UTC
So does Devel::NYTProf being mentioned in the same thread. :) Dave	[reply]
Re^15: Challenge: 8 Letters, Most Words by McA (Priest) on Oct 06, 2013 at 17:27 UTC
HAR HAR ;-) P.S.: Iterations done: 2634000. I'm not sure whether the next week is enough.	[reply]

In Section Seekers of Perl Wisdom