Simulates the game of Nim, in which two players alternate in removing the stones arranged in piles. On each turn, a player must remove one or more stones, provided all stones come from the same pile. The player that takes the last stone/s from the only remaining pile wins the game. First, go to the following site to play the game a few times to understand how it is played: (the piles are arranged in columns and clicking on a specific dot indicate
-
Ask player 1 for his name
-
Ask player 2 for his name
-
Use random number generator to generate between 2 to 5 piles and to generate between 1 to 8 stones in each pile.
-
Display the board in the following fashion: (Note: O is the letter capital O)
Pile 1: O O O
Pile 2: O
Pile 3: O O
Pile 4: O O O O O O O O
-
Ask player 1 for the move – the pile number and the number of stones to remove. You need to make sure that if a user enters something invalid, whether the pile or stone number, you ask for input again until valid input is entered. Also, the program is to give a suggestion to player 1 as to the number of stones to remove and from which pile in order to win the game. The winning strategy that is to be proposed by the program is explained later on in this document.
-
Repeat step 4
-
Repeat step 5 for player 2.
-
When the game terminates, you need to proclaim the winner.
-
You should ask, if the players want to play the game again; if so, repeat steps 1-9 You are given a sample program run below – make sure your prompts look like the ones provided in the sample run.