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 (Author), Chung, Lily (Author), Demaine, Erik D (Author), Hendrickson, Dylan H. (Author), Hesterberg, Adam Classen (Author), Zeff, Avi (Author)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Schloss Dagstuhl, Leibniz Center for Informatics, 2021-02-19T20:04:52Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items