PSPACE-completeness of Pulling Blocks to Reach a Goal

Author(s)
Ani, Joshua; Asif, Sualeh; Demaine, Erik D; Diomidov, Yevhenii; Hendrickson, Dylan; ... Show more
Thumbnail
DownloadAccepted version (617.4Kb)
Open Access Policy
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
© 2020 Information Processing Society of Japan. 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).
Date issued
2020
URI
https://hdl.handle.net/1721.1/143957
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
Journal of Information Processing
Publisher
Information Processing Society of Japan
Citation
Ani, Joshua, Asif, Sualeh, Demaine, Erik D, Diomidov, Yevhenii, Hendrickson, Dylan et al. 2020. "PSPACE-completeness of Pulling Blocks to Reach a Goal." Journal of Information Processing, 28 (0).
Version: Author's final manuscript
Collections