Complexity of retrograde and helpmate chess problems: Even cooperative chess is hard
We prove PSPACE-completeness of two classic types of Chess problems when generalized to n × n boards. A “retrograde” problem asks whether it is possible for a position to be reached from a natural starting position, i.e., whether the position is “valid” or “legal” or “reachable”. Most real-world ret...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2022
|
| Online Access: | https://hdl.handle.net/1721.1/143960 |