Geek Answers Handbook

A labyrinth algorithm that generates the most complex mazes?

I played with a recursive backtracking algorithm, but it always produces very light mazes. Which algorithm produces the most complex labyrinths for solving (please provide information about braids and offset directions if necessary)?

+4
source share
5 answers

Quantifying the “difficulty” of the maze is not easy. So let me be quality.

First, the recursive Backtracker is an "ideal maze" algorithm; it generates mazes with one and only one solution. Most of the labyrinth work involves creating perfect labyrinths, so I will limit my answer to them.

There are many, many variations and snippets of maze algorithms. But in fact, there are only 12 basic maze algorithms. I list them here in the order in which I personally (qualitatively and anecdotally) find it the most difficult:

In the complex top three on my list there is not much difference. Sorry about that. There may be a flaw in your implementation. Most likely, you just know how to make mazes. Try to make them larger.

+4
source

While not a direct answer, this article on visualizing maze generation algorithms is a must.

+1
source

Here you can check the labyrinth generation algorithms:

Labyrinth classification

0
source

A deep search can produce very complex mazes. Here is an open source C ++ implementation: https://github.com/corporateshark/random-maze-generator

Try setting ImageSize to 4096 and NumCells to 2047. The result will be quite complicated.

0
source

Bay fill algorithms are what IEEE recommends.

There are many versions of this algorithm. I use the fill fill algorithm.
but I did not find embodiment

-1
source

More articles:


All Articles