This is documentation for Mathematica 8, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)


generates a list representing the evolution of the cellular automaton with the specified rule from initial condition init for t steps.
gives the result of evolving init for one step.
gives only those parts of the evolution specified by tspec, xspec, etc.
CellularAutomaton[rule, init, {t, All, ...}]
includes at each step all cells that could be affected over the course of t steps.
  • Possible forms for rule are:
n, , elementary rule with rule number n
{n,k}general nearest-neighbor rule with k colors
{n,k,r}general rule with k colors and range r
{n,k,{r1,r2,...,rd}}d-dimensional rule with neighborhood
{n,k,{{off1},{off2},...,{offs}}} rule with neighbors at specified offsets
{n,k,rspec,s}order-s rule
{n,{k,1}}k-color nearest-neighbor totalistic rule
{n,{k,1},r}k-color range r totalistic rule
{n,{k,{wt1,wt2,...}},rspec}rule in which neighbor i is assigned weight
{lhs1->rhs1,lhs2->rhs2,...}explicit replacements for lists of neighbors
{fun,{},rspec}general function f to apply to each list of neighbors
bfunBoolean function to apply to collections of neighbors
  • Common forms for 2D cellular automata include:
{n,{k,1},{1,1}}9-neighbor totalistic rule
5-neighbor totalistic rule
5-neighbor outer totalistic rule
  • The number of possible cellular automaton rules is as follows:
elementary rules256
1D general rules
1D totalistic rules
2D general rules
2D 9-neighbor totalistic rules
2D 5-neighbor totalistic rules
2D 5-neighbor outer totalistic rules
  • Normally, all elements in init and the evolution list are integers between 0 and .
  • When a general function or replacement list is used, the elements of init and the evolution list can be any expressions. »
  • Explicit replacement rules can contain patterns.
  • In a 1D cellular automaton, replacement rules or an explicit function fun are always taken to apply to a 1D list of neighbors. If the neighbors are specified by explicit offsets, they are given in the order of the offsets.
  • When the neighborhood in a multidimensional cellular automaton is defined by a range specification such as , the list of neighbors is taken to be a full array with dimensions .
  • If the neighbors in a multidimensional cellular automaton are specified by an explicit list of offsets, the neighbors are supplied in a one-dimensional list in the order of the offsets.
  • If an explicit function fun is given, the first argument supplied to it is the list of neighbors. The second argument is the step number starting at 0.
  • A complete rule specification is considered to be a pure Boolean function bfun if BooleanVariables[bfun] yields an integer v. In this case, bfun is applied to neighborhoods of v cells at each step. The neighborhoods extend Ceiling cells to the left.
  • In an order-s cellular automaton, specified by , each step depends on s preceding steps.
  • Initial conditions are constructed from init as follows:
{a1,a2,...}explicit list of values , assumed cyclic
{{a1,a2,...},b}values superimposed on a b background
{{a1,a2,...},{b1,b2,...}}values superimposed on a background of repetitions of , , ...
{{{{a11,a12,...},off1}, {{a21,...},off2},...},bspec}
values at offsets on a background
{{a11,a12,...},{a21,...},...}explicit list of values in two dimensions
{aspec,bspec}values in d dimensions with d-dimensional padding
  • The first element of aspec is superimposed on the background at the first position in the positive direction in each coordinate relative to the origin. This means that is aligned with .
  • For an order-s cellular automaton, init is a list giving the initial s steps in the evolution of the system.
  • Time specifications tspec in can be as follows:
tall steps 0 through t
{t}a list containing only step t
{{t}}step t alone
{t1,t2}steps through
{t1,t2,dt}steps , , ...
  • The initial condition is considered to be at step 0.
  • Space specifications xspec can be as follows:
Allall cells that can be affected by the specified initial condition
Automaticall cells in the region that differs from the background
0cell aligned with beginning of aspec
xcells at offsets up to x on the right
-xcells at offsets up to x on the left
{x}cell at offset x to the right
{-x}cell at offset x to the left
{x1,x2}cells at offsets through
{x1,x2,dx}cells , , ...
  • In one dimension, the first element of aspec is taken by default to have space offset 0.
  • In any number of dimensions, is taken by default to have space offset .
  • Each element of the evolution list produced by CellularAutomaton is always the same size.
  • With an initial condition specified by an aspec of width , the region that can be affected after steps by a cellular automaton with a rule of range has width .
  • If no bspec background is specified, space offsets of All and Automatic will include every cell in aspec.
  • A space offset of All includes all cells that can be affected by the initial condition.
  • A space offset of Automatic can be used to trim off background from the sides of a cellular automaton pattern.
  • In working out how wide a region to keep, Automatic only looks at results on steps specified by .
