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

中文翻译：

---

PSPACE-拉块达到目标的完整性

我们证明了在目标是让代理到达目标目的地的大空间拉块问题中，除了一个问题之外的所有问题的 PSPACE 完整性。问题通过是否可选拉动、可以同时拉动的块数、是否有固定块或薄壁以及是否有重力来参数化。我们显示剩余问题的 NP 硬度，Pull?-1FG（可选拉力，强度 1，固定块，有重力）。