About Conway's Game of Life
Conway's 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.
Rules
- Any live cell with fewer than 2 live neighbors dies (underpopulation)
- Any live cell with 2 or 3 live neighbors survives
- Any live cell with more than 3 live neighbors dies (overpopulation)
- Any dead cell with exactly 3 live neighbors becomes alive (reproduction)
These rules are applied simultaneously to every cell in the grid, creating the next generation.
Interesting Patterns
Still lifes: Patterns that don't change
- Block: A 2x2 square of cells
- Beehive: A hexagonal pattern
- Loaf: A pattern resembling a loaf of bread
- Boat: A pattern resembling a small boat
Oscillators: Patterns that repeat
- Blinker: Alternates between horizontal and vertical
- Toad: Alternates between two states
- Beacon: A 2x2 pattern that oscillates
- Pulsar: A larger pattern with multiple phases
Spaceships: Patterns that move
- Glider: Moves diagonally across the grid
- Lightweight spaceship: Moves horizontally
- Middleweight spaceship: A larger horizontal spaceship
- Heavyweight spaceship: The largest known spaceship
Special Patterns:
- Gosper Glider Gun: Creates gliders indefinitely
- R-pentomino: A small pattern that evolves chaotically
- Diehard: A pattern that eventually dies after 130 generations
- Acorn: A pattern that grows into a complex structure