Reference no: EM131065479

Example of Play

Player 1 picks a letter.
Player 2 picks a 2nd letter, which must be a 2nd letter of an actual word, but not yet a full word.
Next player picks the 3rd letter, which must be a 3rd letter of an actual word, but not yet a full word.
To lose, you are forced to pick a letter the will spell a complete word.
To stay in the game or win, you add a letter that will not yet spell a complete word.
The letter sequence MUST lead to the spelling of an actual word.
2 to 4 player (no computer player) - Prompt the user for number of players. Validate.

Requirements:

Find an English word list online (minimum of 100,000 words) and upload the list into an appropriate data structure.

During the play, have the user letter sequence verified; it must lead to an actual word. If not, then inform the player to try again.

Keep track of each player's number of incorrect letter selections.

Who wins/looses?

A Player who is forced to spell a complete word is last place

Other players are ranked by the number of non word letters they tried... the fewer the better.

Use the appropriate data structures to create this game.

Hint: A Trie Tree and others....

Use lower case letters for words.

To play the game

Int main() {
GhostGame G;
G.Play();
}

What to hand in
A description of your program and its features.
A description of your program's command-line syntax.
A description of the main data structures your program uses.
A discussion of the current status of your program, what works and what doesn't, etc.
Your program's source code.
Your plan that you used to write your code (See below)
Screen prints of the successful execution of your code.
Constraints

This project will require you to implement one or more data structures. Either use the STL or write your own classes, it is up to you.