Talk:List of PSPACE-complete problems

Untitled
The generalized piano mover's problem is PSPACE-complete (John Canny - Some Algebraic and Geometric Computations in PSPACE, John H. Reif - Complexity of the Mover's Problem and Generalizations). I will add it when i find some time.

There are quite a few PSPACE-complete games and puzzles not listed in this article. I cannot add them because I have a COI as an author of several of these results. The ones I am aware of that are not listed are:
 * Sliding-block puzzles
 * Sliding-coin puzzles
 * Plank Puzzles
 * Block-pushing puzzles Push-2-F, PushPush-k, and Push-*-F (all related to Sokoban)
 * Rolling block mazes
 * Konane
 * Cross Purposes
 * A large family of token games on DAGs (e.g. Annihilation, Hit, Capture, Node Blocking, Edge Blocking, Pursuit)
 * Node Kayles (and Partizan Node Kayles)
 * Snort
 * Shannon Switching Game on directed graph edges

All of these are described in the paper Playing Games with Algorithms: Algorithmic Combinatorial Game Theory and Appendix A of the book Games, Puzzles, and Computation

PSPACE-complete problems in graph theory that are not listed on the page include Deterministic Constraint Logic, Nondeterministic Constraint Logic, and Bounded Two-Player Constraint Logic. Bobhearn (talk) 21:03, 2 April 2010 (UTC)

The article lists the emptiness problem for regular expressions as PSPACE-complete. This is incorrect, as for regular expressions it is solvable in DTIME(n). It is only PSPACE-complete for regular expressions with intersection. I removed it from the article, as I think it should only be in there if this issue is clarified. Jooohnas (talk) 11:52, 1 July 2011 (UTC)

DFA intersection emptyness
The intersection of two DFA can be calculated and has maximal size of n*m. Emptyness is a linear problem, thus it is bilinear regarding the two input automata. Thus it should be not PSPACE-complete. — Preceding unsigned comment added by 138.246.2.173 (talk) 19:23, 6 December 2012 (UTC)

PSPACE-completeness comes in here for an unbound number of automata. For two automata it is indeed in P. 82.135.69.43 (talk) 07:23, 1 September 2014 (UTC)

Snake Pspace complete
The video game Snake is Pspace complete. See this link: Snake is pspace complete

— Preceding unsigned comment added by 79.109.5.165 (talk) 19:13, 2 December 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 4 external links on List of PSPACE-complete problems. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20070930044618/http://homepages.cwi.nl/~tromp/lad.ps to http://homepages.cwi.nl/~tromp/lad.ps
 * Added archive https://web.archive.org/web/20110608053819/http://www.cs.toronto.edu/~philipp/pages/papers/BWPebbling.pdf to http://www.cs.toronto.edu/~philipp/pages/papers/BWPebbling.pdf
 * Added archive https://web.archive.org/web/20070927225749/http://sciencelinks.jp/j-east/article/200212/000020021202A0428168.php to http://sciencelinks.jp/j-east/article/200212/000020021202A0428168.php
 * Added archive https://web.archive.org/web/20080905124129/http://www.cs.berkeley.edu/~alexf/papers/fp08.pdf to http://www.cs.berkeley.edu/~alexf/papers/fp08.pdf

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 20:30, 26 December 2017 (UTC)