Twisty Little Passages
summary
Shows actual code experiments: a binary tree maze on a 10x10 grid then scaled to 40x80, switching neighbor choices to produce deterministic textures; a growing tree (depth‑first/recursive backtracker) variant and a random/last choice mix, visualized with Dijkstra coloring on 80x80 giving radial vs. winding patterns. Moves beyond squares to hex, polar and sphere projections, builds real geometry, renders with OpenGL, animates a swoop and first‑person walk along the longest path.
AI-written summary · about
chapters (14)
- 0:00Rediscovering joy in programming
- 1:13Overcoming burnout creatively
- 4:01Mazes make programming fun
- 5:07Binary tree maze demo
- 9:39Growing tree maze demo
- 11:29Visualizing with Dijkstra's
- 12:55Animating maze steps
- 15:01Non-rectangular maze grids
- 17:07Maze on a sphere
- 18:30OpenGL 3D maze rendering
- 21:42Walking spherical maze live
- 23:48From algorithms to animations
- 24:31Rediscovering initial excitement
- 25:33Find joy in coding
