Gobang ist PSPACE-vollständig

Abstract

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. © 1980 Springer-Verlag.