Revision as of 19:08, 14 December 2010 (view source) Rdm (talk \| contribs) (J: smaller example maze) ← Older edit		Revision as of 19:13, 14 December 2010 (view source) Rdm (talk \| contribs) m (J: clarification) Newer edit →
Line 5: =={{header\|J}}== This algorithm allows almost no parallelism. So, while it might be "simple", itgenerating large mazes this way will not be necessarily efficient to implement on future (highly parallel) systems. Anyways, based on the picolisp implementation, except without any relevant grid support:

Maze generation (view source)