Conway's Game of Life
Conway's Game of Life is a cellular automaton (yes, its automaton) devised by British mathematician John Horton Conway (May his soul rest in peace 🙏) in 1970. It is a zero player game, i.e. its evolution is determined by its intial state. It is Turing complete.
This static app hosts 50 x 50 grid using which one can set the initial state of the population. Hosted at Github page. Currently the grid is not optimized for mobile devices, so please use desktop version of the site if possible.
Rules
- Any live cell with fewer than two live neighbours dies, as if by underpopulation.
- Any live cell with two or three live neighbours lives on to the next generation.
- Any live cell with more than three live neighbours dies, as if by overpopulation.
- Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
Examples
Still life
Oscillator
Spaceships
Gun
All info and resources cited from Conway's Game of Life on Wikipedia