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.
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers38
Suggested Problems
-
Back to basics 23 - Triangular matrix
1120 Solvers
-
Sum of first n terms of a harmonic progression
499 Solvers
-
752 Solvers
-
771 Solvers
-
676 Solvers
More from this Author10
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
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.
Isn't the answer supposed to be a binary output?