LISP Programs Hangman is a children's game in which the player tries to guess a word given its length. The player may either guess the word, or guess letters in the word. If the word contains the guessed letter, then the player is shown that letter's location in the word. If the player guesses incorrectly, then the figure of a person being hanged is drawn, a portion at a time.
Every incorrect guess adds another portion to the figure.
When the figure has been drawn in completely, then the player loses. The player wins if he or she correctly guesses the word. In this version of hangman, a player gets three chances to guess the word. In addition, a player is allowed to make up to seven incorrect letter guesses before losing. As a computer exercise, Hangman is an example of recursive programming.