Learn More
There 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(More)
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(More)
  • 1