A Note on Computational Complexity of Kill-all Go

Kill-all Go is a variant of Go in which Black tries to capture all white stones, while White tries to survive. We consider computational complexity of Kill-all Go with two rulesets, Chinese rules and Japanese rules. We prove that: (i) Kill-all Go with Chinese rules is PSPACE-hard, and (ii) Kill-all...

Full description

Saved in:
Bibliographic Details
Main Author Zhang, Zhujun
Format Journal Article
LanguageEnglish
Published 26.11.2019
Subjects
Computer Science - Computational Complexity
Online AccessGet full text

Cover

More Information
Summary:Kill-all Go is a variant of Go in which Black tries to capture all white stones, while White tries to survive. We consider computational complexity of Kill-all Go with two rulesets, Chinese rules and Japanese rules. We prove that: (i) Kill-all Go with Chinese rules is PSPACE-hard, and (ii) Kill-all Go with Japanese rules is EXPTIME-complete.
DOI:10.48550/arxiv.1911.11405