Overdone maze generation algorithm @EllipticGeometry
Overdone maze generation algorithm  @EllipticGeometry
Uploaded August 2015 | Updated November 2026, 2 hours ago
I decided to push the limits of minimum spanning tree algorithms some more. Like the hybrid algorithm in my previous video, it's still a mix of Prim's and Kruskal's algorithms. This time I implemented the separate mergeable priority queues I alluded to in the description, so all trees get to grow more evenly. I also made it a hybrid passage carver and wall adder. The visualization now has foresight: it recognizes when an edge can only become a passage or a wall.

The previous video showing plain Prim and Kruskal as well as a less crazy hybrid: youtube.com/watch?v=MXqvIaZJBXo
Overdone maze generation algorithmTraffic lights: how do they do it?Cloning SethBlings Swing Set in MinecraftGish Contest: Factory 4 - Follow that TrainGish Contest: Factory 1 - Break InGish Contest: Factory 8 #3 - Race to the FinishI dont identify as a rattleMSC Rally Race% Satsuma 4:29.91Misanthropy simulatorDutch driver punishes cyclist for bad road designMinecraft: 20 Hz redstone timing precisionMinecraft: predicting droppers
EllipticGeometry |

Overdone maze generation algorithm

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER