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.
- 2.Cazenave, T., Borsboom, J.: Golois wins Phantom Go tournament. ICGA J. 30(3), 165–166 (2007)Google Scholar
- 6.Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: Proceedings of the 24th International Conference on Machine Learning, ICML ’07, pp. 273–280. ACM Press, New York (2007)Google Scholar
- 7.Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with patterns in Monte-Carlo Go. Rapport de recherche INRIA RR-6062 (2006). http://hal.inria.fr/inria-00117266/en/
- 10.Robson, J.M.: The complexity of Go. In: IFIP Congress, pp. 413–417 (1983)Google Scholar