PSPACE-completeness of Pulling Blocks to Reach a Goal

PSPACE-completeness of Pulling Blocks to Reach a Goal

We prove PSPACE-completeness of all but one problem in a large space of pulling-block problems where the goal is for the agent to reach a target destination. The problems are parameterized by whether pulling is optional, the number of blocks which can be pulled simultaneously, whether there are fixe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2022-02
Hauptverfasser: Hayashi Ani, Sualeh Asif, Demaine, Erik D, Diomidova, Jenny, Hendrickson, Dylan, Lynch, Jayson, Scheffler, Sarah, Suhl, Adam
Format: Artikel
Sprache:eng
Schlagworte:
Completeness
Computer Science - Computational Complexity
Gravitation
Thin walls
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove PSPACE-completeness of all but one problem in a large space of pulling-block problems where the goal is for the agent to reach a target destination. The problems are parameterized by whether pulling is optional, the number of blocks which can be pulled simultaneously, whether there are fixed blocks or thin walls, and whether there is gravity. We show NP-hardness for the remaining problem, Pull?-1FG (optional pulling, strength 1, fixed blocks, with gravity).
ISSN:2331-8422
DOI:10.48550/arxiv.2006.04337