An higher order approach would be to look at probabilities for chains of letters. E. g. in English the chance for an 'u' should be higher than average after a 'q'.
That's the wrong way of approaching it. One shouldn't look at the frequency of chains of letters in the particular language - but to the frequency of chains of letters in the list of words that may possibly match. But then, I don't see when this algorithm gives you any better guesses than looking for the letter which occurs in the most words. If for instance the current guess has a 'Q', then almost any word in the list of possible matches will contain a 'U'.
Now, I'd be surprised to see an efficient hangman guessing algorithm to guess 'Q' before guessing 'U'.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|