| Cellular Automata |
|
Play with our cellular automata demos!
1-D Cellular Automata 2-D Cellular Automata Cellular automata are created to imitate dynamical systems in which space and time are discrete. The implementation of a cellular automata consists of a grid of cells that can change their state. Each time step a set of iteration rules is applied to each of the cells. Out of a finite number of possible states the rules determine depending on the previous state of a cell's surrounding neighbor cells the current state of the cell. The cellular array (grid) can be n-dimensional, where n = 1, 2, 3,... means the neighborhood of a cell. For one-dimensional cellular automatons, a cell has 2r+1 adjacent cells including itself, where r refers to the number of neighbors on either side. For two-dimensional cellular automatons, two types of neighborhood are considered: 5 cells (the cell itself and its 4 immediate non-diagonal neighbors) and 9 cells (the cell itself and its surrounding 8 neighbors). |