Pushing blocks via checkable gadgets: PSPACE-completeness of push-1f and block/box dude

DOI10.4230/LIPICS.FUN.2022.3MaRDI QIDQ6540571FDOQ6540571

Authors: Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan Hendrickson, Jayson Lynch 

Publication date: 16 May 2024

zbMATH Keywords

motion planninggadgetshardness of games

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (1)

• Defying gravity and gadget numerosity: the complexity of the Hanano puzzle and beyond

This page was built for publication: Pushing blocks via checkable gadgets: PSPACE-completeness of push-1f and block/box dude

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540571)