/* A C program to implement Game of Nim. The program assumes that both players are playing optimally */ #include #include #include #define COMPUTER 1 #define HUMAN 2 /* A Structure to hold the two parameters of a move A move has two parameters- 1) pile_index = The index of pile from which stone is going to be removed 2) stones_removed = Number of stones removed from the pile indexed = pile_index */ struct move { int pile_index; int stones_removed; }; /* piles[] -> Array having the initial count of stones/coins in each piles before the game has started. n -> Number of piles The piles[] are having 0-based indexing*/ // A C function to output the current game state. void showPiles (int piles[], int n) { int i; printf ("Current Game Status -> "); for (i=0; i 0) non_zero_indices [count++] = i; (*moves).pile_index = (rand() % (count)); (*moves).stones_removed = 1 + (rand() % (piles[(*moves).pile_index])); piles[(*moves).pile_index] = piles[(*moves).pile_index] - (*moves).stones_removed; if (piles[(*moves).pile_index] < 0) piles[(*moves).pile_index]=0; } return; } // A C function to play the Game of Nim void playGame(int piles[], int n, int whoseTurn) { printf("\nGAME STARTS\n\n"); struct move moves; while (gameOver (piles, n) == false) { showPiles(piles, n); makeMove(piles, n, &moves); if (whoseTurn == COMPUTER) { printf("COMPUTER removes %d stones from pile " "at index %d\n", moves.stones_removed, moves.pile_index); whoseTurn = HUMAN; } else { printf("HUMAN removes %d stones from pile at " "index %d\n", moves.stones_removed, moves.pile_index); whoseTurn = COMPUTER; } } showPiles(piles, n); declareWinner(whoseTurn); return; } void knowWinnerBeforePlaying(int piles[], int n, int whoseTurn) { printf("Prediction before playing the game -> "); if (calculateNimSum(piles, n) !=0) { if (whoseTurn == COMPUTER) printf("COMPUTER will win\n"); else printf("HUMAN will win\n"); } else { if (whoseTurn == COMPUTER) printf("HUMAN will win\n"); else printf("COMPUTER will win\n"); } return; } // Driver program to test above functions int main() { // Test Case 1 int piles[] = {3, 4, 5}; int n = sizeof(piles)/sizeof(piles[0]); // We will predict the results before playing // The COMPUTER starts first knowWinnerBeforePlaying(piles, n, COMPUTER); // Let us play the game with COMPUTER starting first // and check whether our prediction was right or not playGame(piles, n, COMPUTER); /* Test Case 2 int piles[] = {3, 4, 7}; int n = sizeof(piles)/sizeof(piles[0]); // We will predict the results before playing // The HUMAN(You) starts first knowWinnerBeforePlaying (piles, n, COMPUTER); // Let us play the game with COMPUTER starting first // and check whether our prediction was right or not playGame (piles, n, HUMAN); */ return(0); }