Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>About your idea to try and guess the word instead of trying to guess letters, there sure may be some isolated cases where you guess the word from the first try or something like that, but this doesn't make that algorithm better on the average case. It's about expected probability.</p> <p>Some improvement that could be done to that algorithm (in the version posted by Lajos) is some more informed pick of letter to be tried.<br> This could be achieved by adding one more weight: consider the usage of each word the vocabulary of the language.</p> <p>For example, technical, medical, juridical etc. words would have much lower chances.</p> <p>Take this dictionary (with some example usage weights):</p> <pre><code>frost 6 guilt 5 genes 1 fever 2 meter 1 </code></pre> <p>Here <code>e</code> is the most frequent letter, so it would get chosen. This would mean leaving only the medical terms, which are very unlikely. But if the decision is taken by:</p> <pre><code>weight(letter) = w * frequency + (1 - w) * sum( usage_weight(word) where letter in word ) </code></pre> <p>then, most probably <code>t</code> would be chosen.</p> <hr> <p><strong>Because</strong> (let's say <code>w = 0.2</code>):</p> <pre><code>weight(e) = 0.2 * 3 + 0.8 * (1 + 2 + 1) = 3 weight(r) = 0.2 * 3 + 0.8 * (1 + 2 + 6) = 7.8 weight(t) = 0.2 * 3 + 0.8 * (1 + 5 + 6) = 10.2 </code></pre> <p>Note: We should, of course use normalized weights, like <code>frequency / num_words</code> to get accurate weight measuring.</p> <p>Note: This algorithm can and should be adapted to the opponent:</p> <ul> <li>when playing against human, more usual words get higher weight</li> <li>when playing against AI, it depends on the difficulty level: <ul> <li>on easy level aim for usual words</li> <li>on hard level aim for unusual words</li> </ul></li> </ul>
    singulars
    1. This table or related slice is empty.
    1. POOptimal Algorithm for Winning Hangman
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USIulius Curt
    1. USIulius Curt
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COYour dictionary is helpful. I think R is a better guess than E - it appears in the same number of words (3), and, if you are right, you get extra information about the location of the R. (If R appears second, you already know the answer is FROST)
      singulars
      1. PO
      1. USRonald
    2. COUps, I overlooked that R :) Anyway, the basic idea was that you can use some external information (language usage) to improve the choice.
      singulars
      1. PO
      1. USIulius Curt
    3. COImproved the explanation.
      singulars
      1. PO
      1. USIulius Curt
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload