Document Type
Article
Publication Date
2024
Abstract
In this paper, we seek to provide a simpler proof that the relocation problem in Ricochet Robots (Lunar Lockout with fixed geometry) is PSPACE-complete via a reduction from Finite Function Generation (FFG). Although this result was originally proven in 2003, we give a simpler reduction by utilizing the FFG problem, and put the result in context with recent publications showing that relocation is also PSPACE-complete in related models.
Recommended Citation
Balanza-Martinez, Jose, Angel A. Cantu, Robert Schweller, and Tim Wylie. "A Simple Proof that Ricochet Robots is PSPACE-Complete." arXiv preprint arXiv:2402.11440 (2024).
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.