Live-Coding Maze Generation Algorithms
summary
Live coding and visual demonstrations of maze-generation algorithms, covering depth-first search (recursive backtracker) and randomized Kruskal and Prim variants. The session explains core principles, compares visual outcomes and trade-offs between common algorithms, and walks step-by-step through implementations so attendees can build solvable procedural mazes themselves.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 3:39Grid cell model in Ruby
- 9:23Binary tree algorithm
- 10:07Sidewinder algorithm
- 21:17Generated maze stats
- 24:59Dijkstra distance in maze
- 35:43Aldous-Broder algorithm
- 46:14Uniformity complexity
- 47:18Conclusion and resources
related talks
38mProcedural Generation at Runtime: From Basic to Complex by Example
41mBatman and the algorithms
06mUnderstanding Player Patterns by Combining Knowledge-Based Data Abstraction with Interactive ...
19mSupporting Easy Physical-to-Virtual Creation of Mobile VR Maze Games: a New Genre
56mBuild a 2D game with MUD and Phaser
32mAI and Minecraft
05mInterview with
59mGame AI 4N00bz