The Game of Life is a cellular automaton devised by mathematician John Conway in 1970. It's a zero-player game, meaning its evolution is determined by its initial state, requiring no further input.
What makes this cellular automaton truly fascinating is its computational universality. Despite having only four simple rules, the Game of Life is Turing complete, meaning it can simulate any computation that can be performed by a computer. In fact, it's theoretically possible to build the entire Game of Life within itself – creating a recursive, self-contained universe where patterns can compute, store information, and even replicate themselves.
I first discovered this mesmerizing world through ScienceEtonnante's excellent video which beautifully explains the mathematical foundations. Later, I watched an Arte documentary that delved into Conway's life and mathematical legacy, and finally discovered Ego's visual exploration of the stunning patterns that emerge from these simple rules.
Over the decades, enthusiasts have discovered and catalogued thousands of patterns. Here are some of the most fundamental ones:
Block - remains unchanged
Oscillates every 2 generations
Moves diagonally across the grid
Oscillates every 2 generations
Oscillates every 2 generations
Complex oscillator (period 3)
These are just a few examples of the thousands of patterns discovered over the decades. Each pattern tells a story of emergence, complexity, and mathematical beauty.
Wikipedia: Examples of Patterns — Comprehensive catalog with detailed descriptions
Conway Life Pattern Library — Interactive collection of patterns to explore
Wikipedia: Conway's Game of Life — Comprehensive overview and mathematical details
LifeWiki — Extensive catalog of patterns and discoveries
Play Game of Life — Interactive simulator with preset patterns