Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^6: Challenge: 8 Letters, Most Words

by hdb (Prior)
on Oct 05, 2013 at 17:43 UTC ( #1057053=note: print w/replies, xml ) Need Help??


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

Thanks for this post! It did not even occur to me that you could add another letter to make a word fit into a bucket or class if the total of 8 is not exhausted yet. Means I have to rework my solution. I am thinking of cloning a class with less than 8 letters when a new word is added that requires adding new letters. But this will create an explosion of possibilities and lengthen the runtime a lot. Not for tonight...

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1057053]
help
Chatterbox?
[Corion]: ambrus: Yeah, at least that's what I think I'll start with. A timer and potentially the dummy IO function that never is ready
[ambrus]: That only lets you invoke the main loop from Prima->run;, not from AnyEvent->condvar- >recv; but that shouldn't matter
[Corion]: ambrus: Details ;)

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (7)
As of 2016-12-08 12:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (141 votes). Check out past polls.