 Each cell can be in only one of a finite number of states at a discrete time.As time moves forward, the state of each cell in the grid is determined by a transformation rule that factors in its previous state and the states of the immediately adjacent cells (the cell's "neighborhood").The most well-known example of a cellular automaton is John Horton Conway's "Game of Life", which he described in 1970.