Motion planning with pull moves
Computational Complexity
2010-08-18 v1
Authors:
Marcus Ritt
Abstract
It is well known that Sokoban is PSPACE-complete (Culberson 1998) and several of its variants are NP-hard (Demaine et al. 2003). In this paper we prove the NP-hardness of some variants of Sokoban where the warehouse keeper can only pull boxes.
Cite
@article{arxiv.1008.2952,
title = {Motion planning with pull moves},
author = {Marcus Ritt},
journal= {arXiv preprint arXiv:1008.2952},
year = {2010}
}
Comments
9 pages, 7 figures
Related papers
View all related →
Computational Complexity · Computer Science
A handle is enough for a hard game of Pull
Oscar Temprano
2018-01-01
Computational Complexity · Computer Science
Push-Pull Block Puzzles are Hard
Erik D. Demaine, Isaac Grosof, Jayson Lynch
2017-09-06
Computational Complexity · Computer Science
PSPACE-completeness of Pulling Blocks to Reach a Goal
Hayashi Ani, Sualeh Asif, Erik D. Demaine, Jenny Diomidova +4
2023-11-16
Computational Complexity · Computer Science
PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation
Robert A. Hearn, Erik D. Demaine
2007-05-23
Robotics · Computer Science
On the hardness of unlabeled multi-robot motion planning
Kiril Solovey, Dan Halperin
2015-04-21
Computational Complexity · Computer Science
Losing at Checkers is Hard
Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine +1
2018-06-15
Computational Complexity · Computer Science
PSPACE-Completeness of Reversible Deterministic Systems
Erik D. Demaine, Robert A. Hearn, Dylan Hendrickson, Jayson Lynch
2022-07-18
Artificial Intelligence · Computer Science
Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning
Dieqiao Feng, Carla P. Gomes, Bart Selman
2020-06-05
Computational Geometry · Computer Science
Multi-robot motion planning of k-colored discs is PSPACE-hard
Thomas Brocken, G. Wessel van der Heijden, Irina Kostitsyna, Lloyd E. Lo-Wong +1
2020-04-28
Computational Complexity · Computer Science
Computational Complexity of Motion Planning of a Robot through Simple Gadgets
Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
2018-06-13
Computational Complexity · Computer Science
Push-1 is PSPACE-complete, and the automated verification of motion planning gadgets
Zachary DeStefano, Bufang Liang
2025-09-03
Machine Learning · Computer Science
Path Channels and Plan Extension Kernels: a Mechanistic Description of Planning in a Sokoban RNN
Mohammad Taufeeque, Aaron David Tucker, Adam Gleave, Adrià Garriga-Alonso
2026-05-28
Optimization and Control · Mathematics
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
Alexander Kononov, Julia Memar, Yakov Zinder
2021-06-29
Computational Geometry · Computer Science
Packing identical simple polygons is NP-hard
Sarah R. Allen, John Iacono
2012-09-25
Machine Learning · Computer Science
Planning in a recurrent neural network that plays Sokoban
Mohammad Taufeeque, Philip Quirke, Maximilian Li, Chris Cundy +3
2025-06-02
Computational Complexity · Computer Science
Walking through Doors is Hard, even without Staircases: Universality and PSPACE-hardness of Planar Door Gadgets
MIT Gadgets Group, Jeffrey Bosboom, Erik D. Demaine, Jenny Diomidova +3
2026-03-17
Computational Complexity · Computer Science
On the Computational Complexity of Stochastic Controller Optimization in POMDPs
Nikos Vlassis, Michael L. Littman, David Barber
2012-10-05
Computational Complexity · Computer Science
2048 is (PSPACE) Hard, but Sometimes Easy
Rahul Mehta
2014-08-28
Computational Geometry · Computer Science
Partial Searchlight Scheduling is Strongly PSPACE-Complete
Giovanni Viglietta
2015-03-20
Computational Complexity · Computer Science
On the Complexity of Elementary Modal Logics
Edith Hemaspaandra, Henning Schnoor
2008-02-14
Machine Learning · Computer Science
Solving Sokoban with forward-backward reinforcement learning
Yaron Shoham, Gal Elidan
2021-05-25
Discrete Mathematics · Computer Science
On Strong NP-Completeness of Rational Problems
Dominik Wojtczak
2018-02-27
Robotics · Computer Science
PC-Planner: Physics-Constrained Self-Supervised Learning for Robust Neural Motion Planning with Shape-Aware Distance Function
Xujie Shen, Haocheng Peng, Zesong Yang, Juzhan Xu +3
2024-10-18
Robotics · Computer Science
Push, Stop, and Replan: An Application of Pebble Motion on Graphs to Planning in Automated Warehouses
Miroslav Kulich, Tomáš Novák, Libor Přeucil
2020-07-21
Computational Complexity · Computer Science
The computational complexity of Minesweeper
Michiel de Bondt
2012-04-23