
Conway's Game of Life
Conway's Game of Life is a two-dimensional cellular automaton devised by J. H. Conway in 1970.
- Released
- October 1970
- Came out
- October 1970
All 5 facts, and where they come from
Facts
5 facts · 0 confirmed by two sources · 2 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2556971450
- Described as
- two-dimensional cellular automaton devised by J. H. Conway in 1970
- Other names
- Life, Game of Life, B3/S23, The Game of Life
- What it is
- Life-like cellular automaton · 1 reference
- Released
- October 1970 · 1 reference
- Came out
- October 1970
- Named after
- life · 1 reference; John Horton Conway
- Wikipedias with a page
- 42
Wikidata item Q244615 (wikidata.org/wiki/Q244615), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1382681040
The Game of Life, also known as Conway's Game of Life (sometimes abbreviated as CGoL) or simply Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves in discrete time steps called generations. There is no limit to the number of generations (computational resources permitting) nor is there a win condition.
The Game of Life is played on an infinite square grid, with each cell being in one of two states: live or dead. Cells in configurations called patterns evolve over generations according to the number of live and dead cells in their Moore neighborhood, that is, the eight cells in their immediate proximity.
Patterns can be grouped into different types, such as still lifes, oscillators, and spaceships.
The Game of Life was first simulated manually, with computerized simulations arriving soon afterwards. Nowadays, more modern programs such as Golly are used. These programs often do not store cells as two-dimensional arrays, instead using algorithms such as Hashlife which represent patterns as a tree structure.
The Game of Life has spawned a number of other cellular automata, known as Life-like cellular automata. Examples include Highlife and Seeds. Other variations may include more than two states or use a non-square grid.
From the Wikipedia article “Conway's Game of Life” (en.wikipedia.org/wiki/Conway's_Game_of_Life), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
Picture: Wikimedia Commons: Game of life animated LWSS.gif · See Commons file page
