Homework 7

Due Thurs, Dec 9, 18:00

Exercise: (10 points)

The word to guess is represented by a row of dashes, giving the number of letters. If the guessing player suggests a letter which occurs in the word, the other player writes it in all its correct positions. If the suggested letter does not occur in the word, the other player draws one element of the hangman diagram as a tally mark. The game is over when either the guessing player completes the word or the diagram is completed.

• You don't need to draw anything (see sample run below)
  
• You may assume that the word to guess contains lowercase letters only (no punctuation, spaces, apostrophies, etc)
• Your class should contain methods and/or constructors to set the word to guess and the maximum number of wrong guesses allowed
  
• Include a reasonable set of constructors
• Your class should have a public void method called play that takes no parameters and plays the game by displaying the disguised word (where the letters guessed by the user are displayed in their correct positions, and a '_' is displayed for each letter that has not yet been guessed) and the letters that have been guessed but are not in the word. The game is over when:
• all of the letters in the word have been guessed (the player wins)
• the number of allowed wrong guesses has been exceeded (the player loses)
  
• Use private methods to implement subtasks of the play method
• Write javadoc comments for each method
• Comment your code so that someone looking at it will be able to understand how it works