A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard. - Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch (CoRR, 2018)

Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard. - Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch (ITCS, 2020)

Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard. - Josh Brunner; Erik D. Demaine; Dylan H. Hendrickson; Julian Wellman (ISAAC, 2020)

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)

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. - Jeffrey Bosboom; Charlotte Chen; Lily Chung; Spencer Compton; Michael J. Coulombe; Erik D. Demaine; Martin L. Demaine; Ivan Tadeu Ferreira Antunes Filho; Dylan H. Hendrickson; Adam Hesterberg; Calvin Hsu; William Hu; et al. (J. Inf. Process., 2020)

Characterizing Universal Reconfigurability of Modular Pivoting Robots. - Hugo A. Akitaya; Erik D. Demaine; Andrei Gonczi; Dylan H. Hendrickson; Adam Hesterberg; Matias Korman; Oliver Korten; Jayson Lynch; Irene Parada; Vera Sacristán (SoCG, 2021)

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)

1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete. - Josh Brunner; Lily Chung; Erik D. Demaine; Dylan H. Hendrickson; Adam Hesterberg; Adam Suhl; Avi Zeff (FUN, 2021)

Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles. - Lily Chung; Erik D. Demaine; Dylan H. Hendrickson; Victor Luo (SoCG, 2022)

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)

Lower Bounds on Retroactive Data Structures. - Lily Chung; Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch (ISAAC, 2022)

This Game Is Not Going To Analyze Itself. - Aviv Adler; Hayashi Layers; Lily Chung; Michael J. Coulombe; Erik D. Demaine; Jenny Diomidova; Della H. Hendrickson; Jayson Lynch (JCDCGGG, 2022)

PSPACE-Completeness of Reversible Deterministic Systems. - Erik D. Demaine; Robert A. Hearn; Dylan H. Hendrickson; Jayson Lynch (MCU, 2022)

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

Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets. - Joshua Ani; Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch (WALCOM, 2022)

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

The Legend of Zelda: The Complexity of Mechanics. - Jeffrey Bosboom; Josh Brunner; Michael J. Coulombe; Erik D. Demaine; Dylan H. Hendrickson; Jayson Lynch; Elle Najt (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)

Complexity of Simple Folding of Mixed Orthogonal Crease Patterns. - Hugo A. Akitaya; Josh Brunner; Erik D. Demaine; Dylan H. Hendrickson; Victor Luo; Andy Tockman (CoRR, 2023)

Baba Is Universal. - Zachary Abel; Della H. Hendrickson (FUN, 2024)

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles. - MIT Hardness Group; Josh Brunner; Lily Chung; Erik D. Demaine; Della H. Hendrickson; Andy Tockman (FUN, 2024)

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants. - MIT Hardness Group; Della H. Hendrickson; Andy Tockman (FUN, 2024)

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints. - MIT-NASA Space Robots Team; Josh Brunner; Kenneth C. Cheung; Erik D. Demaine; Jenny Diomidova; Christine Gregg; Della H. Hendrickson; Irina Kostitsyna (SWAT, 2024)

Agent Motion Planning as Block Asynchronous Cellular Automata: Pushing, Pulling, Suplexing, and More. - Hayashi Ani; Josh Brunner; Erik D. Demaine; Jenny Diomidova; Timothy Gomez; Della H. Hendrickson; Yael Kirkpatrick; Jeffery Li; Jayson Lynch; Ritam Nag; Frederick Stock (UCNC, 2024)

Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude. - Hayashi Ani; Lily Chung; Erik D. Demaine; Jenny Diomidova; Della H. Hendrickson; Jayson Lynch (CoRR, 2024)

Pushing Blocks without Fixed Blocks via Checkable Gizmos: Push-1 is PSPACE-Complete. - Josh Brunner; Lily Chung; Erik D. Demaine; Jenny Diomidova; Della H. Hendrickson; Jayson Lynch (CoRR, 2025)

Undecidability of Tiling with a Tromino. - Zachary Abel; Hugo A. Akitaya; Lily Chung; Erik D. Demaine; Jenny Diomidova; Della H. Hendrickson; Stefan Langerman; Jayson Lynch (CoRR, 2025)