A Note on Computational Complexity of Kill-all Go

11/26/2019

∙

by   Zhujun Zhang, et al.

∙

0

∙

share

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.