Theory of annihilation games. I

DOI10.1016/0095-8956(82)90058-2zbMath0493.90099OpenAlexW1971342303MaRDI QIDQ1168901

Aviezri S. Fraenkel, Yaacov Yesha

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90058-2

zbMATH Keywords

algorithmcomputational complexityannihilation gamescomputation of best strategiescomputation of winning positionsfinite digraph

Mathematics Subject Classification ID

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

Related Items (9)

Complexity, appeal and challenges of combinatorial games ⋮ PSPACE-Hardness of some combinatorial games ⋮ The generalized Sprague-Grundy function and its invariance under certain mappings ⋮ The complexity of node blocking for dags ⋮ Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture ⋮ The complexity of pursuit on a graph ⋮ Undirected edge geography ⋮ The particles and antiparticles game ⋮ Recent results and questions in combinatorial game complexities

Cites Work

• Complexity of problems in games, graphs and algebraic equations
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• Computing a perfect strategy for nxn chess requires time exponential in n
• On the complexity of some two-person perfect-information games
• Gobang is PSPACE-complete
• Three Annihilation Games
• Provably Difficult Combinatorial Games
• GO Is Polynomial-Space Hard
• Theory of annihilation games
• A Combinatorial Problem Which Is Complete in Polynomial Space
• Graphs and composite games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theory of annihilation games. I