1 × 1 rush hour with fixed blocks is PSPACE-complete

1 × 1 rush hour with fixed blocks is PSPACE-complete

Consider n² - 1 unit-square blocks in an n × n square board, where each block is labeled as movable horizontally (only), movable vertically (only), or immovable - a variation of Rush Hour with only 1 × 1 cars and fixed blocks. We prove that it is PSPACE-complete to decide whether a given block can r...

Full description

Bibliographic Details
Main Authors: Brunner, Josh, Chung, Lily, Demaine, Erik D, Hendrickson, Dylan H., Hesterberg, Adam Classen, Zeff, Avi
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:English
Published: Schloss Dagstuhl, Leibniz Center for Informatics 2021
Online Access:https://hdl.handle.net/1721.1/129837

Internet

https://hdl.handle.net/1721.1/129837

Similar Items