PSPACE-completeness of Pulling Blocks to Reach a Goal. - Joshua Ani; Sualeh Asif; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch; Sarah Scheffler; Adam Suhl (J. Inf. Process., 2020)

Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets. - Joshua Ani; Jeffrey Bosboom; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch (FUN, 2021)

Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. - Joshua Ani; Lily Chung; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch (FUN, 2022)

Orthogonal Fold & Cut. - Joshua Ani; Josh Brunner; Erik D. Demaine; Martin L. Demaine; Dylan H. Hendrickson; Victor Luo; Rachana Madhukara (CoRR, 2022)

Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. - Joshua Ani; Michael J. Coulombe; Erik D. Demaine; Yevhenii Diomidov; Timothy Gomez; Dylan H. Hendrickson; Jayson Lynch (SAND, 2023)

This Game Is Not Going To Analyze Itself. - Aviv Adler; Joshua Ani; Lily Chung; Michael J. Coulombe; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch (CoRR, 2023)

Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets. - Joshua Ani; Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch (Theor. Comput. Sci., 2023)

Traversability, Reconfiguration, and Reachability in the Gadget Framework. - Joshua Ani; Erik D. Demaine; Yevhenii Diomidov; Dylan H. Hendrickson; Jayson Lynch (Algorithmica, 2023)