Rules
As with any cellular automaton, the cyclic cellular automaton consists of a regular grid of cells in one or more dimensions. The cells can take on any of states, ranging from to . The first generation starts out with random states in each of the cells. In each subsequent generation, if a cell has a neighboring cell whose value is the successor of the cell's value, the cell is "consumed" and takes on the succeeding value. (Note that 0 is the successor of ; see also modular arithmetic.) More general forms of this type of rule also include a threshold parameter, and only allow a cell to be consumed when the number of neighbors with the successor value exceeds this threshold.
Read more about this topic: Cyclic Cellular Automaton
Famous quotes containing the word rules:
“Fergus rules the brazen cars,
And rules the shadows of the wood,
And the white breast of the dim sea
And all dishevelled wandering stars.”
—William Butler Yeats (1865–1939)
“As no one can tell what was the Roman pronunciation, each nation makes the Latin conform, for the most part, to the rules of its own language; so that with us of the vowels only A has a peculiar sound.”
—Henry David Thoreau (1817–1862)
“A man often thinks he rules himself, when all the while he is ruled and managed; and while his understanding directs one design, his affections imperceptibly draw him into another.”
—François, Duc De La Rochefoucauld (1613–1680)