Answered step by step
Verified Expert Solution
Question
1 Approved Answer
By using java The Game of Nim ( Java Loops ) Follow instructions below by using java loops This is a well-known game with a
By using java
Follow instructions below by using java loops
This is a well-known game with a number of variants. The following variant has an interesting winning strategy:
- Two players alternately take marbles from a pile.
- In each move, a player chooses how many marbles to take.
- The player must take at least one but at most half of the marbles.
- Then the other player takes a turn.
- The player who takes the last marble loses.
Write a program in which the computer plays against a human opponent
- Generate a random integer between 10 and 100 to denote the initial size of the pile
- Generate a random integer between 0 and 1 to decide whether the computer or the human takes the first turn
- Generate a random integer between 0 and 1 to decide whether the computer plays smart or stupid
- In stupid mode the computer simply takes a random legal value (between 1 and n/2) from the pile whenever it has a turn
- In smart mode the computer takes off enough marbles to make the size of the pile a power of two minus 1that is, 3, 7, 15, 31, or 63. That is always a legal move, except when the size of the pile is currently one less than a power of two. In that case, the computer makes a random legal move (i.e., uses stupid mode).
You will note that the computer cannot be beaten in smart mode when it has the first move, unless the pile size happens to be 15, 31, or 63. Of course, a human player who has the first turn and knows the winning strategy can win against the computer.
Sample Output (user input shown in red)
run:
Current number of marbles in pile: 76
How many marbles do you want to remove:
12
Current number of marbles in pile: 64
Computer removes 1 marble(s).
Current number of marbles in pile: 63
How many marbles do you want to remove:
5
Current number of marbles in pile: 58
Computer removes 27 marble(s).
Current number of marbles in pile: 31
How many marbles do you want to remove:
15
Current number of marbles in pile: 16
Computer removes 1 marble(s).
Current number of marbles in pile: 15
How many marbles do you want to remove:
4
Current number of marbles in pile: 11
Computer removes 4 marble(s).
Current number of marbles in pile: 7
How many marbles do you want to remove:
3
Current number of marbles in pile: 4
Computer removes 1 marble(s).
Current number of marbles in pile: 3
How many marbles do you want to remove:
1
Current number of marbles in pile: 2
Computer removes 1 marble(s).
Current number of marbles in pile: 1
How many marbles do you want to remove:
1
Human took last marble, human loses.
BUILD SUCCESSFUL (total time: 6 minutes 4 seconds)
I would like you to help me figure to run this . Thank you
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started