1 1 Rush Hour with fixed blocks is PSPACE-complete
From MaRDI portal
Recommendations
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- scientific article; zbMATH DE number 2086639
- PSPACE-completeness of Bloxorz and of games with 2-buttons
- \textsc{Pull} and \textsc{PushPull} are PSPACE-complete
Cited in
(18)- Pushing blocks is hard.
- Ice sliding games
- PSPACE-completeness of Bloxorz and of games with 2-buttons
- scientific article; zbMATH DE number 3883607 (Why is no real title available?)
- scientific article; zbMATH DE number 2086639 (Why is no real title available?)
- Parameterized complexity of graph constraint logic
- On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- Multi-robot motion planning for unit discs with revolving areas
- On the complexity of motion planning problem of a forklift
- On the computational complexity of pushing machine
- All paths lead to Rome
- Parameterized algorithms for coordinated motion planning: minimizing energy
- Reconfiguration of labeled matchings in triangular grid graphs
- Reconfiguration of labeled matchings in triangular grid graphs
- Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
- Optimal motion planning for two square robots in a rectilinear environment
- Parameterized algorithms for coordinated motion planning: minimizing energy
This page was built for publication: \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487573)
