arXiv Analytics

Sign in

arXiv:0710.3632 [math.CO]AbstractReferencesReviewsResources

2-pile Nim with a Restricted Number of Move-size Imitations

Urban Larsson

Published 2007-10-19, updated 2009-06-02Version 3

We study a variation of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the following constraint: Suppose the previous player has just removed say $x>0$ tokens from the shorter pile (either pile in case they have the same height). If the next player now removes $x$ tokens from the larger pile, then he imitates his opponent. For a predetermined natural number $p$, by the rules of the game, neither player is allowed to imitate his opponent on more than $p-1$ consecutive moves. We prove that the strategy of this game resembles closely that of a variant of Wythoff Nim--a variant with a blocking manoeuvre on $p-1$ diagonal positions. In fact, we show a slightly more general result in which we have relaxed the notion of what an imitation is.

Comments: 18 pages, with an appendix by Peter Hegarty
Categories: math.CO
Subjects: 91A46
Related articles: Most relevant | Search more
arXiv:2007.03949 [math.CO] (Published 2020-07-08)
Atomic weights and the combinatorial game of Bipass
arXiv:0804.0640 [math.CO] (Published 2008-04-04)
Further Hopping with Toads and Frogs
arXiv:2203.13971 [math.CO] (Published 2022-03-26)
There are infinitely many monotone games over $L_5$