Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.11440 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929246632411136 |
|---|---|
| author | Balanza-Martinez, Jose Cantu, Angel A. Schweller, Robert Wylie, Tim |
| author_facet | Balanza-Martinez, Jose Cantu, Angel A. Schweller, Robert Wylie, Tim |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_11440 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Simple Proof that Ricochet Robots is PSPACE-Complete Balanza-Martinez, Jose Cantu, Angel A. Schweller, Robert Wylie, Tim Computational Complexity Data Structures and Algorithms 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. |
| title | A Simple Proof that Ricochet Robots is PSPACE-Complete |
| topic | Computational Complexity Data Structures and Algorithms |
| url | https://arxiv.org/abs/2402.11440 |