research
∙
02/02/2023
Complexity of Solo Chess with Unlimited Moves
We analyze Solo Chess puzzles, where the input is an n × n board contain...
share
research
∙
02/02/2023
This Game Is Not Going To Analyze Itself
We analyze the puzzle video game This Game Is Not Going To Load Itself, ...
research
∙
11/26/2022
Lower Bounds on Retroactive Data Structures
We prove essentially optimal fine-grained lower bounds on the gap betwee...
research
∙
11/21/2022
Celeste is PSPACE-hard
We investigate the complexity of the platform video game Celeste. We pro...
research
∙
04/07/2022
Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without Flat Angles
A foundational result in origami mathematics is Kawasaki and Justin's si...
research
∙
03/22/2020
1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete
Consider n^2-1 unit-square blocks in an n × n square board, where each b...
research
∙
02/10/2020
