Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.04337

PSPACE-completeness of Pulling Blocks to Reach a Goal

Hayashi Ani·Sualeh Asif·Erik D. Demaine·Jenny Diomidova·Dylan Hendrickson·Jayson Lynch·Sarah Scheffler·Adam Suhl
View original source ↗Read source document ↗Export metadata ↓

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

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Hayashi Ani, Sualeh Asif, Erik D. Demaine, Jenny Diomidova, Dylan Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl. 2020-06-08. PSPACE-completeness of Pulling Blocks to Reach a Goal. https://doi.org/10.2197/ipsjjip.28.929

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