@@VIue_ I mean, there is likely ways to still improve apon it, like stopping it from deciding HEY LETS GO OVER THIS ALREADY 100% FILLED SPOT 250 TIMES!
So I've never seen this algorithm before. If I were to guess I'd say that it uses a dead end pathfinding algorithm until it comes across a cell whose neighbors haven't been created then chooses randomly between the "unpathed" neighbors which way to travel. Am I even close?
Very close. It doesn't choose an unpathed neighbor. It just chooses a neighbor. However a path is created only when it's an unvisited neighbor. This algorithm is used to create a uniform spanning tree of pathways. If it has any bias to gravitate towards unvisited cells, then it is no longer unbiased. That's why it chooses a cell at complete random regardless of whether it's been visited/pathed or not.
Nope it simply starts at a random position, choose a random direction and if the cell was already explored does nothing, otherwise it creates a path between the two cells. Loops this until all cells are visited
![Звуковые иллюзии, которые работают на всех (почти) [Veritasium]](/img/1.gif)
It looks like it's trying to find a way out of its own maze😭
Poor lad
the single brain cell in my brain trying to figure out the awnser to 2+2
this is the the maze generation equivalent of the bozo sort lmao
its one of the only algorithms that produces a truly random maze, with an equal distribution between all possible mazes
@@VIue_ I mean, there is likely ways to still improve apon it, like stopping it from deciding HEY LETS GO OVER THIS ALREADY 100% FILLED SPOT 250 TIMES!
Looks amazing! Continue this cool maze algorithms playlist and maybe even create a infinite one!
Aldous-Broder? More like “Amazing maze creator!” 👍
I managed to solve this maze as it was being generated.
So I've never seen this algorithm before. If I were to guess I'd say that it uses a dead end pathfinding algorithm until it comes across a cell whose neighbors haven't been created then chooses randomly between the "unpathed" neighbors which way to travel. Am I even close?
It cannot be using a stack because it keeps going back to where it's been over and over
Very close. It doesn't choose an unpathed neighbor. It just chooses a neighbor. However a path is created only when it's an unvisited neighbor. This algorithm is used to create a uniform spanning tree of pathways. If it has any bias to gravitate towards unvisited cells, then it is no longer unbiased. That's why it chooses a cell at complete random regardless of whether it's been visited/pathed or not.
@@FistDaMonkey Oh, I see it now, that's also why the "path creator" can skip over walls, interesting, terribly inefficient though
Nope it simply starts at a random position, choose a random direction and if the cell was already explored does nothing, otherwise it creates a path between the two cells.
Loops this until all cells are visited
Easteregg: wirh 2x speed, there are two red dots ! ;D
4:26
i thought this was a maze solving algorithm nad was like, man he sure sucks are solving a maze-
4:26 accidentally made a swastika.
I can see two swastikas in the maze, a white and a black one.