Alive or Dead Status

Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction. 1.  Any live cell with two or three live neighbours lives on to the next generation. 3.  Any dead cell with three live neighbors becomes a live cell. 3.  Any live cell with more than three live neighbours dies, as if by overpopulation. 4.  Any live cell with two or three neighbors survives. 2.  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, alive or dead, (or populated and unpopulated, respectively).  Any live cell with fewer than two live neighbours dies, as if by underpopulation. 2.  The first generation is created by applying the above rules simultaneously to every cell in the seed; births and deaths occur simultaneously, and the discrete moment at which this happens is sometimes called a tick.  Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent. 1.  All other live cells die in the next generation.  The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.  One interacts with the Game of Life by creating an initial configuration and observing how it evolves.  The game is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input.  Similarly, all other dead cells stay dead.  It is Turing complete and can simulate a universal constructor or any other Turing machine.  The initial pattern constitutes the seed of the system.