Wilson’s Algorithm: maze generation via random walk
Wilson’s algorithm uses loop-erased random walks to generate a uniform spanning tree — an unbiased sample of all possible spanning trees. Most other maze generation algorithms, such as Prim’s, random traversal and randomized depth-first traversal, do not have this beautiful property.
If you look at the colourised version, the patterns kind of remind me of a dragon curve.