A complete analysis of von Neumann's Hackendot

DOI10.1007/BF01769768zbMath0433.90101MaRDI QIDQ1139510

J. Úlehla

Publication date: 1980

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

zbMATH Keywords

treefinite gameparticular gamedetermination of winning strategyexplicit strategy descriptionHackendotHackendot-kimpartial two-person combinatorial gamemove selection ruleNim like game

Mathematics Subject Classification ID

Game theory (91A99) 2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (11)

Complexity, appeal and challenges of combinatorial games ⋮ PSPACE-Hardness of some combinatorial games ⋮ Winning ways of weighted poset games ⋮ The Complexity of Poset Games ⋮ Geodetic contraction games on graphs ⋮ A complete analysis of black-white Hackendot ⋮ Geodetic Contraction Games on Trees ⋮ On the complexity of computing winning strategies for finite poset games ⋮ Unnamed Item ⋮ Recent results and questions in combinatorial game complexities ⋮ A deletion game on hypergraphs

Cites Work

• Graphs and composite games
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A complete analysis of von Neumann's Hackendot