What’s a good algorithm to generate a maze? [closed]

by

It turns out there are 11 classic algorithms to generate “perfect” mazes. A maze is perfect if it has one, and only one, solution. Here are some links to each algorithm, in rough order of my preference.

  1. Kruskal’s
  2. Prim’s
  3. Recursive Backtracker
  4. Aldous-Broder
  5. Growing Tree
  6. Hunt-and-Kill
  7. Wilson’s
  8. Eller’s
  9. Recursive Division (Predictable)
  10. Sidewinder (Predictable)
  11. Binary Tree (Flawed)

For more info, check out mazelib on GitHub, a Python library implementing all the standard maze generating/solving algorithms.

More Related Contents:

  1. Programming theory: Solve a maze
  2. How do I create a URL shortener? [closed]
  3. Segmented Sieve of Eratosthenes?
  4. How do I calculate a point on a circle’s circumference?
  5. Algorithm to generate all possible permutations of a list?
  6. How can building a heap be O(n) time complexity?
  7. Is there an O(n) integer sorting algorithm?
  8. Which algorithm is faster O(N) or O(2N)?
  9. How to detect the BPM of a song in php [closed]
  10. Find the shortest path in a graph which visits certain nodes
  11. Why does this simple shuffle algorithm produce biased results?
  12. Algorithm to separate items of the same type
  13. design a stack such that getMinimum( ) should be O(1)
  14. how to calculate binary search complexity
  15. Bitwise and in place of modulus operator
  16. Optimal algorithm for returning top k values from an array of length N
  17. Calculate largest inscribed rectangle in a rotated rectangle
  18. Argument for O(1) average-case complexity of heap insertion
  19. insert, delete, max in O(1)
  20. How Can I Best Guess the Encoding when the BOM (Byte Order Mark) is Missing?
  21. Given two arrays a and b .Find all pairs of elements (a1,b1) such that a1 belongs to Array A and b1 belongs to Array B whose sum a1+b1 = k
  22. How does Dijkstra’s Algorithm and A-Star compare?
  23. How to cartoon-ify an image programmatically?
  24. Permute all unique enumerations of a vector in R
  25. Easiest algorithm of Voronoi diagram to implement? [closed]
  26. “Rounding” colour values to the nearest of a small set of colours
  27. When is each sorting algorithm used? [closed]
  28. Difference between Big-Theta and Big O notation in simple language
  29. 3-PARTITION problem
  30. Binary tree level order traversal

Leave a Comment