# Conway's Game of Life > [[PORTAL_Agent-based_model|Agent-based model]] · [[PORTAL_Cellular_automaton|Cellular automaton]] spine. ## Microsims — three.js <div class="microsim-player"> <iframe src="https://wikitube-3d-microsims.netlify.app/Conways_Game_of_Life.html" width="100%" height="520" frameborder="0" loading="lazy" sandbox="allow-scripts allow-same-origin" title="Conway's Game of Life — three.js microsim"></iframe> </div> <p class="wt-pending"><strong>Note:</strong> staged and renamed, awaiting CDN deploy — the same build declared as a pending station on [[PORTAL_Cellular_automaton]]'s own Movement II.</p> ## Overview Conway's Game of Life is a zero-player cellular automaton devised by mathematician John Horton Conway in 1970. The simulation runs on an infinite grid where each cell is either live or dead; evolution follows deterministic rules based on a cell's eight neighbours — a live cell with two or three live neighbours survives, one with fewer than two or more than three dies, and a dead cell with exactly three live neighbours becomes alive. Despite these simple rules, the system exhibits remarkable complexity: patterns evolve into still lifes, oscillators, and spaceships, and the automaton is theoretically equivalent to a universal Turing machine. It is the canonical worked example of [[Cellular_automaton|cellular automaton]] theory and of [[Emergence|emergence]] — intricate organisation and behaviour arising spontaneously from straightforward deterministic local rules, with no central controller. **On the spine:** [[Cellular_automaton]] · [[Emergence]] · [[Complex_system]] · [[Agent-based_model]] · [[Self-organization]]. ## Wikipedia : Wikitube **Strict pair:** [Wikipedia](https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life) : [Wikitube](https://en.wikitube.io/wiki/Conway's_Game_of_Life) --- *Repopulated 2026-08-05 · existing three.js asset renamed + wired, Wikipedia-sourced overview · 0 deletions.*