Nim
Dan and Sam play a game on a cube, that consists of 512 objects; each one must take at least one object and at most a whole heap, in his turn.
As an explicit example: in the first turn, Dan can take just the bottom front left corner object, or can take a whole vertical central heap, or the whole bottom front horizontal heap. Thus, he can take any number of objects of one of the 512 initial heaps (heaps cannot be diagonals).
The winner is the one who takes the last object. If Dan begins, who will win? This means, who has a winning strategy?
This is the sixteenth problem of the set Winning Strategies .
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.
If Dan starts, he moves a heap of any possible amount (for simplicity sake he moves all except the farthest face of 64). Sam can then move the last heap. No matter the amount of steps, San will take the last heap