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.
Recommendations
Cited in
(21)- Restriction of simple games
- Restricted housewapping games
- Multi-player small Nim with passes
- Multi-player End-Nim games
- One-pile Nim games with arbitrarily many random players
- Multi-player Wythoff's game and its variants
- Sprague-Grundy values of the \(\mathcal{R}\)-Wythoff game
- One pile misère bounded Nim with two alliances
- The game of End-Wythoff
- General restriction of (s,t)-Wythoff's game
- Two variants of Wythoff's game preserving its P-positions
- Cold positions of the restricted Wythoff's game
- Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves
- General restrictions of Wythoff-like games
- Self-similarity of \(\mathcal{P}\)-positions of \((2n+1)\)-dimensional Wythoff's game
- Misère Nim with multi-player
- On restricted Wythoff's nim
- \(a\)-Wythoff's game with \(n\) players
- The Raleigh game
- Multi-player subtraction games
- Nim with one or two dynamic restrictions
This page was built for publication: A restricted version of Wythoff's game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648398)
