Gobang ist PSPACE-vollständig
@article{Reisch2004GobangIP,
title={Gobang ist PSPACE-vollst{\"a}ndig},
author={Stefan Reisch},
journal={Acta Informatica},
year={2004},
volume={13},
pages={59-66}
}SummaryFor 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… CONTINUE READING
27 Citations
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2002
- 5
References
SHOWING 1-6 OF 6 REFERENCES
GO is pspace hard
- Computer Science
- 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
- 1978
- 30
- PDF
The complexity of checkers on an N × N board
- Computer Science
- 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
- 1978
- 65
On the Complexity of Some Two-Person Perfect-Information Games
- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 1978
- 235
A combinatorial problem which is complete in polynomial space
- Mathematics, Computer Science
- STOC '75
- 1975
- 48
Word problems requiring exponential time
- Proceedings of the 5th Annual ACM Symposium on Theory of Computing,
- 1973