PSPACE-completeness of Pulling Blocks to Reach a Goal
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PYTTE2IPrecord.jsonopen to challenge →
classification
cs.CC
keywords
blockspullingwhetherfixedgoalgravityoptionalproblem
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.