One-pile Nim games with arbitrarily many random players
From MaRDI portal
Publication:1727724
DOI10.1016/j.dam.2018.09.006zbMath1407.91070OpenAlexW2898101682WikidataQ129046487 ScholiaQ129046487MaRDI QIDQ1727724
Jia Wei Duan, Jing Wang, Wen An Liu
Publication date: 20 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.09.006
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
- Misère Nim with multi-player
- A restricted version of Wythoff's game
- Analysis of one pile misère Nim for two alliances
- Multi-player subtraction games
- 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*
- The game of End-Nim
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: One-pile Nim games with arbitrarily many random players