PSPACE-Hard 2D Super Mario Games: Thirteen Doors. - MIT Hardness Group; Hayashi Ani; Erik D. Demaine; Holden Hall; Matias Korman (FUN, 2024)

You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games. - MIT Hardness Group; Hayashi Ani; Erik D. Demaine; Holden Hall; Ricardo Ruiz; Naveen Venkat (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)

Tetris with Few Piece Types. - MIT Hardness Group; Erik D. Demaine; Holden Hall; Jeffery Li (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)

Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs. - MIT Hardness Group; Josh Brunner; Erik D. Demaine; Jenny Diomidova; Timothy Gomez; Markus Hecher; Frederick Stock; Zixiang Zhou (ISAAC, 2024)

Complexity of 2D Snake Cube Puzzles. - MIT Hardness Group; Nithid Anchaleenukoon; Alex Dang; Erik D. Demaine; Kaylee Ji; Pitchayut Saengrungkongka (CoRR, 2024)