Summary
For many games, the decision problem of whether a player in a given situation has a winning strategy has been shown to be PSPACE-complete. Following the PSPACE-completeness results of Even and Tarjan [1] for generalized Hex on graphs and of Schaefer [6] for a variety of combinatorial games, the decision problems were shown to be PSPACE-hard for generalizations of Go and Checkers. In this paper a corresponding theorem is proved for the board-game Gobang, a variant of Go. Since the decision problem for Gobang states-of-play itself lies in PSPACE, it can be shown that Gobang is in fact PSPACE-complete.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literatur
Even, S., Tarjan, R.E.: A combinatorial problem which is complete in polynomial space. 7-th Annual ACM Symposium on Theory of Computing 1975, pp. 66–71
Fraenkel, A.S., Garey, M.R., Johnson, D.S., Schaefer, T.J., Yesha, Y.: The complexity of checkers on an n × n Board. 19-th Annual Symposium on Foundations of Computer-Science, 1978, pp. 55–64
Lichtenstein, D., Sipser, M.: Go is PSPACE-hard. 19-th Annual Symposium on Foundations of Computer-Science, 1978, pp. 48–54
Meyer, A.R., Stockmeyer, L.J.: Word problems requiring exponential time. Proceedings of the 5-th Annual ACM Symposium on Theory of Computing, 1973, pp. 1–9
Paul, W.J.: Komplexitätstheorie. Stuttgart: Teubner 1978
Schaefer, T.J.: On the complexity of some two-person-perfect-information games. Comput. System Sci. 16, 185–225 (1978)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Reisch, S. Gobang ist PSPACE-vollständig. Acta Informatica 13, 59–66 (1980). https://doi.org/10.1007/BF00288536
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288536