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:

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

    “There is no country in which so absolute a homage is paid to wealth. In America there is a touch of shame when a man exhibits the evidences of large property, as if after all it needed apology. But the Englishman has pure pride in his wealth, and esteems it a final certificate. A coarse logic rules throughout all English souls: if you have merit, can you not show it by your good clothes and coach and horses?”
    —Ralph Waldo Emerson (1803–1882)

    “For 350 years we have been taught that reading maketh a full man, conference a ready man and writing an exact man. Football’s place is to add a patina of character, a deference to the rules and a respect for authority.”
    —Walter Wellesley (Red)