Cellular automata
From GenerativeArt
(Difference between revisions)
(add 1 D applet) |
(→One Dimensional Cellular Automaton: clean up) |
||
{{SingleImage|imageWidthPlusTen=510|imageURL=http://www.viz.tamu.edu/courses/viza626/10Fall/cellAut1b.gif|caption=}}<br /> | {{SingleImage|imageWidthPlusTen=510|imageURL=http://www.viz.tamu.edu/courses/viza626/10Fall/cellAut1b.gif|caption=}}<br /> | ||
| - | + | ||
| + | Each cell has the same number of possible states: | ||
| + | |||
* K = Number of States. | * K = Number of States. | ||
| - | * R = Number of neighbors | + | |
| + | At each time step the next state is calculated on the basis of the present state of the cell and some number of its nearest neighbors: | ||
| + | |||
| + | * R = Number of neighbors considered to either side | ||
* T = Time step. | * T = Time step. | ||
