Abstract
The nim game is defined as follows. Suppose there are a few piles with a finite number of coins in each of them. Two players alternately take any number of coins from any single one of the piles. The winner is the player who removes the last coin (or the last few coins). Suppose now that two players, A and B, are playing the nim game, and that player A makes the first move. Is there a winning strategy for player A or B? If the answer to this question is yes, how should the player with a winning strategy play? Let us first consider some examples.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Mladenović, P. (2019). Mathematical Games. In: Combinatorics. Problem Books in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-00831-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-00831-4_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00830-7
Online ISBN: 978-3-030-00831-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)