🧬 Conway's Game of Life
Conway's Game of Life is a zero-player cellular automaton in which each cell on an infinite grid is either alive or dead, and updates each generation using four simple rules based on its eight neighbours. Despite the simplicity of the rules, it can produce gliders, oscillators and even Turing-complete computing structures.
🧪 See it in action
🧬 Game of Life📖 Go deeper
For a fuller technical treatment, see the Generative Art Algorithms — Cellular automata reference on MySimulator.
Browse more terms in the MySimulator Glossary, or explore the full library of 1000+ interactive, browser-based simulations.