A Note on Computational Complexity of Kill-all Go
Computational Complexity
2019-11-27 v1
Abstract
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.
Cite
@article{arxiv.1911.11405,
title = {A Note on Computational Complexity of Kill-all Go},
author = {Zhujun Zhang},
journal= {arXiv preprint arXiv:1911.11405},
year = {2019}
}
Comments
15 pages, 11 figures