The Game of Life, usually just called Conway's Game of Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970: a grid of cells, each either alive or dead, that evolves from one generation to the next purely by four fixed rules with no further input from any player. A living cell with fewer than two or more than three living neighbors dies, a living cell with two or three living neighbors survives, and a dead cell with exactly three living neighbors becomes alive. Despite these simple rules, the patterns that emerge range from still shapes that never change, to oscillators that repeat, to gliders and other spaceships that travel steadily across the grid, and the system has been shown capable of simulating a full Turing machine. First published in Scientific American in 1970, it has remained a subject of active study ever since.
Facts
Connections
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Named After
Derived from the object's own name (unambiguous possessive-token match to exactly one live mathematician entity, w-bfill-g5-0924 browse backfill)
Sources
1. Conway's Game of Life (Wikipedia)
History sectionQuote, History section
The game made its first public appearance in the October 1970 issue of Scientific American, in Martin Gardner's "Mathematical Games" column
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.