One surprising example not listed there is "sliding-block puzzles", as proven in this paper:
https://groups.csail.mit.edu/mac/users/bob/sliding-blocks.pd...
https://groups.csail.mit.edu/mac/users/bob/sliding-blocks.pd...
> Technically, a problem is called PSPACE-complete if it is equal in computational power to a particular mathematical model of computation (called “polynomial-space-bounded Turing machines”).