Skip to content
UnscrambleWords

Free tool

Hangman Solver

Enter what you have revealed as a pattern, list the letters already guessed wrong, and see which words remain, plus the best letter to guess next.

Use ?, a dot, dash or underscore for each unknown square. There is no three-blank limit.

Enter a revealed word pattern to search every word of that exact length.

Quick answer

What is the best next letter to guess in Hangman?

Enter the revealed pattern and every incorrect letter. The solver lists words that still fit and recommends the unguessed letter appearing in the greatest share of those candidates.

Worked example

Input: Pattern ?A??ER · wrong letters S, T

Result: Remaining six-letter candidates and the best next letter

The recommendation is based on how often each unguessed letter occurs across the remaining candidates.

What this tool handles

This game tool focuses on Hangman, Word patterns, Letter frequency.

  • Match revealed letter positions
  • Exclude incorrect guesses
  • List remaining candidate words
  • Recommend the next letter by candidate coverage

Turn the board into a precise pattern

Record one character for every position so the solver knows the exact word length. Known letters remain fixed; question marks represent the unrevealed positions.

Add misses immediately. One excluded letter can remove hundreds of otherwise plausible words and materially change the best next guess.

Choose letters by candidate coverage

The safest next guess is usually the unused letter found in the highest proportion of remaining words. When only a few candidates remain, compare which letter best separates them rather than relying on general alphabet frequency.

Continue with the right word tool

Popular word checks

The words players look up most on UnscrambleWords.

Frequently asked questions

How do I enter unknown positions?

Use a question mark for each hidden letter and type revealed letters in their exact positions.

Where do wrong guesses go?

Add every incorrect letter to the excluded field. Any candidate containing one of those letters is removed.

Does the solver handle repeated letters?

Yes. Revealed duplicate positions stay fixed, and candidate words must match the complete pattern.

Should I always guess the most common English letter?

No. The best general letter may be poor for the remaining pattern. The recommendation is calculated from the current candidate list.