Loading…
The goal is to guess the common phrase with the fewest hints. Every vowel will be replaced with “x”, consonants with “_”, and “Y” is revealed automatically. Getting a hint will uncover the most common consonant in the current puzzle. Incorrect guesses will not uncover letters.
If you use a hint, there is some additional information you can deduce: if only one letter is uncovered, you know that there are no other consonants that appear more than once. Example: “x_ __x” can NOT be “at the” because the T’s would have been uncovered already.
While learning Python, the task was to create a simple hangman game. After completing it, I thought of how I could expand that code into a different game, and came up with this. I then converted it to javascript for the web.
Instead of making you guess random letters (since that’s boring and most people guess the most common letters anyway) I simply had it uncover the common ones automatically. This version steps it up and only uncovers letters that actually exist in that puzzle.