Hangman Solver

Use this free Hangman Solver to find words from the letters you know and the guesses that missed. Enter your pattern, compare possible answers, and choose your next letter.

Use _ or ? for blanks; / between words.

Start with a word length
Tap wrong letters

Tap a missed letter to exclude it. Tap again to remove it. Revealed letters stay disabled.

Repeated-letter rule

Leave this off for standard Hangman: a correct guess reveals every copy across the whole word or phrase. When enabled, known letters may still appear in blanks.

Try a pattern

A useful hint before your next guess

Enter the letters you can see, add any misses, and find the words that still fit. Your best next letter appears here.

English · 3–25 letters per word · up to 5 words

How to use the Hangman Solver

  1. 1. Enter the missing-letter pattern

    Keep each known letter in its correct position and use one underscore for each blank. For a five-letter word with A second and E last, enter _A__E. You can also paste question marks, dots, hyphens, or asterisks; each represents one missing letter.

  2. 2. Add your wrong guesses

    Enter letters the game has confirmed are absent. For example, STR removes words containing S, T, or R. Leave this field empty at the start of a round. A wrong guess is useful evidence, so keep the list current.

  3. 3. Compare answers and guess again

    Review the matching words and suggested letters. If a guess is right, fill in every place it appears. If it misses, add it to the wrong letters. Update the search after either result; the best next guess can change as the list shrinks.

Try a Hangman Solver example

These examples show how a position clue, a missed letter, or a repeated letter changes what can fit. Load one into the tool and edit it.

A five-letter word with three misses

_A__E

Wrong letters: STR

CABLE and MAPLE fit this pattern and avoid the wrong letters. TABLE fits the shape but contains T, so it must be excluded. Compare the remaining letters instead of choosing another letter already ruled out.

Try this pattern

Find a word from its ending

A__LE

Wrong letters: none

APPLE is one possible match. Its two Ps occupy separate blanks, but guessing P is still one guess. The letter suggestions count APPLE once for P, so repeated letters do not inflate a candidate's contribution.

Try this pattern

Keep every repeated letter visible

_A_A_A

Wrong letters: none

BANANA matches all three revealed As. If the game has shown A, leaving one of those positions blank would describe a different board. Copy the complete pattern before using the Hangman Solver to narrow your options.

Try this pattern

What makes a word a valid match?

A Hangman word finder needs more than the right number of letters. This tool checks the whole state of your board.

The length and positions must agree

Every blank stands for exactly one letter. A six-letter answer cannot fit five slots, and a known A in the second slot must stay there. Adding extra blanks to widen the search changes the puzzle rather than improving the match.

Wrong letters cannot appear anywhere

If R was a miss, no candidate may contain R. The filter applies throughout the word and across every word in a phrase. If you accidentally mark a visible letter as wrong, correct that conflict before searching.

Correct guesses reveal every occurrence

Standard Hangman reveals all copies of a guessed letter. In _A__E, EAGLE is therefore invalid: its first E would already be visible. Keep the standard rule enabled for Hangman. Turn it off only for a different missing-letter puzzle that reveals selected positions. In that mode, a visible letter may still be suggested for another blank.

Choose a better next letter

The Hangman Solver ranks possible next letters using the candidates left after your filters. It does not always start with E, and it does not know which word your opponent chose.

Best chance of a hit

The default ranking counts how many candidates contain each letter. If L appears in 6 of 10 remaining words, its candidate coverage is 60%. Each word counts once, even when L occurs twice. This favors letters that avoid a miss across more of the current possibilities.

More information from a guess

The advanced information ranking also considers where a letter would appear. A letter can separate candidates into different groups even when it occurs in many of them. Use this view to compare guesses that may reveal more about the answer, while checking their chance of a miss.

These percentages treat dictionary candidates equally. They describe the current list, not a guaranteed chance of winning or a prediction of someone's vocabulary. Common-first word sorting helps you review familiar possibilities; it does not turn the letter percentages into real-world probabilities.

Working with two words or a phrase

Separate words with a slash, as in ___/____. Ordinary spaces are ignored, so _ A _ _ E is read as the single word _A__E. The tool supports up to five words, each 3–25 letters long. One- and two-letter words, names, and non-English answers are outside this tool's intended coverage.

Each word is matched separately against the English dictionary, with the same wrong guesses and revealed-letter rules. Suggestions combine those candidate sets; they do not search a database of movie titles, quotations, or natural phrases. Use the puzzle's theme to judge which word combinations make sense. For phrases, letter coverage assumes independent, equally weighted word candidates and measures combinations with at least one matching letter.

When a Hangman helper is useful

Get unstuck in a friendly game

Check a stubborn pattern when everyone agrees to use help. You can review a few possible words or look only at the next-letter suggestion if you still want to work out the answer yourself.

Compare your own guessing strategy

Pick a letter before checking the tool, then compare your choice with its coverage. Notice how an apparently common letter becomes less helpful after certain positions and wrong guesses are known.

Discuss word patterns in class

Let learners explain why a candidate belongs in the list or should be removed. The repeated-letter examples are useful for checking spelling, and the percentages give a concrete starting point for discussing chance.

No matching words? Check your clues

An empty result means no words in the selected list fit your clues. It does not prove your puzzle is impossible.

  • Count the slots

    Check the exact word length and remove any accidental blank. For several words, use a slash at each boundary.

  • Review the misses

    Remove any letter marked wrong by mistake. Make sure you have shown every occurrence of a correctly guessed letter.

  • Widen the vocabulary

    Switch off the common-word filter to include less familiar entries. A name, abbreviation, specialist term, or custom answer may still be absent.

Hangman Solver FAQ

Is this Hangman Solver free to use online?

Yes. You can enter clues, find matching words, and compare letter suggestions without creating an account or paying for a search. The solver works in your browser, including on a phone.

Can I use the Hangman Solver before any letters are revealed?

Yes. Enter one blank for each letter in the word, then search. An all-blank pattern gives suggestions for that length. Add each correct position or wrong guess as you play to make the results more useful.

What is the best first letter to guess in Hangman?

There is no single best opener for every word list and length. Enter the correct number of blanks and compare the suggested letters. Later in the round, rely on the remaining candidates rather than a fixed sequence of common letters.

Why does a word I expected disappear?

Check for a wrong letter, an extra occurrence of a revealed letter, or the common-word filter. A dictionary match also depends on the word being included in the list. A familiar-looking answer can fail one of those checks.

Does the Hangman Solver understand a category or clue?

No. It matches English spelling patterns and letter evidence. A category such as animals or food helps you judge the candidates yourself, but the tool does not use that category to generate or rank answers.

Can I solve phrases, names, or words in another language?

You can enter up to five English word patterns separated by slashes, with 3–25 letters per word. The results are separate word matches. This is not a dedicated names database, phrase search engine, or multilingual Hangman Solver.

Will the solver always find the winning answer?

No. Several words may fit the same clues, the dictionary may not include your answer, or a statistically useful letter may still miss. Treat the list as evidence for your next decision and follow your game's agreed rules.

English word list: ESDB/SCOWL, US English, sizes 35 and 50. Common-word filtering and sorting reuse this site's English frequency data. Names, abbreviations, and some specialist words are excluded. Word list credits and license · Frequency data credits.