A first-person furniture puzzle in 69 rooms. Heavy pieces slide only along their long axis, so you push or pull them endwise; a dolly rolls in four directions; a couch pins one end and pivots through a corner; a mattress tips on its side to fit a doorway. Level 1 takes two moves and level 60, the longest, takes 22.
One grid
Each level is a small grid, at most 8 cells by 7, written as rows of characters with a key that names the piece each letter stands for. Everything else reads that grid. The solver searches it, the mesh builder extrudes furniture from the footprints in it, and those meshes cut the light shafts from the windows as you drag them.
A proof for every room
Rooms this small allow an exhaustive search. The solver runs breadth-first search over room states: one placement per piece plus the region the player can walk to, with occupancy stored as a 64-bit board. The median room has 133 distinct states; the largest has 75,856, and the solver refuses any room past 250,000. The repo keeps each result as a certificate: the optimal move count and one optimal line.
The solver also re-solves each room four times, each time with one mechanic removed: no pull, no pivot, no tip, and every piece heavy. Comparing those runs with the baseline shows what a room actually requires, not what its designer meant it to teach.
CI checks every stored certificate against its level file and replays the line in Godot, so a level edit that breaks a solution fails the build. → Level Design · Assets from Code · Lighting
Level Atlas
Every campaign room with its optimal solution animated, behind a spoiler gate. The animations play the same certificates CI replays. A 12-room demo is playable on the web.