Nim-type games

DOI10.1007/BF01771243MaRDI QIDQ1838431zbMATH OpenOpenAlexFDO

Authors David Gale, Abraham Neyman

Publication date 1982

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01771243

zbMATH Keywords

existence of winning strategymin-type gamestwo-person finite deterministic game

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)

Cites work

• A Curious Nim-Type Game

Cited in

(8)

• Recent results and questions in combinatorial game complexities
• Complexity, appeal and challenges of combinatorial games
• Chomp on generalized Kneser graphs and others
• Geodetic contraction games on trees
• The complexity of poset games
• A vertex and edge deletion game on graphs
• Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice
• A deletion game on hypergraphs

This page was built for publication: Nim-type games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838431)