Problem 1481. Game of Nim

Created by G K
Appears in Board Games I

Difficulty:Rate

Solve Later
Add To GroupÃ‚

The Game of Nim is a famous studied 2 player strategy game. http://en.wikipedia.org/wiki/Nim

There are 3 heaps, and you are given the number of pebbles in each heap. Player 1 and 2 take turns removing pebbles from each heap. Game ends when a player cannot remove any pebbles from any heap, and the last player able to do so is the winner.

Given the number of pebbles in each heap, determine if player-1 will win assuming that both player play their optimal strategy, ie their best possible moves.

Problem 5) Prev: 1478 Next: 1482

Solve

Solution Stats

68 Solutions
34 Solvers

Last Solution submitted on Jul 18, 2023

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Paul Berglund on 2 May 2013

For the test case [7 7 7] all of [1 7] [2 7] [3 7] should be valid responses, right? Also you don't have any test cases where the game is not winnable.

Shashank on 18 Jul 2023

Isn't the answer supposed to be a binary output?