PSPACE-completeness of Pulling Blocks to Reach a Goal
Computational Complexity
2023-11-16 v2
Abstract
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).
Cite
@article{arxiv.2006.04337,
title = {PSPACE-completeness of Pulling Blocks to Reach a Goal},
author = {Hayashi Ani and Sualeh Asif and Erik D. Demaine and Jenny Diomidova and Dylan Hendrickson and Jayson Lynch and Sarah Scheffler and Adam Suhl},
journal= {arXiv preprint arXiv:2006.04337},
year = {2023}
}
Comments
Full version of JCDCGGG2019 paper and now published in Journal of Information Processing 28 (2020), 22 pages, 25 figures; corrections made to Figures 10 and 15