A Curious Nim-Type Game
From MaRDI portal
Publication:4048867
DOI10.2307/2319446zbMATH Open0295.90045OpenAlexW4252982746MaRDI QIDQ4048867FDOQ4048867
Authors: David Gale 
Publication date: 1974
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2319446
Cited In (25)
- Combinatorial games with a pass: A dynamical systems approach
- Androids Armed With Poisoned Chocolate Squares: Ideal Nim and Its Relatives
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of computing winning strategies for finite poset games
- 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
- Recent results and questions in combinatorial game complexities
- Chomp, Recurrences and Chaos(?)
- Chomp on numerical semigroups
- Nim-type games
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- David Gale in Paris
- Flipping the winner of a poset game
- Three-rowed CHOMP
- Nonlinear dynamics in combinatorial games: Renormalizing Chomp
- Automated conjecturing. III. Property-relations conjectures
- Combinatorial games on a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- A deletion game on hypergraphs
- The Ungar games
- The Complexity of Poset 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)
