- English Document | 中文文档
The Game of Life is a cellular automation devised by the mathematician John Horton Conway from Cambridge University. It came to become well-known for the article published at Scientific American in 1970.
Rules of the Game of Life: The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, alive of dead, (or populated and unpopulated, respectively). Every cell interacts with its eight neighbors, which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:
- For a box with a live cell:
- There existing fewer than two live neighbors, the cell dies, due to loneliness.
- There existing more than three live neighbors, the cell dies, due to crowding.
- There existing two or three live neighbors, the cell lives on to the next generation.
- For an empty box or a box with a dead cell:
- There existing three neighbors, the box generates a new live cell, as if by reproduction.
- Achieve the main logic described above
- Display the algorithm with a friendly interface
- Able to set the initial state in advance
- Able to take control of the animation rate
Demo：Game of Life | ©Leslie Wong
