\(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete

From MaRDI portal

Revision as of 14:37, 28 November 2024 by Import241128011130 (talk | contribs) (Created automatically from import241128011130)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6487573

Jump to:navigation, search

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

zbMATH Keywords

puzzles PSPACE-hardness sliding blocks

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Related Items (1)

Multi-robot motion planning for unit discs with revolving areas

This page was built for publication: \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6487573&oldid=37945749"