One Dungeon, Two Dungeons, Three Dungeons... What If We Automated Generation?
summary
The talk explains procedural generation for video-game worlds, focusing on techniques to create coherent landscapes, environments and dungeons when naive randomness fails. It covers the history and principles of procedural generation and demonstrates their application by showing how to algorithmically generate a dungeon, with an interactive element for the audience.
AI-written summary · about
chapters (16)
- 0:00Procedural generation intro
- 2:17Why procedural generation
- 8:02Midpoint displacement
- 9:26Perlin noise explained
- 15:52Reproducible generation
- 18:03World population rules
- 22:19Caves with cellular automata
- 26:16Dungeon generation overview
- 27:20Drunkard’s walk algorithm
- 28:26Minimum spanning tree
- 30:16Wilson and Aldous-Broder
- 31:48Binary space partitioning
- 33:42A* pathfinding
- 35:30Wave function collapse
- 38:42WFC in dungeons
- 40:29Q&A
