In this game, the user only enters the number of letters existing in that word, and the computer tries to guess them based on a fixed number of attempts. The game ends if the computer correctly guessed all the letters in order or used all of the given attempts.
Added new file named best_letter_guess.py
This file has a dictionary which contains the best optimal
calling order of letter guesses based on number of letters in
word, as provided by the hint.
Modified hangman.py
now imports dictionary from best_letter_guess.py to use in
funtions that determine next optimal guess based on hint
there are now two functions that select letter guess: first
selects optimal letters and then random letters in rest of
alphabet
change to start of while loop
functionality that decides what happens if letter guessed is
correct, incorrect or already guessed
Added new file named best_letter_guess.py This file has a dictionary which contains the best optimal calling order of letter guesses based on number of letters in word, as provided by the hint.
Modified hangman.py
Modified words.py added comment