Continuing my short study of one notation for generating cellular automata patterns….The following’sa copy-pasted from a great website all about CA rules and their applications at (http://psoup.math.wisc.edu/mcell/index.html

Cyclic Cellular Automata examples

cycl_ghmacaroni.jpg

R1/T3/C3/NM

cycl_313.jpg

R2/T4/C5/NM/GH

The notation of Cyclic Cellular Automata has the “R/T/C/N” form, where:

R – specifies the neighbourhood range (1..10).

T – specifies the threshold – minimal count of cells in the neighbourhood having the next state, necessary for the cell to change to that state.

C – specifies the number of states in the rule (0..C-1).

N – specifies the neighbourhood type: NM stands for extended Moore, NN for extended von Neumann.

GH – Greenberg-Hastings Model: A prescribed number of colors N are arranged cyclically in a “color wheel.” Each color can only advance to the next, the last cycling to 0. Every update, cells change from color 0 (resting) to 1 (excited) if they have at least Threshold 1′s in their neighbor set.

In general Cyclic CA rules should be started from uniformly randomized boards.

From Cellular Automat Rules Lexicon
(http://psoup.math.wisc.edu/mcell/index.html)

Possible Scripting Strategy:
These rules can be adapted to a cellular aggregation of small residential units by equating the states (C) to types of construction rather than color. one state (the 0 or black state above) will represent no construction, and serve as space for light, air and access between buildings.

I thought the following rules could also be added:
Roughly half of the units aggregated will be double height.
No units will be built directly to the North of a double height unit.

Here’s a start, more soon:

blocks.png