12 Apr
2019
12 Apr
'19
9:17 a.m.
On Fri, Apr 12, 2019 at 9:14 AM Mike Stay <metaweta@gmail.com> wrote:
The kinds of maze you often see as busywork have a single entrance and a single exit on the exterior wall, and have a single path between any two points in the maze. There's an algorithm for generating such mazes of arbitrary height when only the width is known in advance.
Hmm, that didn't quite capture how cool Eller's algorithm is. You only need to store one row of the maze in memory at any time, forgetting everything that went before. As soon as the "stop" signal is received, you print out the final row and the exit. -- Mike Stay - metaweta@gmail.com http://math.ucr.edu/~mike https://reperiendi.wordpress.com