Game of life

×

Conway's Game of Life

Conway's Game of Life is a cellular automaton devised by the British mathematician John Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, with no further input from humans.

The game is played on a two-dimensional grid of cells, where each cell can be either alive or dead. The rules govern the transitions between generations based on the state of neighboring cells, leading to the emergence of various interesting patterns and behaviors.

Rules:

• Birth: A dead cell with exactly three live neighbors becomes a live cell.
• Death by isolation: A live cell with fewer than two live neighbors dies (isolation).
• Death by overcrowding: A live cell with more than three live neighbors dies (overcrowding).
• Survival: A live cell with two or three live neighbors survives to the next generation.

The game progresses in generations, with each generation being a new configuration of live and dead cells based on the application of these rules.

Conway's Game of Life has been of interest to mathematicians, computer scientists, and enthusiasts due to its ability to generate complex and interesting patterns, including gliders, oscillators, and still lifes.