Abstract
This paper introduces a new variant of Nim game, the Greedy Nim\(_\mathrm{{k}}\) Game. We present a complete solution for this game.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albert MH, Nowakowski RJ (2001) The game of end-nim. Electron J Combin 8(2):1
Albert MH, Nowakowski RJ (2004) Nim restrictions. Integers Electron J Comb Number Theory 4:G01
Bouton CL (1902) Nim, a game with a complete mathematical theory. Ann Math 3(2):35–39
Cole AJ, Davie AJ (1969) A game based on the Euclidean algorithm and a winning strategy for it. Math Gaz 53:354–357
Fukuyama M (2003) A Nim game played on graphs. Theor Comput Sci 304:387–399
Li S-YR (1978) N-person Nim and N-person Moore’s games. Int J Game Theory 7:31–36
Lim C-W (2005) Partial Nim. Integers Electron J Comb Number Theory 5:G02
Low RM, Chan WH (2015) An Atlas of N- and P-positions in ‘nim with a pass’. Integers 15:G2
Moore EH (1910) A generalization of a game called nim. Ann Math 11:93–94
Schwartz BL (1971) Some extensions of nim. Math Mag 44(5):252–257
Wythoff W (1907) A modification of the game of Nim. Nieuw Arch Wisk 7:199–202
Xu R, Zhu X (2018) Bounded greedy nim game. Theor Comput Sci (to appear)
Acknowledgements
Funding was provided by The National Natural Science Fund (Grant Nos. KYZKJY11186 and NSF11571319).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lv, X., Xu, R. & Zhu, X. Greedy Nim\(_\mathrm{{k}}\) Game. J Comb Optim 35, 1241–1249 (2018). https://doi.org/10.1007/s10878-018-0265-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-018-0265-y