Conway's Game of Life

Exploring the Fascinating World of Cellular Automata

Evolution Rules: Neighbors < 2 → Death Neighbors 2-3 → Survival Neighbors > 3 → Death Neighbors = 3 → Reproduction
Generation: 0 | Population: 0 | Density: 0%

Statistics

Total Generations
0
Max Population
0
Avg Population
0
Growth Rate
0%

Common Patterns

Still Lifes

Patterns that never change, such as block, beehive, loaf, boat

Oscillators

Patterns that repeat periodically, such as toad (2), beacon (2), pulsar (3)

Spaceships

Patterns that move across the grid, such as glider, lightweight spaceship (LWSS)

Guns

Patterns that produce spaceships indefinitely, such as Gosper glider gun

What is Conway's Game of Life?

Conway's Game of Life is a cellular automaton devised by British mathematician John Conway in 1970. Despite its simple rules, it can produce incredibly complex and diverse patterns, earning it the title of 'paradigm of complexity from simple rules'.

How to Play:

Evolution Rules:

Underpopulation
Live cell dies with fewer than 2 neighbors
Survival
Live cell survives with 2 or 3 neighbors
Overpopulation
Live cell dies with more than 3 neighbors
Reproduction
Dead cell becomes alive with exactly 3 neighbors

Applications:

Fun Facts: