8 Maze Generating Algorithms in 3 Minutes 

---Time Stamps for all Algorithms-- Depth first search 0:16 Randomized Prim's Algorithm 0:33 Eller's Algorithm 0:49 Hunt-and-kill Algorithm 1:06 Binary Tree Algorithm 1:23 Randomized Kruskal's Algorithm 1:39 Sidewinder Algorithm 1:56 Aldous-Broder Algorithm 2:12

Possibly the best enumeration video. No small talks, and goes immediately to the point!

Thank you for this video. It is incredibly useful, and seeing the visualization alongside the description is helpful. If there was a "useful information density" award, you deserve it.

But can it generate the path to the maze of your heart?

My algorithm ("Maze Creator") is closest to the Depth First Search. It stores a number in each cell visited, giving it a 1, 2, 3, or 4 depending on what direction it moves to from there (North, East, South, and West). If a dead end is reached, any square it backtracks from is marked with a "5". These are all "guide numbers". Each cell contains one 8-bit number, and the guide number is stored in the fourth, fifth, and sixth bit of the cell's contents. The seventh and eighth bits contain "path data", where the seventh bit tells if the south path is open, while the eighth bit tells if the east path is open (To see if the west path is open, you have to check the data from the cell to west, while the cell to the north will tell you if the north path is open).

This was so satisfying to watch man, keep up the good work!

This is strangely relaxing!! Excellent job

This is the best formatted video i've seen

I've been playing around with applying randomness to depth-first. During generation steps I simply give chances to do the following instead of normal depth-first'ing; jump to random unvisited cell anywhere near the path and branch from there (many more branches this way, interestingly long ones), randomly backtrack a few spaces and branch from there (again more branches but smaller ones), or randomly allow the depth-first phase then go back to the previous cell (even more branches, but this makes single and double node dead-ends more often which is fantastic for my game). Each of these three values can be adjusted and produce much better results than normal depth first. EDIT: TLDR* normal depth-first normally ends up generating a long path with very few branches to get lost in. Mine eliminates the latter.

Nice visual explanation of the algorithms

This video was so good I immediately subscribed! But where's Wilson's algorithm? It generates an unbiased sample from the uniform distribution over all mazes, using loop-erased random walks, not favouring either long corridors (like DFS) nor many short dead ends (like Kruskal's and Prim's algorithms). It should be included here.

This is super interesting i gotta stay tuned.

This video is what I want to see. very good!!!💯💯💯

This is something new! be waiting for more!

Any algorithm with excessive amounts of hallways a single cell long should not count as a maze. When you can clearly see it's a dead end, it's no longer a puzzle to solve. It's just a bunch of space filler. You might as well just seal those passages off and have a single path through the whole thing. You know you're a nerd when you start gatekeeping what counts as a valid maze algorithm.

This was very helpful

so cool, thanks!

Is there a specific algorithm that forms a maze from a selected finnish & end ? (Within a boundry)???

very satisfying!!!!

Love this

Awesome 🔥🔥

This is so memorizing! 👀

1:46 isnt it wave function collapse?

nice video!

Cool vid 😁

how do i git at that repo...

nice video :)

So interesting! 🧠

Wanted a tutorial.

nice

where is the github link?

nice