Conway's Game of Life is a cellular automaton developed by the British mathematician John Conway in 1970.
Once an initial pattern has been set, the value of a cell in future generations is determined by the state of its neighbors in the previous generation:
- An alive cell with 0 or 1 neighbors dies in the next generation
- An alive cell with 2 or 3 neighbors survives to the next generation
- An alive cell with 4 or more neighbors dies in the next generation
- A dead cell becomes alive in the next generation if it has exactly 3 neighbors
In this implementation, you can choose your initial starting configuration and choose how quickly you want your browser to iterate through generations.
For anyone that would like to learn more about cellular automata or the Game of Life, check out ConwayLife.com.
See also: Project 1: Boids