Gobang ist PSPACE-vollständig

  title={Gobang ist PSPACE-vollst{\"a}ndig},
  author={Stefan Reisch},
  journal={Acta Informatica},
  • Stefan Reisch
  • Published 2004
  • Mathematics, Computer Science
  • Acta Informatica
  • 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

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Hex ist PSPACE-vollständig
    • 90
    Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
    • W. Slany
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2002
    • 5
    On the NP-completeness of the Slither Link Puzzle
    • 21
    • PDF
    QBF Encoding of Generalized Tic-Tac-Toe
    • 3
    • PDF
    Positional Games and QBF: The Corrective Encoding
    • PDF
    Nim is Easy, Chess is Hard - But Why??
    • A. Fraenkel
    • Computer Science
    • J. Int. Comput. Games Assoc.
    • 2006
    • 3
    • PDF
    Rikudo is NP-complete
    • PDF
    Games, puzzles and computation
    • 170
    • PDF


    GO is pspace hard
    • 30
    • PDF
    The complexity of checkers on an N × N board
    • 65
    On the Complexity of Some Two-Person Perfect-Information Games
    • 235
    A combinatorial problem which is complete in polynomial space
    • 48
    Word problems requiring exponential time(Preliminary Report)
    • 820
    • PDF
    Word problems requiring exponential time
    • Proceedings of the 5th Annual ACM Symposium on Theory of Computing,
    • 1973