Search Results - MIT Hardness Group

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants by MIT Hardness Group, Hendrickson, Della, Tockman, Andy

Get full text

Tetris with Few Piece Types by MIT Hardness Group, Demaine, Erik D., Hall, Holden, Li, Jeffery

Get full text

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

Get full text

Tetris is Hard with Just One Piece Type by MIT Hardness Group, Brunner, Josh, Demaine, Erik D., Hendrickson, Della, Li, Jeffery

Get full text

You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games by MIT Hardness Group, Ani, Hayashi, Demaine, Erik D., Hall, Holden, Ruiz, Ricardo, Venkat, Naveen

Get full text

Complexity of 2D Snake Cube Puzzles by MIT Hardness Group, Anchaleenukoon, Nithid, Dang, Alex, Demaine, Erik D., Ji, Kaylee, Saengrungkongka, Pitchayut

Get full text

Planar Graph Orientation Frameworks, Applied to KPlumber and Polyomino Tiling by MIT Hardness Group, Abel, Zachary, Demaine, Erik D., Diomidova, Jenny, Li, Jeffery, Zhou, Zixiang

Get full text

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles by MIT Hardness Group, Brunner, Josh, Chung, Lily, Demaine, Erik D., Diomidova, Jenny, Hendrickson, Della, Tockman, Andy

Get full text

Pushing Blocks without Fixed Walls via Checkable Gizmos: Push-1 is PSPACE-Complete by MIT Hardness Group, Brunner, Josh, Chung, Lily, Demaine, Erik D., Diomidova, Jenny, Hendrickson, Della, Lynch, Jayson

Get full text