I implemented maze-generating cellular automata using:
Neighbourhoods:
Moore
von Neumann extended
Strategies
Mazecetric
Maze
Vote45
Vote
They have various parameters, including max number of generations, max number of generations to store to detect configuration looping, probability for initialization for cells, neighbourhood functions, and behaviour functions.
Here is a ThickMaze using Moore neighbourhoods; the Maze behaviour function; 10,000 max generations; five stored generations; and 0.5 probability during initialization. As expected from cellular automata, it is neither connected nor perfect.
I implemented maze-generating cellular automata using:
Neighbourhoods:
Moore
von Neumann extended
Strategies
Mazecetric
Maze
Vote45
Vote
They have various parameters, including max number of generations, max number of generations to store to detect configuration looping, probability for initialization for cells, neighbourhood functions, and behaviour functions.
Here is a ThickMaze using Moore neighbourhoods; the Maze behaviour function; 10,000 max generations; five stored generations; and 0.5 probability during initialization. As expected from cellular automata, it is neither connected nor perfect.