Hangman

My take at classic Hangman for English words.

This solver is built using a word list of the English language, and is "position-aware". It will go through every word in the dictionary, and – if it matches the current mask – will increase the score of letters matching unknown positions (unless, of course, the word contains letters found in the garbage bin).

The word list classifies words by frequency of use, so the solver uses this information to prioritize certain guesses.

The word list used is from http://wordlist.sourceforge.net/

Note: you can't use this solver for also solving crosswords. This is because it assumes that if a letter is guessed, then all instances of that letter are guessed as well. This allows it to produce more exact results.

Download: Solver only, TCP service (contains latest versions of algorithms), Solver + service + word lists


Try it live

No one commented on this page yet. Why not be the first?