Run rule 30 for 2 steps:
Run for 50 steps from a single 1 on a background of 0s:
Run rule 30 for 2 steps:
Click for copyable input
Run for 50 steps from a single 1 on a background of 0s:
Click for copyable input
Elementary rule 73:
3-color rule 679458:
3-color totalistic rule with code 867:
2-color range (two neighbors on the left and one on the right) rule 23898:
A general range rule:
totalistic rule with code 10:
Rule 30 specified by giving explicit offsets for cells in its neighborhood:
An analog of rule 30 with modified offsets:
A rule with 2 neighbors:
Rule 30 specified by giving explicit weights for cells in its neighborhood:
A 3-color totalistic rule:
Totalistic rules have weight 1 for each offset in the neighborhood:
A 3-color outer totalistic rule:
Specify rule 90 by giving explicit replacements for neighborhoods:
Specify rule 90 by giving a single "algebraic" replacement rule:
Use an explicit Boolean formula for rule 30, operating on True and False states:
Values in a cellular automaton can be any symbolic expression:
Use an arbitrary symbolic function as the rule to apply to range-1 neighbors:
Apply the function to neighbors with offsets and :
Set up a "Pascal's triangle cellular automaton":
Specify rule 90 as an explicit function:
Additive cellular automaton modulo 4:
The second argument to the function is the step number:
Change the rule at successive steps; gives the step number:
Use continuous values for cells:
Specify rule 90 as a pure Boolean function:
An analog of rule 90 specified using a pure Boolean function:
Explicit initial conditions are assumed cyclic:
The left neighbor of the leftmost cell is the rightmost cell, and vice versa:
Random initial conditions:
Start with a "seed" consisting of the block 11101 surrounded by 0s:
Start from a single 0 surrounded by 1s:
Start from 111 on a background of repeated 10 blocks:
Specify the "seed" as a sparse array:
Use a SparseArray to give the complete cyclic initial condition:
Start from block 101 at offset and block at offset :
Two steps of evolution:
Alternative form:
A list containing only the second step:
The second step, not in a list:
Steps 50 through 80:
The initial condition is step 0:
Show every third step from 0 to 100:
By default, CellularAutomaton automatically cuts off the region not covered by the pattern:
An equivalent form:
Include all cells that could possibly be affected given the structure of the rule:
Include only the region that differs from the background:
Include all cells that could possibly be affected:
By default, different rules give regions of different widths:
Force all rules of the same type to give regions of the same width:
The region that can possibly be affected depends on the range of the rule:
Show only the region from cell 0 (the position of the initial 1) to cell 40:
Negative positions are on the left:
Give the region consisting just of cell 0 at each step:
Include only the value of cell 0, not in a list:
Show every other cell in time and space:
Cell 0 is always the leftmost cell in the explicit part of the initial condition:
Repeat a finite block to fill the region of initial conditions from positions to :
Evolve range-1 2D (9-neighbor) totalistic code 14 for 2 steps:
Give only the result after 2 steps:
Show the result after 30 steps:
Show the mean color of each cell:
Show a cube at the position of each 1 cell:
A spacetime slice for 50 steps across all values at offset 0:
Mean colors of all cells with particular positions:
5-neighbor totalistic rule:
5-neighbor outer totalistic rule:
Use an initial condition with two black cells, specified in a sparse array:
3D nearest-neighbor totalistic cellular automaton:
Rule 30 written out explicitly as a "first-order rule":
A second-order analog of rule 30, involving two steps of initial conditions:
Include both initial-condition steps in the output:
Second-order rule 1008, starting with a single 1 in both initial condition steps:
Include both steps in the initial conditions:
Second-order totalistic rule 10 with 2 colors and range 1:
A 12^(th)-order version of the same rule:
Rule 150R—the second-order reversible mod 2 rule:
A spacetime slice of a second-order totalistic rule with 2 colors and range 1:
Step 50 of the same rule:
Give the result of one step of rule 30 evolution:
An alternative form:
Iterate a single step 3 times:
Give the result of 3 steps of evolution:
Give the result as a center region surrounded by repeating background:
Rule 45 gives a background of 1s after one step:
Iterate a single step of rule 45:
Make a color picture of rule 30:
Make pictures of the first 32 elementary cellular automata:
Show the 2-color range-2 totalistic code 20 cellular automaton from a sequence of initial conditions:
Show results for 3-color range-3 totalistic code 1599 for different initial conditions:
Pad with three 0s at the side of each pattern:
Show a single evolution in multiple "panels":
Show 200 steps of rule 30, with exactly 1 pixel representing each cell:
Make a "random" walk from the values of cells on the center column of rule 30:
Find repetition periods of rule 90 in cyclic regions of successive widths:
Draw the state transition graph for rule 110 in a region of size 7:
Generate a difference pattern for two cellular automata with initial conditions differing by one bit:
Show the common evolution in gray:
Show a "glider" in the "Game of Life":
Show the evolution of the "puffer train" in the "Game of Life":
The "Game of Life" from random initial conditions, averaged for 100 steps:
Averaged spacetime slice:
Patterns generated by a sequence of 2D 9-neighbor rules:
Mean cell values:
Render a 3D view of a 2D cellular automaton evolution using spheres:
Show a sequence of steps in the evolution of a 3D cellular automaton:
Show time averages of slices at a sequence of heights in a 3D cellular automaton:
Construct Pascal's triangle:
A cellular automaton based on multiplication of complex integers:
Algebraically simplify a mod 3 additive rule:
Include mesh lines:
Label cells:
Highlight the center column of cells:
steps of cellular automaton evolution gives a list of length :
Initial conditions given as explicit lists are assumed cyclic:
The center cell starting from all possible tuples gives the digits in the rule number:
By default, the lists in each evolution are made only as long as they need to be:
Use {t, All} to get lists of the same length for all rules of a particular type:
If no cells ever differ from the background, the automatically selected region will always be empty:
Rules with alternating backgrounds can give lists which contain only 0s:
If the evolution is continued for 2 steps, explicit 1s are included in the 1-step result:
In this form, a specification of the background is included:
By default, each evolution is made only as wide as it needs to be:
Use {t, All} to get consistent widths:
Cells and steps in CellularAutomaton are not numbered according to their part numbers:
Rule numbers have different meanings when the offsets are specified in different orders:
New in 4.2 | Last modified in 7