If you have tried playing Hangman against the computer, you may have noticed that it isn't...

 

Transcribed Image Text:

If you have tried playing Hangman against the computer, you may have noticed that it isn't always easy to beat the computer, especially when it selects an esoteric word (like "esoteric"!). It might be nice if you could ask the computer for a hint, such as a list of all the words that match what you have currently guessed. For example, if the hidden word is "tact", and you have so far guessed the letter "t", so that you know the solution is "t t", where you need to guess the two missing letters, it might be nice to know that the set of matching words (at least based on what the computer initially loaded) are: tact tart taut teat tent test text that tilt tint toot tort tout trot tuft twit We are going to have you create a variation of Hangman (we call this hangman with hints , and have provided an initial scaffold for writing it), with the property that if you guess the special character * the computer will find all the words from its loaded list that might match your current guessed word, and print out each of them. Of course, we don't recommend trying this at the first step, since this will print out all 55,900 words that we loaded! But if you are getting close to an answer and are running out of guesses, this might help. To do this, we are going to ask you to first complete two helper functions: 3A) Matching the current guessed word match with gaps takes two parameters: my word and other word. my word is an instance of a guessed word, in other words, it may have some _ 's in places (such as 't_t'). other ward is a normal English word. This function should return True if the guessed letters of my word match the corresponding letters of other word . It should return False if the two words are not of the same length or if a guessed letter in my word does not match the corresponding character in other word. Remember that when a letter is guessed, your code reveals all the positions at which that letter occurs in the secret word. Therefore, the hidden letter ( ) cannot be one of the letters in the word that has already been revealed. >> match_with_gaps ("te t", "tact") False >>> match_with_gaps ("a_ le", "banana") False >>> match_with_gaps ("a le", "apple") True >>> match_with_gaps ("a ple", "apple") False Hint: You may want to use strip() to get rid of the spaces in the word to compare lengths. 3B) Showing all possible matches show possible matches takes a single parameter: my word which is an instance of a guessed word, in other words, it may have some _ 's in places (such as 't__t'). This function should print out all words in wordlist (notice where we have defined this at the beginning of the file, line 51) that match my word . It should print "No matches found" if there are no matches. Example Usage: >>> show_possible_matches ("t_ t") tact tart taut teat tent test text that tilt tint toot tort tout trot tuft twit >>> show_possible_matches ("abbbb_ ") No matches found >>> show_possible_matches ("a pl_ ") ample amply 3C) Hangman with hints Now you should be able to replicate the code you wrote for hangman as the body of hangman_with_hints, then make a small addition to allow for the case where the user can guess an asterisk (*), in which case the computer will print out all the words that match that guess. The user should not lose a guess if the guess is an asterisk. Comment out the lines of code you used to play the original Hangman game: secret_word = choose_word (wordlist) hangman (secret_word) And uncomment out these lines of code we've provided at the bottom of the file to play your new game Hangman with Hints: #secret word = choose word (wordlist) #hangman_with_hints (secret_word) Sample Output: The output from guessing an asterisk should look like the sample output below. All other output should follow the Hangman game described in Part 2 above. Loading word list from file... 55900 words loaded. Welcome to the game Hangman! I am thinking of a word that is 5 letters long. You have 6 guesses left. Available letters: abcdefghijklmnopqrstuvwxyz Please guess a letter: a Good guess: a_ - - - You have 6 guesses left. Available letters: bcdefghijklmnopqrstuvwxyz Please guess a letter: 1 Good guess: a_ 1_ You have 6 guesses left. Available letters: bcdefghijkmnopqrstuvwxyz Please guess a letter: * Possible word matches are: addle adult agile aisle amble ample amply amyls angle ankle apple apply aptly arils atilt You have 6 guesses left. Loading word list from file... 55900 words loaded. Welcome to the game Hangman! I am thinking of a word that is 5 letters long. You have 6 guesses left. Available letters: abcdefghijklmnopqrstuvwxyz Please guess a letter: a Good guess: a_ You have 6 guesses left. Available letters: bcdefghijklmnopgrstuvwxyz Please guess a letter: 1 Good guess: a__ 1_ You have 6 guesses left. Available letters: bcdefghijkmnopqrstuvwxyz Please guess a letter: Possible word matches are: addle adult agile aisle amble ample amply amyls angle ankle apple apply aptly arils atilt You have 6 guesses left. Available letters: bcdefghijkmnopqrstuvwxyz Please guess a letter: e Good guess: a_ le If you have tried playing Hangman against the computer, you may have noticed that it isn't always easy to beat the computer, especially when it selects an esoteric word (like "esoteric"!). It might be nice if you could ask the computer for a hint, such as a list of all the words that match what you have currently guessed. For example, if the hidden word is "tact", and you have so far guessed the letter "t", so that you know the solution is "t t", where you need to guess the two missing letters, it might be nice to know that the set of matching words (at least based on what the computer initially loaded) are: tact tart taut teat tent test text that tilt tint toot tort tout trot tuft twit We are going to have you create a variation of Hangman (we call this hangman with hints , and have provided an initial scaffold for writing it), with the property that if you guess the special character * the computer will find all the words from its loaded list that might match your current guessed word, and print out each of them. Of course, we don't recommend trying this at the first step, since this will print out all 55,900 words that we loaded! But if you are getting close to an answer and are running out of guesses, this might help. To do this, we are going to ask you to first complete two helper functions: 3A) Matching the current guessed word match with gaps takes two parameters: my word and other word. my word is an instance of a guessed word, in other words, it may have some _ 's in places (such as 't_t'). other ward is a normal English word. This function should return True if the guessed letters of my word match the corresponding letters of other word . It should return False if the two words are not of the same length or if a guessed letter in my word does not match the corresponding character in other word. Remember that when a letter is guessed, your code reveals all the positions at which that letter occurs in the secret word. Therefore, the hidden letter ( ) cannot be one of the letters in the word that has already been revealed. >> match_with_gaps ("te t", "tact") False >>> match_with_gaps ("a_ le", "banana") False >>> match_with_gaps ("a le", "apple") True >>> match_with_gaps ("a ple", "apple") False Hint: You may want to use strip() to get rid of the spaces in the word to compare lengths. 3B) Showing all possible matches show possible matches takes a single parameter: my word which is an instance of a guessed word, in other words, it may have some _ 's in places (such as 't__t'). This function should print out all words in wordlist (notice where we have defined this at the beginning of the file, line 51) that match my word . It should print "No matches found" if there are no matches. Example Usage: >>> show_possible_matches ("t_ t") tact tart taut teat tent test text that tilt tint toot tort tout trot tuft twit >>> show_possible_matches ("abbbb_ ") No matches found >>> show_possible_matches ("a pl_ ") ample amply 3C) Hangman with hints Now you should be able to replicate the code you wrote for hangman as the body of hangman_with_hints, then make a small addition to allow for the case where the user can guess an asterisk (*), in which case the computer will print out all the words that match that guess. The user should not lose a guess if the guess is an asterisk. Comment out the lines of code you used to play the original Hangman game: secret_word = choose_word (wordlist) hangman (secret_word) And uncomment out these lines of code we've provided at the bottom of the file to play your new game Hangman with Hints: #secret word = choose word (wordlist) #hangman_with_hints (secret_word) Sample Output: The output from guessing an asterisk should look like the sample output below. All other output should follow the Hangman game described in Part 2 above. Loading word list from file... 55900 words loaded. Welcome to the game Hangman! I am thinking of a word that is 5 letters long. You have 6 guesses left. Available letters: abcdefghijklmnopqrstuvwxyz Please guess a letter: a Good guess: a_ - - - You have 6 guesses left. Available letters: bcdefghijklmnopqrstuvwxyz Please guess a letter: 1 Good guess: a_ 1_ You have 6 guesses left. Available letters: bcdefghijkmnopqrstuvwxyz Please guess a letter: * Possible word matches are: addle adult agile aisle amble ample amply amyls angle ankle apple apply aptly arils atilt You have 6 guesses left. Loading word list from file... 55900 words loaded. Welcome to the game Hangman! I am thinking of a word that is 5 letters long. You have 6 guesses left. Available letters: abcdefghijklmnopqrstuvwxyz Please guess a letter: a Good guess: a_ You have 6 guesses left. Available letters: bcdefghijklmnopgrstuvwxyz Please guess a letter: 1 Good guess: a__ 1_ You have 6 guesses left. Available letters: bcdefghijkmnopqrstuvwxyz Please guess a letter: Possible word matches are: addle adult agile aisle amble ample amply amyls angle ankle apple apply aptly arils atilt You have 6 guesses left. Available letters: bcdefghijkmnopqrstuvwxyz Please guess a letter: e Good guess: a_ le

Answer rating: 100% (QA)

import string import random wordsguessed def loadwords printLoading word ... View the full answer