A restricted version of Wythoff's game
The electronic journal of combinatorics, Tome 18 (2011) no. 1
E. Duchêne and S. Gravier present the following open problem: In Wythoff's game, each player can either remove at most $R$ tokens from a single heap (i.e. there is an upper bound $R$ on the number of removing tokens), or remove the same number of tokens from both heaps but there is no upper bound on the number of removing tokens. This open problem is investigated and all its P-positions are given.
@article{10_37236_694,
author = {Wen An Liu and Haifeng Li and Bei Li},
title = {A restricted version of {Wythoff's} game},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/694},
zbl = {1233.91057},
url = {http://geodesic.mathdoc.fr/articles/10.37236/694/}
}
Wen An Liu; Haifeng Li; Bei Li. A restricted version of Wythoff's game. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/694
Cité par Sources :