Coding Challenge 10: Maze Generator (Part II)

From the creator

Choo choo! In this multi-part coding challenge, I create a maze generator using a depth-first search algorithm with recursive backtracking. The idea is to walk through a grid of cells, removing walls as we go to build a maze. Code: https://thecodingtrain.com/challenges/10-dfs-maze-generator 🕹️ p5.js Web Editor Sketch: https://editor.p5js.org/codingtrain/sketches/EBkm4txSA Other Parts of this Challenge: 📺 Part 1: Creating the Cells: https://youtu.be/HyK_Q5rrcr4 📺 Part 3: Removing Walls: https://youtu.be/8Ju_uxJ9v44 📺 Part 4: Backtracking: https://youtu.be/_p5IH0L63wo 🎥 Previous video: https://youtu.be/FGAwi7wpU8c?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH 🎥 Next video: https://youtu.be/IKB1hWWedMk?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH 🎥 All videos: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH References: 🌐 Maze Generation Algorithm: https://en.wikipedia.org/wiki/Maze_generation_algorithm#Randomized_depth-first_search Videos: 🔴 Livestream Archive: https://youtu.be/nF7DVmovWr0?t=6228s Related Coding Challenges: 🚂 #51 A* Pathfinding Algorithm: https://youtu.be/aKYlikFAV4k 🚂 #76 10Print: https://youtu.be/bEyTZ5ZZxZs 🚂 #171 Wave Function Collapse: https://youtu.be/rI_y2GAlQFM Timestamps: 00:00 Recap from Part 1 00:44 Let's Look at the Algorithm 01:30 Mark the Current Cell as Visited 03:33 Find the Non-Visited Neighboring Cells 09:26 Dealing with Edge Cases 11:28 Select a Random Neighboring Cell 12:12 Visit the Selected Neighbor 13:44 End of Part 2,

Published 2016-05-03 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.