### Skapa referens, olika format (klipp och klistra)

**Harvard**

Larsson, U. (2007) *Two-pile Nim with a restricted number of move size imitations*. (Preprint - Department of Mathematical Sciences, Chalmers University of Technology and Göteborg University, nr: 2008:3).

** BibTeX **

@unpublished{

Larsson2007,

author={Larsson, Urban},

title={Two-pile Nim with a restricted number of move size imitations},

abstract={We study a version of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the following constraint :
Provided the previous player has just removed say x > 0 tokens from the pile with less tokens, the next player may remove x tokens from the pile with more tokens. But for each move, in "a strict sequence of previous player - next player moves", such an imitation takes place, the value of an imitation counter is increased by one unit. As this counter reaches a predetermined natural number, then by the rules of this game, if the previous player once again removes a positive number of tokes from the pile with less tokens, the next player may not remove the same number of tokens from the pile with more tokens.
We show that the winning positions of this game in a sense resemble closely the winning positions of the game of Wythoff Nim - more precisely a version of Wythoff Nim with a Muller twist. In fact, we show a slightly more general result in which we have relaxed the notion of what an imitation is.},

year={2007},

series={Preprint - Department of Mathematical Sciences, Chalmers University of Technology and Göteborg University, no: 2008:3},

keywords={Combinatorial game theory},

note={21},

}

** RefWorks **

RT Unpublished Material

SR Print

ID 66663

A1 Larsson, Urban

T1 Two-pile Nim with a restricted number of move size imitations

YR 2007

AB We study a version of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the following constraint :
Provided the previous player has just removed say x > 0 tokens from the pile with less tokens, the next player may remove x tokens from the pile with more tokens. But for each move, in "a strict sequence of previous player - next player moves", such an imitation takes place, the value of an imitation counter is increased by one unit. As this counter reaches a predetermined natural number, then by the rules of this game, if the previous player once again removes a positive number of tokes from the pile with less tokens, the next player may not remove the same number of tokens from the pile with more tokens.
We show that the winning positions of this game in a sense resemble closely the winning positions of the game of Wythoff Nim - more precisely a version of Wythoff Nim with a Muller twist. In fact, we show a slightly more general result in which we have relaxed the notion of what an imitation is.

T3 Preprint - Department of Mathematical Sciences, Chalmers University of Technology and Göteborg University, no: 2008:3

LA eng

OL 30