Hex ist PSPACE-vollständig

  title={Hex ist PSPACE-vollst{\"a}ndig},
  author={Stefan Reisch},
  journal={Acta Informatica},
  • S. Reisch
  • Published 1 June 1981
  • Mathematics
  • Acta Informatica
SummaryThere are a number of board games such as Checkers [2], Go [5], and Gobang [8], which are known to be PSPACE-hard. This means that the problem to determine the player having a winning strategy in a given situation on an n×n board of one of these games is as hard to solve as everything computable in polynomial space. PSPACE-completeness has been previously proven for some combinatorial games played on graphs or by logical formulas [1, 9].In this paper we will show that the same holds for… 
Amazons is PSPACE-complete
This work gives a reduction from one of the PSPACE-complete two-player formula games described by Schaefer, and provides an alternate proof that simple Amazons endgames are NP-equivalent.
The Parameterized Complexity of Positional Games
The main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves, which solves an open problem from Downey and Fellows' influential list of open problems from 1999 and suggests a rough parameterized complexity categorization into positional games that are complete for the first level of the W-hierarchy when the winning configurations only depend on which vertices one player has been able to pick.
Amazons, Konane, and Cross Purposes are PSPACE-complete
The construction provides an alternate proof that simple Amazons endgames are NP-equivalent, and gives similar reductions to each game from one of the PSPACE-complete two-player formula games described by Schaefer.
Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game
From the standpoint of computational complexity, it is established that, although there are positions where one player has no legal move, there is no position where both players lack a legal move and that the game cannot end in a draw.
Set colouring games
The thesis generalizes all previously known Hex theory to this class, and identifies conditions that give rise to these properties, which enables rigorous proofs of game properties previously known only colloquially, as well as introduction of new properties.
Games, puzzles and computation
This thesis develops the idea of game as computation to a greater degree than has been done previously, and presents a general family of games, called Constraint Logic, which is both mathematically simple and ideally suited for reductions to many actual board games.
Pomax games - a family of partizan games played on posets
We introduce the following class of partizan games, called pomax games. Given a partially ordered set whose elements are colored black or white, the players Black and White take turns removing any
A PSPACE-complete Sperner Triangle Game
It is proved that deciding whether one can win the game is a PSPACE-complete problem and there is an elegant balance in the game such that neither the first nor the second player always has a decisive advantage.


Gobang ist PSPACE-vollständig
It can be shown that Gobang is in fact PSPACE-complete, a variant of Go, since the decision problem for Gobang states-of-play itself lies in PSPACE.
GO is pspace hard
A great deal of effort has been spent in the search for optimal and computationally feasible game strategies, but recently it has become possible to provide compelling evidence that such strategies may not always exist.
The complexity of checkers on an N × N board
Under certain reasonable assumptions about the "drawing rule" in force, the problem of whether a specified player can force a win against best play by his opponent is shown to be PSPACE-hard.
On the Complexity of Some Two-Person Perfect-Information Games
A Combinatorial Problem Which Is Complete in Polynomial Space
It is shown that determining who wins such a game if each player plays perfectly is very hard; this result suggests that the theory of combinational games is difficult.
Word problems requiring exponential time(Preliminary Report)
A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.
Efficient Planarity Testing
An efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane is described, which used depth-first search and has time and space bounds.
Gobang is PSPACE-vollstS.ndig
  • Acta Informat
  • 1980
Word problems requiring exponential time
  • 5th annual ACM Symposium on Theory of Computing,
  • 1973