Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^2: Hangman Assistant

by Lawliet (Curate)
on Jul 13, 2009 at 05:25 UTC ( #779461=note: print w/ replies, xml ) Need Help??

in reply to Re: Hangman Assistant
in thread Hangman Assistant

Thanks for the effort!

I think your algorithm is the same as the one I initially used, suggesting the letter that is most common throughout the words. I think further investigation should be done, testing all the words and then seeing the data produced for each algorithm.

I don't mind occasionally having to reinvent a wheel; I don't even mind using someone's reinvented wheel occasionally. But it helps a lot if it is symmetric, contains no fewer than ten sides, and has the axle centered. I do tire of trapezoidal wheels with offset axles. --Joseph Newcomer

Comment on Re^2: Hangman Assistant
Replies are listed 'Best First'.
Re^3: Hangman Assistant
by Limbic~Region (Chancellor) on Jul 13, 2009 at 13:40 UTC
    ...testing all the words and then seeing the data produced for each algorithm

    I suggested the very thing elsewhere in the thread. I can easily modify this code to only produce "lose" if it is unable to guess the word in the allowed number of wrong guesses or "win <total_guesses> <wrong_guesses>" if it does win. I haven't looked at your code so I would think it would be easier for you to modify it accordingly.

    Cheers - L~R

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (6)
As of 2015-10-07 03:48 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (170 votes), past polls