Pith. sign in

REVIEW

PSPACE-completeness of Pulling Blocks to Reach a Goal

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.04337 v2 pith:PYTTE2IP submitted 2020-06-08 cs.CC

Hayashi Ani , Sualeh Asif , Erik D. Demaine , Jenny Diomidova , Dylan Hendrickson , Jayson Lynch , Sarah Scheffler , Adam Suhl This is my paper · ORCID
classification cs.CC
keywords blockspullingwhetherfixedgoalgravityoptionalproblem
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

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

Discussion (0). Continue with ORCID to comment.

Pith tools