Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
It is shown that, given an arbitrary GO position on an n × n board, the problem of determining the winner is Pspace hard. New techniques are exploited to overcome the difficulties arising from the planar nature of board games. In particular, it is proved that GO is Pspace hard by reducing a Pspace-complete set, TQBF, to a game called generalized geography, then to a planar version of that game, and finally to GO. © 1980, ACM. All rights reserved.
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
Seung Gu Kang, Jeff Weber, et al.
ACS Fall 2023
C.A. Micchelli, W.L. Miranker
Journal of the ACM
Ryan Johnson, Ippokratis Pandis
CIDR 2013