Game of life Rules:

1. 1. Any LIVE cell with fewer than two live neighbors dies, as if by underpopulation.
2. 2. Any LIVE cell with two or three live neighbors lives on to the next generation.
3. 3. Any LIVE cell with more than three live neighbors dies, as if by overpopulation.
4. 4. Any DEAD cell with exactly three live neighbors becomes a live cell, as if by reproduction.

Controls:

Choose a figure from the templates below or make your own by click on a cell. The start/stop button advances the cells generation(based off an iteration of the rules). Game speed can be controlled from the buttons in the panel below.

About the Algorithm and Game

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, or, for advanced players, by creating patterns with particular properties.

Conway's Game of Life has the power of a universal Turing machine meaning anything that can be computed algorithmically can be computed.

*Cellular Automata - one of a set of units in a mathematical model that have simple rules governing their replication and destruction. They are used to model complex systems composed of simple units such as living things or parallel processors.