Scribd
Upload
5 views1 page

Winning Strategies in Nim Game

The document describes a game involving multiple players taking sticks in turns from a pile until one player takes the last stick. It asks a series of questions about the strategies and stick values needed to guarantee wins for different numbers of players and sticks. The questions explore how the optimal strategies change based on the number of players and initial stick values.

Uploaded by

matthieuck
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views1 page

Winning Strategies in Nim Game

The document describes a game involving multiple players taking sticks in turns from a pile until one player takes the last stick. It asks a series of questions about the strategies and stick values needed to guarantee wins for different numbers of players and sticks. The questions explore how the optimal strategies change based on the number of players and initial stick values.

Uploaded by

matthieuck
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Nim is a game in which two players alternately take one or more objects from one of

a group of objects, each trying to take the last remaining object.


There are 25 sticks in a pile, and 2 players. Each player can take between 1 and
3 sticks in his or her turn. Explain the strategy player 1 must use to ensure a win.
answer:
Player 1 accidentally picks up the wrong number of sticks on his first turn. What
are the two ways the other player can pick up sticks to ensure he wins?
answer:
There are now n sticks. What value(s) does n have to be for player 1 to be
guaranteed a win, and what value(s) does n have to be for player 2 to be guaranteed
a win? (assume both players use the optimal strategy)
answer:
There are once again 25 sticks, but there are now 3 players. What strategy
should player 1 use to ensure a win?
answer:
There are 3 players, but there are now n sticks (did you see that coming?) on the
floor. What value(s) does n have to be to guarantee player 1 a win, and what
value(s) does n have to be to guarantee player 2 a win?
answer:
There are now x players and n sticks. What value(s) must n now be, in terms of x,
to guarantee that player 1 wins?
answer:

You might also like