This kind of maze should give average results for typical pathfinding algorithms. The nature of recursive division creates mazes with rather small branches, while ensures that there's almost no chance of trivial path. In other words all algorithms should have quite similar run time, while A* should give the best results, since it would avoid most smaller branches, while still exploring most of the maze, since that algorithm usually generates longer paths.
@@duetopersonalreasonsaaaaaa every night, I can feel my leg… and my arm… even my fingers. The comrades I’ve lost… won’t stop hitting… it’s like they’re all still there. You feel it too, don’t you?
I like how these have distinctly different looks from each other
Yeah. This one feels like a bunch of smaller mazes linked together.
Me running toward the exit before the maze finishes generating:
I want to see a solving algorithm made specifically for this kind of generated maze
Google maps
This kind of maze should give average results for typical pathfinding algorithms. The nature of recursive division creates mazes with rather small branches, while ensures that there's almost no chance of trivial path. In other words all algorithms should have quite similar run time, while A* should give the best results, since it would avoid most smaller branches, while still exploring most of the maze, since that algorithm usually generates longer paths.
So cool
Why am I here
Just to suffer?
To get out of the maze.
@@duetopersonalreasonsaaaaaa every night, I can feel my leg… and my arm… even my fingers. The comrades I’ve lost… won’t stop hitting… it’s like they’re all still there. You feel it too, don’t you?