Strings-and-Coins and Nimstring are PSPACE-complete

zbMath1490.91031arXiv2101.06361MaRDI QIDQ3390719

Yevhenii Diomidov, Erik D. Demaine

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2101.06361

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46) Algorithmic game theory and complexity (91A68)

Cites Work

• On the complexity of some two-person perfect-information games
• Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strings-and-Coins and Nimstring are PSPACE-complete