A complete analysis of von Neumann's Hackendot

DOI10.1007/BF01769768MaRDI QIDQ1139510zbMATH OpenFDO

Authors J. Úlehla

Publication date 1980

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3521877 (Why is no real title available?)
• scientific article; zbMATH DE number 3020856 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Graphs and composite games

Cited in

(11)

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

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

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