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...

Full description

Saved in:
Bibliographic Details
Published inJournal of Information Processing Vol. 28; pp. 929 - 941
Main Authors Ani, Joshua, Asif, Sualeh, Demaine, Erik D., Diomidov, Yevhenii, Hendrickson, Dylan, Lynch, Jayson, Scheffler, Sarah, Suhl, Adam
Format Journal Article
LanguageEnglish
Published Information Processing Society of Japan 2020
Subjects
hardness
motion planning
puzzles
Online AccessGet full text

Cover

More Information
Summary: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, P ull ?-1FG (optional pulling, strength 1, fixed blocks, with gravity).
ISSN:1882-6652
1882-6652
DOI:10.2197/ipsjjip.28.929