Origins: How Conway’s Game of Life Was Born

The Game of Life was not invented at a computer terminal. It was invented on a floor, with stones borrowed from a Go board, by a mathematician who thought with his hands and didn’t much care what AI researchers were doing down the hall. John Conway was not building a simulation, not writing a program, not thinking about artificial intelligence. He was playing — which is to say, he was doing mathematics — and from that play came one of the most consequential accidental discoveries of the twentieth century.

What makes the origin story remarkable is the series of improbable collisions required for it to happen at all. A Hungarian polymath had to pose a question about machine self-replication in the 1940s. A Polish-American mathematician had to suggest drawing it on a grid. A Cambridge eccentric had to decide the answer could be found with simpler rules. And a philosophy graduate who had taught himself mathematics from books had to write a column in a popular science magazine at exactly the right moment. Remove any one of them, and the Game of Life, in the form we know it, does not exist.

This is the story of that chain.

The Long Prehistory: Los Alamos, 1945–1953

The first cellular automaton was not invented for fun. It was invented to answer a question that was, in 1945, of urgent seriousness: what is the minimum complexity required for a machine to reproduce itself?

The question belonged to John von Neumann — mathematician, physicist, architect of the modern computer. He had been thinking about the problem in terms of physical robots: a machine that could assemble a copy of itself from parts. He quickly ran into trouble. The robot would need to contain a complete description of itself — but that description would itself need to be described, and so on. The infinite regress threatened the whole project.

The solution came from Stanisław Ulam, von Neumann’s colleague at Los Alamos. Ulam suggested abandoning the physical robot entirely and working instead on an abstract grid: a mathematical machine in mathematical space, where physical difficulties did not apply. Von Neumann recognized this was the right framework. He spent the late 1940s designing a cellular automaton capable of building a copy of any pattern, including itself. The result required 29 distinct cell states, a five-cell neighborhood, and a rule table of more than 30,000 entries. Instantiating a self-replicating configuration demanded roughly 200,000 cells. It was enormous and inelegant. But it was rigorous: von Neumann proved that self-replication was not a biological miracle. It was a consequence of sufficient computational complexity, achievable by any system with the right rule structure.

The logical architecture of his proof was, in retrospect, as important as the construction itself. Von Neumann showed that a self-replicating machine required a universal constructor plus a tape encoding of itself: the constructor builds the machine using the tape, then copies the tape into the new machine. Watson and Crick’s 1953 discovery revealed that DNA uses exactly this structure — the double-stranded molecule serving simultaneously as description and mechanism. Von Neumann had derived the logic of DNA replication from first principles, years before anyone knew what DNA looked like.

For the mathematicians who followed his work, the obvious question was: how simple could you make the rule system and still get the interesting behavior? Von Neumann’s 29-state automaton was a proof of possibility, not an aesthetic object. Could you do the same thing in two states? In a simpler neighborhood? With rules a person could actually enumerate?

That question sat in the literature for almost two decades, waiting for the right person to pick it up.

The Man and the Game: Cambridge, 1965–1970

John Conway was not the obvious person to pick it up. He was a group theorist and number theorist whose most important work — the surreal numbers, the Conway groups, the monstrous moonshine conjecture — had nothing to do with automata. He was, in the words of his Princeton colleague Simon Kochen, “the most creative and most unusual mathematician of his generation,” and his creativity expressed itself through play: he juggled, invented games, lectured while lying on the floor, and thought by moving physical objects in physical space.

Conway became interested in von Neumann’s question around the mid-1960s. The mathematical community knew that the 29-state construction was grotesquely over-engineered — surely the minimum complexity for universal computation was far lower. Conway set himself the challenge: find a two-state, two-dimensional cellular automaton satisfying three criteria. No finite initial configuration should obviously explode forever. No finite initial configuration should obviously die out. And there should exist configurations whose behavior was genuinely unpredictable from inspection — rules that required you to run them to find out what happened. That third criterion was, in essence, a demand for computational depth: consequences that could not be shortcut.

Conway conducted his experiments in the Cambridge mathematics common room, using a Go board as his grid and Go stones as his cells. He tried rules for months — experimenting with different birth conditions, different survival conditions, different neighborhoods. Most candidate rules were immediately boring: they either produced explosive growth or rapid extinction, with nothing interesting in between. A few were interesting in the short term but settled quickly into stasis or repetition.

The rules he eventually settled on — a dead cell is born with exactly 3 live neighbors, a live cell survives with 2 or 3 live neighbors, and all other live cells die — were found by observation, not derivation. There is no theorem that singles them out. There is no elegant equation whose solution is B3/S23. Conway found them empirically, by running hundreds of experiments on a Go board, discarding the rules that didn’t produce the behavior he wanted, and keeping the ones that did. The birth and survival conditions he chose were, in some sense, just the ones that worked.

What made them work was a specific balance of forces. The survival rule is conservative enough to prevent most configurations from exploding immediately. The death rule is strict enough to prevent inert mass from accumulating. The birth rule is permissive enough to keep interesting activity going. Together, the rules sit at what complexity theorists would later call the “edge of chaos” — the narrow parameter regime between ordered stasis and disordered noise where complex, structured behavior is possible. Conway arrived at this edge by hand, without that theoretical framework, and recognized it by eye.

He called his discovery the Game of Life. He thought it was interesting. He did not suspect it was important.

The Column That Changed Everything: October 1970

