Conway’s Game of Life is 0-player game designed by John Horton Conway in 1970. Each cell has two states: dead (black) or alive (white or empty). At the next generation a cell may change state according to the following rules:
- If a cell with fewer than two or more than three live neighbors dies because of underpopulation or overpopulation.
- If a live cell has two or three live neighbors, the cell survives to the next generation.
- If a dead cell has exactly three live neighbors, it becomes alive.
On a n*n grid, pick about 1/7 of the cells randomly as live cells and start the Conway’s Game of Life. The following is the animation of this program:
Tutorial for this project available.
Related Project:
