A Curious Nim-Type Game
From MaRDI portal
Publication:4048867
DOI10.2307/2319446zbMath0295.90045OpenAlexW4252982746MaRDI QIDQ4048867
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
Related Items
Complexity, appeal and challenges of combinatorial games ⋮ Chomp on numerical semigroups ⋮ David Gale in Paris ⋮ ReGale: some memorable results ⋮ Combinatorial games on a graph ⋮ The Complexity of Poset Games ⋮ Automated conjecturing. III. Property-relations conjectures ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Chomp on generalized Kneser graphs and others ⋮ On pruning search trees of impartial games ⋮ Chomp, Recurrences and Chaos(?) ⋮ On the complexity of computing winning strategies for finite poset games ⋮ Three-rowed CHOMP ⋮ Androids Armed With Poisoned Chocolate Squares: Ideal Nim and Its Relatives ⋮ Nonlinear dynamics in combinatorial games: Renormalizing Chomp ⋮ Flipping the winner of a poset game ⋮ Nim-type games ⋮ Recent results and questions in combinatorial game complexities ⋮ A deletion game on hypergraphs ⋮ Combinatorial games with a pass: A dynamical systems approach