[skulk]

I've always had a dream of creating an infinite braid maze algorithm:

The requirements I've come up with are:

1. Distribution of path length for any two points of a fixed taxicab distance should be some kind of long-tail distribution.

2. In general, the path between any two nearby points should often stray far outside the smallest box that contains both of those two points. Of course, this won't apply to nearby points in the same corridor. I'm not sure how best to state this formally.

3. It should be possible to calculate the exits for any cell in O(log(N)) time where N = abs(sum of the coordinates).

And the most hazy requirement of all: the maze should look decent.

AFAICT, no such algorithm exists.