Quoridor is PSPACE-Complete
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910271304368128 |
|---|---|
| author | Drop, Marius Rin, Benjamin G. van der Velde, Finn |
| author_facet | Drop, Marius Rin, Benjamin G. van der Velde, Finn |
| contents | Quoridor is an award-winning abstract strategy game designed by Mirko Marchesi and published in 1997. Similar games include Maze Attack, Blockade (also known as Cul-de-sac), and Pinko Pallino. In line with chess, checkers, Go, and other classic combinatorial games, Quoridor is a turn-based, deterministic, perfect-information game played on a square grid. We show that it is PSPACE-complete to determine whether a given player has a winning strategy in a given Quoridor position on a board with size $n \times n$. We prove this by reduction from Gpos(POS CNF), a Boolean formula game originally defined in 1978 by T. Schaefer. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_22747 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Quoridor is PSPACE-Complete Drop, Marius Rin, Benjamin G. van der Velde, Finn Computational Complexity 91A46, 68Q17 F.1.3; F.2.2 Quoridor is an award-winning abstract strategy game designed by Mirko Marchesi and published in 1997. Similar games include Maze Attack, Blockade (also known as Cul-de-sac), and Pinko Pallino. In line with chess, checkers, Go, and other classic combinatorial games, Quoridor is a turn-based, deterministic, perfect-information game played on a square grid. We show that it is PSPACE-complete to determine whether a given player has a winning strategy in a given Quoridor position on a board with size $n \times n$. We prove this by reduction from Gpos(POS CNF), a Boolean formula game originally defined in 1978 by T. Schaefer. |
| title | Quoridor is PSPACE-Complete |
| topic | Computational Complexity 91A46, 68Q17 F.1.3; F.2.2 |
| url | https://arxiv.org/abs/2605.22747 |