[GAME] Hyperfast Maze Generator — Make HUGE Mazes In Seconds And Solve!
I don't usually do things like this, but I saw a maze generator post on here and that reminded me about my foray into maze generation algorithms. So, I revived an old project which, thanks to set theory, is able to generate massive mazes in mere seconds.
The algorithm used is called Eller's algorithm, and while it's probably the hardest to understand out of all the maze generation algorithms it is certainly the fastest because it can generate entire mazes while only looking at a single row at a time. But, the mazes it generates are essentially unbiased and are great fun!
Just hit run and a new maze will be generated in real-time, based on your input size. Then, use WASD or the arrow keys to move the player (red square) to the end (green square), or hit P to save an image to print!
If you want to test my claim that this is fast, try inputting a huge maze size like 500!
EDIT: But don't go too huge, or else the maze paths will be smaller than a pixel and it won't be able to render!
I just watch youtube at 1.5x speed to get the most content without having to watch ads lol. Most of the time tho, i can skip after 5 sec. But one time, i was watching youtube for school, but i got a 50 minute ad! lmao rotf! Luckily, i was able to skip it
it doesn’t work... it goes too fast so I can’t get through cracks and I can cut right through some things
@JSDRAGONCODER @JadenTan1 By doing "1", you're saying "each hallway will take up [the screen size divided by 1]" — in other words, the whole screen. The player is a red square, thus at a size of 1 the player will fill the entire screen as well and make the screen red.
Basically, lower numbers = smaller maze = displayed larger (to fill the screen)
I think you should add a "Generating Maze" text somewhere to show that the maze is being made