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 great challenge which faces us is to assure that, in our society of big-ness, we do not strangle the voice of creativity, that the rules of the game do not come to overshadow its purpose, that the grand orchestration of society leaves ample room for the man who marches to the music of another drummer.
    Hubert H. Humphrey (1911–1978)

    But suppose, asks the student of the professor, we follow all your structural rules for writing, what about that “something else” that brings the book alive? What is the formula for that? The formula for that is not included in the curriculum.
    Fannie Hurst (1889–1968)

    Here was a place where nothing was crystallized. There were no traditions, no customs, no college songs .... There were no rules and regulations. All would have to be thought of, planned, built up, created—what a magnificent opportunity!
    Mabel Smith Douglass (1877–1933)