List of PSPACE-complete problems

Here are some of the more commonly known problems that are PSPACE-complete when expressed as decision problems. This list is in no way comprehensive.

Generalized versions of:

AmazonsAtomix · Checkers · Dyson Telescope Game · Cross Purposes · Geography · Ko-free Go · Ladder capturing in Go · Gomoku · Hex · Konane · Lemmings · Node Kayles · Poset Game · Reversi · River Crossing · Rush Hour · Finding optimal play in Mahjong solitaire · Sokoban · Super Mario Bros. · Black Pebble game · Black-White Pebble game · Acyclic pebble game · One-player pebble game · Token on acyclic directed graph games: Annihilation; Hit; Capture; Edge Blocking; Target; Pursuit

Quantified boolean formulas · First-order logic of equality · Satisfaction in intuitionistic propositional logic · Satisfaction in modal logic S4 · First-order theory of the natural numbers under the successor operation · First-order theory of the natural numbers under the standard order · First-order theory of the integers under the standard order · First-order theory of well-ordered sets · First-order theory of binary strings under lexicographic ordering · First-order theory of a finite Boolean algebra · Stochastic satisfiability · Linear temporal logic satisfiability and model checking

...
Wikipedia