Conway's Game of Life
Generation 0
Preset #1
Preset #2
Preset #3
Preset #4
Preset #5
Presets
Beehive
Beacon
Lightweight SpaceShip
Glider
Penta-decathlon
Rules
Conway's Game of life is made of a grid of cells which possess one of two possible states - alive or dead.
Each Cell interacts with its neighbors and changes state accordingly.
- Any live cell with fewer than two live neighbours dies.
- Any live cell with two or three live neighbours lives.
- Any live cell with more than three live neighbours dies.
- Any dead cell with exactly three live neighbours becomes a live cell.
About Conway's Game of Life
John Horton Conway
The Game of Life is Conway's most well known achievement and is one of the first examples of cellular automation. Cellular automation consists of a grid of cells that exist in a series of states. Each cell examines its neighboring cells and creates a new generation of cells based on a predetermined list of rules.
The Game of Life also expressed a concept known as Turing completeness, in other words, it can simulate a Turing machine, which is an abstract model on which modern computers are made.