Maze generation: Difference between revisions
m
→{{header|J}}
(The start cell is not the exit. In fact, the concept of "exit" is not addressed by this algorithm) |
m (→{{header|J}}) |
||
Line 13:
=={{header|J}}==
This algorithm allows almost no parallelism. So, while it might be "simple", generating very large mazes this way will not be necessarily efficient to implement on future (highly parallel) systems. That said, perhaps mazes with
Anyways, based on the picolisp implementation, except without any relevant grid support:
| |||