Question

Nim Game In java a) Write an Is-winning function in java such that:

Input: pile size and the set of allowed moves.

Output: True if and only if the first player would win with the best play.

b) Make a computer player that will play a perfect game versus the user.

Answer 1

import java.util.Scanner;

public class Main {

public static int input;
public static int piles = 12;
public static int com = (int) (Math.random() * 3 + 1);

@SuppressWarnings("resource")
public static void main(String[] args) throws InterruptedException {

System.out.println("There Are 12 piless, You Can Only Remove Up To 3 piless At A Time");
System.out.println("Your Goal Is To Remove The Last piles, piles 1");
System.out.println("To Remove A piles Either Enter 1, 2 or 3");
System.out.println("");

while (true) {

if (piles == 1) {
System.out.println("There Is " + piles + " piles Remaining");
} else {
System.out.println("There Are " + piles + " piless Remaining");
}

Scanner sc = new Scanner(System.in);
input = sc.nextInt();

if (input > 3 || input < 1) {
System.out.println("You Can Only Remove 3 piless At A Time");
} else {

piles = piles - input;

Thread.sleep(250);
int guess = 4 - input;
if (guess == 1) {
System.out.println("The Computer Has Removed " + guess + " piles");
} else {
System.out.println("The Computer Has Removed " + guess + " piless");
}
if (piles - guess == 0) {
System.out.println("There Are No piless Remaining, The Computer Has Won!!");
System.out.println("The Computer Has Won");
return;
}
if (piles - input == 0) {
System.out.println("There Are No piless Remaining, You Have Won!! True");
return;
}
piles = piles - guess;

}
}
}

}