A probability problem by Áron Bán-Szabó
Sharky and Ivan are playing a strange game, with Sharky going first.
They start with two heaps: a left and a right heap. The left heap contains 6, the right heap contains 4 coins. They then take turns to remove some of the coins using the two rules below.
You may either
-
remove one coin from both of the heaps.
-
remove exactly one coin from one of the heaps.
If a person makes the last move, then lose. Who has the winning strategy?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Sharky in all the games need almost an even number of heaps coin to win and Ivan needs odd number of heaps to win and Sharky is first so they start making a odd number that in the end of the game (almost all the games) Ivan win.