Multi-player subtraction games
From MaRDI portal
Publication:729996
DOI10.1016/j.tcs.2016.10.016zbMath1356.91035OpenAlexW2551953043MaRDI QIDQ729996
Publication date: 23 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.10.016
Related Items (6)
An exact quantum algorithm for a restricted subtraction game ⋮ 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 ⋮ Multiplayer games as extension of misère games
Cites Work
- One pile misère bounded Nim with two alliances
- General restriction of \((s,t)\)-Wythoff's game
- Analyzing \(n\)-player impartial games
- Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves
- General restrictions of Wythoff-like games
- A restricted version of Wythoff's game
- Analysis of one pile misère Nim for two alliances
- Nim with one or two dynamic restrictions
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
- \(N\)-player partizan games
- Geometrical extensions of Wythoff's game
- Nimhoff games
- \(N\)-person Nim and \(N\)-person Moore's games
- Dynamic one-pile blocking Nim
- Three-player impartial games.
- One-pile misère Nim for three or more players
- \(n\)-player impartial combinatorial games with random players
- Three Person Winner-Take-All Games with McCarthy's Revenge Rule
- A Generalization of Wythoff's Game*
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- The game of End-Nim
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multi-player subtraction games