History

From Cambridge to the World

How a recreational mathematician's lunchtime experiment in 1970 became one of the most studied, replicated, and philosophically provocative ideas in computer science history.

John Horton Conway

Born in Liverpool in 1937, John Horton Conway was one of the most original and playful mathematicians of the twentieth century. A fellow at Gonville and Caius College, Cambridge, and later a professor at Princeton, Conway made foundational contributions to group theory (co-discovering the Monster group), knot theory, number theory (surreal numbers), and combinatorial game theory. He was prolific, irreverent, and legendary for working at a blackboard with no notes.

Colleagues describe a man who could hold an entire complex proof in his head while simultaneously entertaining the room with juggling, backgammon hustling, or explaining why some number's properties were secretly beautiful. His office at Princeton was famously covered floor-to-ceiling in mathematical ephemera and Go sets.

But for all his achievements, Conway spent the last decades of his life with something approaching ambivalence about the thing that made him most famous: a recreational simulation he invented in 1970 while avoiding faculty meetings.

The Problem: Self-Replication

In the late 1940s, John von Neumann — mathematician, physicist, and architect of modern computing — posed a fundamental question: could a machine reproduce itself? Von Neumann designed an extraordinarily complex cellular automaton with 29 possible states per cell to demonstrate that self-replication was theoretically possible. His universal constructor was proven but never actually implemented — the rules were too complex.

Conway's goal was to find the simplest possible rule set that could produce interesting behavior, including the potential for self-replication. He wasn't trying to model anything physical. He was doing mathematics for its own sake.

Working on a Go board during lunches at Cambridge through the late 1960s, Conway and colleagues experimented with various birth/death rules. Most produced boring outcomes — everything died, or the grid filled up immediately. After extensive testing, the B3/S23 rule set emerged: a cell is born with exactly 3 live neighbors; a living cell survives with 2 or 3 neighbors; all other cells die. The rules were deceptively minimal. The results were anything but.

Martin Gardner and Scientific American

Conway's invention might have remained a Cambridge curiosity if not for Martin Gardner. For twenty-five years, Gardner wrote "Mathematical Games" — the most influential recreational mathematics column ever published — in Scientific American. He had an uncanny ability to identify ideas that were simultaneously deep, accessible, and playful.

In October 1970, Gardner devoted his column to Conway's new cellular automaton, calling it the "Game of Life." The article ran only a few pages. The response was unlike anything Gardner had seen in his career.

"The greatest recreational mathematics article I ever wrote."

— Martin Gardner, reflecting on the 1970 Game of Life column

Within weeks, hobbyists across North America and Europe were simulating Life by hand on graph paper, or — for those with access — on the minicomputers and terminals that were just beginning to appear in universities. The column consumed significant fractions of computing time at institutions including MIT's Project MAC, where systems were reportedly left running Life overnight.

Gardner followed up with additional columns in February 1971 and April 1971 as readers mailed in discoveries. The $50 prize Conway had offered for the first proof that some initial pattern could grow forever without limit — eventually claimed by Bill Gosper's Glider Gun in November 1970 — generated extraordinary community engagement.

Timeline

Late 1940s
Von Neumann formalizes cellular automata and constructs a theoretical self-reproducing automaton with 29 states. Stanisław Ulam suggests the cellular lattice framework.
1968–1970
Conway experiments with birth/death rules on a Go board at Cambridge, testing dozens of rule sets before settling on B3/S23 as producing reliably interesting behavior.
Oct 1970
Martin Gardner publishes "Mathematical Games: The fantastic combinations of John Conway's new solitaire game 'life'" in Scientific American. The response is immediate and global.
Nov 1970
Bill Gosper and the MIT AI Lab group discover the Gosper Glider Gun — the first pattern proven to produce unbounded growth. Conway's $50 prize is awarded.
1971
Gardner publishes follow-up columns as Life discoveries pour in. The "Lifenthusiast" community grows. Dedicated Life programs appear on the PDP-10, IBM 360, and early microcomputers.
1982
Conway publishes Winning Ways for Your Mathematical Plays (with Berlekamp and Guy), a four-volume masterwork on combinatorial game theory that includes GoL analysis.
1982
William Poundstone publishes The Recursive Universe — the first book-length treatment of GoL and its philosophical implications for computation and reality.
1985
Gosper invents the Hashlife algorithm, enabling simulation of GoL patterns through a quadtree representation — allowing astronomically large and long-running patterns to be computed in polynomial rather than exponential time.
2002
Stephen Wolfram publishes A New Kind of Science, placing GoL within a broader computational framework for understanding complex systems via simple rules.
2010
Paul Chapman proves that GoL is Turing complete by constructing a working computer within it. A universal constructor — the goal von Neumann had set sixty years earlier — is later demonstrated.
Apr 2020
John Horton Conway dies in Princeton from COVID-19 complications, age 82. Tributes pour in from mathematicians, computer scientists, and the countless hobbyists whose lives his invention had touched.

Conway's Complicated Legacy

For all the joy it brought others, Conway reportedly found his association with the Game of Life more burden than blessing in later years. Visitors to his Princeton office invariably wanted to talk about Life. Journalists called him not for his work on the Monster group or surreal numbers — achievements he considered far more significant — but for a lunchtime recreation.

"It's a game I invented that got completely out of control. People think of it as my greatest achievement. I think of it as a trivial thing."

— John Horton Conway

The irony is that Conway's attitude reflects a truth about creative work: the things that resonate most widely are often not the things their creators value most. Life spread because Gardner's column reached the right audience at the right moment — as computing moved out of institutions and into reach of motivated amateurs. The game gave non-mathematicians a way to do mathematics, to make a discovery, to participate.

Conway's real masterworks — the surreal numbers, the classification of finite simple groups, On Numbers and Games — require years of mathematical training to appreciate. Life required only graph paper and patience. And that accessibility, not the game's mathematical depth, is what made it immortal.