Hangman Solver
Enter a word pattern, wrong guesses and any known present letters to find matching words in the pinned ENABLE dictionary. Compare next-letter choices by the number of matching candidates or by the information their revealed positions provide, then copy or download the complete results.
If E is shown in the pattern, every E must already be in a shown position. A candidate with another E under an unknown cell is excluded.
ENABLE 1.0 · 172,823 words · pinned 2026-09-26. The file includes uncommon, archaic and inflected words. It is not a proprietary game answer list.
_ _ _ _ _
No search has run. Enter the visible letters and any misses, then find all matching words in the verified dictionary.
Frequency favors letters found in more candidates. Information gain favors letters whose revealed positions best divide the remaining candidates.
Enter a pattern or length, then find candidates. The dictionary loads only when requested.
- Dictionary
- Not loaded
- Candidates
- Not searched
- Length pool
- Not searched
- Suggested letter
- None
Worked clues
- 13 candidates, including APPLE. N appears in 4 of the 13 candidates.
- LETTER matches. Any additional E in an unknown position is excluded.
- Words containing X are excluded, and X is never suggested.
Accuracy. Suggestions are limited to the pinned public-domain ENABLE dictionary: 172,823 English words, including uncommon and inflected forms. Revealed letters must match all their positions; letter frequency and information gain treat the remaining candidates equally, not as real-world word probabilities. The tool does not access a remote game or guarantee its answer.
Common questions
- How do I enter a Hangman word pattern?
- Type the visible English letters and use _ or ? for each unknown position, for example a__le. Choose a matching word length, or clear the length field to infer it from the pattern. An empty pattern searches all words of the chosen length.
- How are repeated letters handled?
- A revealed letter must appear at exactly the positions shown in the pattern. Standard Hangman reveals every occurrence of a guessed letter, so a candidate with another copy under an unknown position is excluded. Known present letters without a position are a separate presence filter.
- What is the difference between frequency and information gain?
- Frequency counts how many candidate words contain the letter, counting each word once. Information gain groups candidates by all positions the letter would reveal, including no match, and measures how much those outcomes distinguish the words. Both measures give each candidate equal weight; neither estimates a game's real answer probabilities.
- Which dictionary does this use?
- The tool uses the public-domain ENABLE 1.0 list of 172,823 English words, pinned on 2026-09-26. Its 1,743,363-byte file and SHA-256 hash are checked before use. It includes uncommon, archaic and inflected words and is not a proprietary game answer list. Available word lengths are 2 to 28 letters.
- Why are there no matching candidates?
- The supplied clues may conflict, a revealed occurrence may be missing, or the game may use a word outside ENABLE. Review the word length, wrong guesses and every visible occurrence. An empty dictionary result does not prove that the game's word is impossible.
- Are my clues sent to a game or server?
- No. Finding candidates loads one fixed dictionary file from this site, without putting your clues in the request. Filtering and letter scoring run in your browser. The tool cannot read or play a remote game.
- Can I save or export the candidates?
- Copy or download all matching words and letter scores as plain text. The on-screen list is paged without discarding matches, and Show complete text provides a selectable fallback. Search inputs and results stay in page memory and are cleared when you leave.
Suggestions are limited to the pinned public-domain ENABLE dictionary: 172,823 English words, including uncommon and inflected forms. Revealed letters must match all their positions; letter frequency and information gain treat the remaining candidates equally, not as real-world word probabilities. The tool does not access a remote game or guarantee its answer.