A cellular automation is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on the states of neighboring cells. The rules are then applied iteratively for as many time steps as desired. The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970. 

It is a zero player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves.

The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, live or dead, (or populated and unpopulated, respectively).

Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent.

At each step in time, the following transitions occur:
-Any live cell with fewer than two live neighbours dies, as if by under-population
-Any live cell with two or three live neighbours lives on to the next generation
-Any live cell with more than three live neighbours dies, as if by overpopulation
-Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.