Cyclic Cellular Automaton - Rules

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:

    “The values by which we are to survive are not rules for just and unjust conduct, but are those deeper illuminations in whose light justice and injustice, good and evil, means and ends are seen in fearful sharpness of outline.”
    —Jacob Bronowski (1908–1974)

    “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)

    “The reason why men enter into society, is the preservation of their property; and the end why they choose and authorize a legislative, is, that there may be laws made, and rules set, as guards and fences to the properties of all the members of the society: to limit the power, and moderate the dominion, of every part and member of the society.”
    —John Locke (1632–1704)