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

Urban Larsson

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…