Martin Gardner was not a mathematician. He was born in Tulsa in 1914, educated in philosophy at the University of Chicago, and had spent most of his adult life as a freelance writer. He had taught himself mathematics from books, corresponded for decades with puzzle designers, logicians, and recreational mathematicians, and since 1956 had written the Mathematical Games column in Scientific American. The column appeared in a magazine with roughly 300,000 subscribers, many of them scientists and engineers who read Gardner not for professional development but for pleasure.

The Mathematical Games column was the most important vehicle for mathematical ideas in popular culture that the twentieth century produced. Over twenty-five years, Gardner introduced his readers to public-key cryptography, Penrose tilings, flexagons, combinatorial game theory, and dozens of other topics that lived in the borderland between puzzle and proof. He had a gift for finding the precise point of entry into a deep subject — and he had built an audience that trusted his judgment about what was worth caring about.

Conway sent Gardner a description of his game, along with observations about interesting patterns, in mid-1970. Gardner recognized immediately what he had: a game anyone could play with graph paper and a pencil, deep enough to absorb a professional mathematician for months, touching in the most concrete possible way on the questions at the center of 1970 intellectual culture — What is computation? What is life? What can simple rules produce?

Gardner’s column appeared in the October 1970 issue of Scientific American. It explained the rules, showed initial configurations and their evolutions, described interesting patterns Conway had found, and — crucially — posed open questions. Conway had offered a $50 prize to the first person who could prove that some initial configuration grew without bound forever, or prove that none could. Gardner published the prize. He was distributing a research problem to roughly 450,000 readers at once.

The response was unlike anything Gardner had received in fourteen years. Letters arrived by the hundreds. Readers who had computed Life patterns by hand sent their results; readers with computer access described what they had found in simulation. Gardner published a follow-up column in February 1971, then another. Within weeks of publication, the Game of Life had become a distributed collaborative research project, propagating through the readership of Scientific American faster than any individual could have replicated it. It was the first viral research problem.

The Explosion: 1970–1971

Conway’s prize was claimed within months. Bill Gosper, a mathematician and hacker at the MIT Artificial Intelligence Laboratory, organized a team to work on the problem systematically. In November 1970 — less than two months after Gardner’s column — Gosper discovered the Gosper Glider Gun: a stable, oscillating configuration that periodically emitted a stream of gliders. The glider gun was not merely a curiosity. It demonstrated that the Game of Life could support infinite growth, claiming Conway’s prize, and it revealed something deeper: gliders — the small, moving patterns Conway had identified early on — could be used to carry information across the grid. The gun was a transmitter.

The MIT AI Lab’s PDP-6, one of the most powerful time-sharing computers in the country, was consumed for weeks by Life simulations. According to contemporary accounts, the machine’s operators eventually had to post a sign: No Game of Life during business hours. Similar scenes unfolded at Princeton, at Bell Labs, at research institutions across the country. A 1974 estimate, widely cited but difficult to verify, held that in the years following Gardner’s column, the Game of Life had consumed more computer time than any other single program in history.

What were they computing? Partly they were exploring — running configurations from random starts, watching what happened. But partly they were proving theorems, one generation at a time, by simulation. By 1971, researchers had demonstrated oscillators of several periods, identified the major families of still lifes, and begun the theoretical work that would eventually show Life to be Turing complete. The formal proof of Turing completeness came later — it was completed in 1982 — but the intuition was already present in 1971: Life was not a game but a universal computer. Any computation that any computer could perform could, in principle, be embedded in a Life grid.

Conway himself received hundreds of letters. He had not expected this. He thought the game would interest mathematicians, not physicists, computer scientists, or high school students with graph paper. The breadth of the response was genuine surprise, and not entirely comfortable. For most of the next two decades, whenever Conway met someone new, they wanted to talk about Life. He wanted to talk about surreal numbers.

Why This, and Not Something Else?

The question is worth asking. There were other cellular automata in the literature in 1970. There were other interesting mathematical puzzles. Gardner had covered hundreds of topics. Why did Life hit so hard?

Part of the answer is timing. By 1970, a meaningful population of researchers had computer access for the first time — enough to run Life, to compute in hours what would have taken months by hand a decade earlier. Gardner’s column arrived exactly when that population was large enough to generate discoveries but small enough for each one to feel significant.

Part of the answer is Gardner himself: his twenty-five years of reliably finding things worth caring about had built an audience that trusted his judgment. A column from Gardner was a warrant of interestingness.

But the deepest part of the answer is that the Game of Life was genuinely, startlingly profound — and it arrived at exactly the right moment for that profundity to land. The first wave of AI research had just crashed; the grand promises of the 1950s had not been kept, and researchers were asking what intelligence really required. Molecular biology was in its revolutionary decade, grappling with the mechanics of life at the molecular level. Systems theory and cybernetics were in vogue, and the question of how organized complexity arose from simple physical laws was on the agenda in half a dozen disciplines simultaneously.

Life landed in the middle of all of this. It was a demonstration — concrete, visible, playable — that four rules on a grid could produce structures that looked, undeniably, alive. It didn’t answer the hard questions. But it made them feel closer and more tractable than they had before. That is what made it unforgettable.

Where to Go From Here

The origins cluster traces this full history in depth: the people, the ideas, and the specific moments that brought the Game of Life into existence.

The Figures

The Context

The Timeline

  • A History of Cellular Automata: 1940–Present → The full chronological record, from von Neumann’s first grid experiments through the Turing completeness proof to the modern era of online Life communities and the 34-trillion-generation stabilization record.

The Game of Life begins with a grid, four rules, and the question of whether a machine can know itself well enough to build a copy. Start with John Conway → if you want the human story first, or Before Conway → if you want the intellectual prehistory.