There are pebbles in a pocket ( is a positive integer). and decided to play a game. Each turn, a player has to take either 1,2 or 3 pebbles out of the pocket. The one who takes the last pebble out wins the game.
Adam goes first.
Assume the two boys always follow an optimized strategy that has the best chance to win the game.
What is the condition of so that Bob wins the game?
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.
No explanations have been posted yet. Check back later!