Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

For this assignment, you will be making a simple version of the Hangman Word Guessing gamewith. This game will be played in the terminal window.

For this assignment, you will be making a simple version of the Hangman Word Guessing gamewith. This game will be played in the terminal window. In this game, the computer picks a random word from a pre-supplied list (from a text file). The rules are same as the classic hangman game which are

i.The player tries to solve to puzzle by guessing one letter at a time.

ii.Every time a guess is correct, all the characters in the word that match the guess will be ``turned over.'' For example, if your guess is ``o'' and the word is ``book'', then both ``o''s in the solution will be counted as ``solved.''

iii.Every time a wrong guess is made, a stroke will be added to the drawing of a hangman, which needs 7 strokes to complete (Figure 1). Each unique wrong guess only counts against the player once.

iv.If the drawing of the hangman is completed before the player has successfully guessed all the characters of the word, the player loses.

v.If the player has guessed all the characters of the word before the drawing is complete, the player wins the game.

vi.If the player does not guess enough letters to either win or lose, then display appropriate message.

Figure 1

On top of that, your game also need to keep track of previously guessed letters and tell the user. The application also able to record and retrieve the players' game history's such as how many time the player win, lose or draw; how many attempts the player won the game or any other information. Make sure your game runs until the player decides to quit. To make the game more interactive you can use Java Applet.

To develop the Hangman Word Guessing game, the following algorithms must be used.

i.Searching algorithm - Linear / Sequential search, Binary Search. Either one or both.

ii.Sorting algorithm - Selection sort, Bubble sort, Insertion sort, Merge sort or combination of this algorithms.

iii.Recursion

iv.Hash Function and Collision Resolution

Notes:

You should have at least five classes, excluding driver class.

Do not use the any Java built-in interface for the above listed algorithms.

Submit your report with the following details: -

i)Introduction

ii)Algorithm (Pseudocode or Flowchart)

iii)Details of the testing process (test cases and test data)

iv)Screen Output

v)Summary

vi)Attached the Rubrics (Group and Individual)

Include the source code as appendix and upload in the BB.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Modern Dental Assisting

Authors: Doni Bird, Debbie Robinson

13th Edition

978-0323624855, 0323624855

Students also viewed these Programming questions