A restricted version of Wythoff's game
Summary: \textit{E. Duchêne} and \textit{S. Gravier} [Discrete Math. 309, No. 11, 3595--3608 (2009; Zbl 1165.91007)] 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.
scientific article; zbMATH DE number 5976485