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.

翻译：本文旨在通过从有限函数生成问题（FFG）的归约，为弹射机器人（固定几何结构的月球救援）中的重定位问题提供更简单的PSPACE完全性证明。尽管该结果最初于2003年得到证明，但我们通过利用FFG问题给出了更简单的归约，并将该结果与近期表明相关模型中重定位问题同为PSPACE完全的出版物进行了关联。