This module is based on a discrete model of cellular automata. The foundation of this model is a space consisting of adjacent cells that form the "Universe." Each cell in the "Universe" can be alive, dead, immortal, or non-revivable. The size of the "Universe" is limited to 8 by 16 cells, but its borders are wrapped: the left side continues into the right, the top into the bottom, and vice versa. The eight cells surrounding each cell are called its neighborhood.
The transition of cells from one state to another is determined by rules you define. These rules are the same for all cells. In one step, the automaton processes each cell and, based on its current state and the state of its neighborhood, determines the new state that will be applied in the next generation. Before launching the automaton, you set the initial state of the cells manually or randomly.
For example, consider the rules of John Conway's "Game of Life," which in the "Universe" module are specified by the values of 3 for the "new" slider and 2 for the "keep" slider. Under these rules, "life" in an lonely cell disappears in the next generation since it lacks either three neighbors to give birth to new life or two neighbors to sustain it.