Cited in
(28)- On the complexity of computing winning strategies for finite poset games
- scientific article; zbMATH DE number 7498442 (Why is no real title available?)
- On pruning search trees of impartial games
- ReGale: some memorable results
- Chomp on generalized Kneser graphs and others
- Complexity, appeal and challenges of combinatorial games
- A complete solution for the partisan chocolate game
- Previous player's positions of impartial three-dimensional chocolate-bar games
- Maximum Nim and chocolate bar games
- Recent results and questions in combinatorial game complexities
- Combinatorial games with a pass: a dynamical systems approach
- The complexity of poset games
- \textsc{Transverse wave}: an impartial color-propagation game inspired by social influence and quantum NIM
- Chomp on numerical semigroups
- Chomp, Recurrences and Chaos(?)
- Androids armed with poisoned chocolate squares: ideal Nim and its relatives
- Nim-type games
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Flipping the winner of a poset game
- David Gale in Paris
- Previous player's positions in impartial three-dimensional \textsc{chocolate}-bar games with constrained \textsc{chocolate} size
- Three-rowed CHOMP
- Automated conjecturing. III. Property-relations conjectures
- Nonlinear dynamics in combinatorial games: Renormalizing Chomp
- Combinatorial games on a graph
- A general upper bound for the runtime of a coevolutionary algorithm on impartial combinatorial games
- A deletion game on hypergraphs
- The Ungar games
This page was built for publication: A Curious Nim-Type Game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4048867)
