On the complexity of computing winning strategies for finite poset games

DOI10.1007/s00224-010-9254-yzbMath1217.68113OpenAlexW2168635355MaRDI QIDQ537910

Craig Wilson, Michael Soltys

Publication date: 23 May 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9254-y

zbMATH Keywords

posetsproof complexityPSPACEfinite games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

The Complexity of Poset Games ⋮ Unnamed Item ⋮ Advances in finding ideal play on poset games ⋮ Sprague-Grundy theory in bounded arithmetic

Uses Software

• Chomp3Rows

Cites Work

• A complete analysis of von Neumann's Hackendot
• On the complexity of some two-person perfect-information games
• Nonlinear dynamics in combinatorial games: Renormalizing Chomp
• A Curious Nim-Type Game
• Computer Science Logic
• Three-rowed CHOMP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of computing winning strategies for finite poset games