Created by John Conway in 1970, in his pursuit to create an interesting and unpredictable cellular automaton. Interestingly, he created this without the power of modern computing. Conway's Game of Life was created on a Go Board.
This game consists of a 2D grid and cells that exist in one of two states, 'alive' or 'dead'. This state is determined by the state of neighboring cells based on 4 simple rules:
- Any live cell with fewer than two live neighbors dies, as if by under population.
- Any live cell with two or three live neighbors lives on to the next generation.
- Any live cell with more than three live neighbors dies, as if by overpopulation.
- Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
You simply create the starting pattern, from there the game plays itself. You just sit back and watch as the cells evolve into very interesting shapes and move around the grid.
The Game of life is Turing Complete and can simulate any other Turing Machine, such as a universal constructor.
This application is built using create-react-app, by Scott Fuston.
- User can change the color of the cells, both 'alive' and 'dead'.
- User can select a 'random' starting pattern while the game is stopped.
- User can manually select cell patterns for the starting pattern.
- User has the ability to increase and decrease simulation speed.
- User can reset the board if the game is not currently running.
- Start/stop button.
- Generation counter.