Nim is a game of strategy in which two players take turns removing sticks from a common pile. There are many variations of Nim but for the purposes of this assignment, we will stick with a simple and common implementation. On each turn, a player must remove either 1 or 2 sticks from the pile. The goal of the game is to be the player who removes the last stick.
In this assignment, you will design a game in which one human player is competing against a computer. The human player should also be able to decide if he or she wants to play the first or second move.
It’s important to note that while there is a winning strategy for this game, you are required only to implement a computer player which employs random moves.
Example output of one game:
Computer starts Round 0, 7 sticks at start, computer took 2, so 5 sticks remain Round 1, 5 sticks at start, human took 1, so 4 sticks remain Round 2, 4 sticks at start, computer took 2, so 2 sticks remain Round 3, 2 sticks at start, human took 1, so 1 sticks remain Round 4, 1 sticks at start, computer took 1, so 0 sticks remain Computer wins
Be careful! A human might enter 5 if 5 sticks are left, and if you are not careful, the human could win by playing in that way.
Don’t accept the user’s input if it is illegal. Continue prompting until you get a valid input.
Nimclass in the
lab2package of the
labssource folder in your repository.
ArgsProcessorto prompt for inputs.