A user has a limited number of guesses to guess all the letters in a word of length. Evil Hangman stores words of length N from a dictionary in a root list. When the user makes a letter guess the program creates different "keys" representing permutations where letter guessed is located in each word of the current root list, included a "key" for words that don't contain the letter guessed. All the words in the root list are then filtered and added to new lists matching the same "key". The new list with the largest value then becomes the new root list. The process repeats until the user is out of guesses or the word has been guessed. This project is a part from the COMP II lab.
Stephanie-La/Hangman
A user has a limited number of guesses to guess all the letters in a word of length. Evil Hangman stores words of length N from a dictionary in a root list. When the user makes a letter guess the program creates different "keys" representing permutations where letter guessed is located in each word of the current root list, included a "key" for words that don't contain the letter guessed. All the words in the root list are then filtered and added to new lists matching the same "key". The new list with the largest value then becomes the new root list. The process repeats until the user is out of guesses or the word has been guessed.
C