Consider a game in which two players take turns removing any positive number of pebbles they want from one of two piles of pebbles.

1.5k Views Asked by At

Consider a game in which two players take turns removing any positive number of pebbles they want from one of two piles of pebbles. The player who removes the last pebble wins the game. Show that if the two piles contain the same number of pebbles initially, then the second player can always guarantee a win.

1

There are 1 best solutions below

2
On

HINT: The second player can always leave two equal piles for the first player.