A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete
2020
Fun with Algorithms
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 reach the left edge of the board, by reduction from Nondeterministic Constraint Logic via 2-color oriented Subway Shuffle. By contrast, polynomial-time algorithms are known for deciding whether a given
doi:10.4230/lipics.fun.2021.7
dblp:conf/fun/BrunnerCDHHSZ21
fatcat:xanal3nqszhyleccjmaurumd6i