Just a quick hangman solver I wrote to beat my friend.
- Download
make build
- Run with
./hmsolv
- Exit with CTRL-C
- Generally you set the length of the word first with
length n
- You can specify letters that are known not to exist with
no l
- You can set a known character with
char n c
where n is 0 indexed to the word. analyze
spits out the most likely letters occuring in the remaining list.words
lists the remaining words in the world list.
Some ideas I could implement in the future:
- Have a game mode where the computer picks a word and the user guesses.
- Human picks a world and the computer does a guess loop on it0 automatically.