Abstract
The game of Go is often said to be exptime-complete. The result refers to classical Go under Japanese rules, but many variants of the problem exist and affect the complexity. We survey what is known on the computational complexity of Go and highlight challenging open problems. We also propose a few new results. In particular, we show that Atari-Go is pspace-complete and that hardness results for classical Go carry over to their Partially Observable variant.
Cite
CITATION STYLE
Saffidine, A., Teytaud, O., & Yen, S. J. (2015). Go complexities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9525, pp. 76–88). Springer Verlag. https://doi.org/10.1007/978-3-319-27992-3_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
