\(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete
From MaRDI portal
Publication:6487573
DOI10.4230/lipics.fun.2021.7zbMath1515.6815MaRDI QIDQ6487573
Adam Suhl, Unnamed Author, Dylan Hendrickson, Avi Zeff, Unnamed Author, Unnamed Author, Erik D. Demaine
Publication date: 7 February 2023
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
This page was built for publication: \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete
