Python Cellular Automata — ELI5

Imagine a huge checkerboard stretching in every direction. Every square is either colored in (alive) or blank (dead). Now imagine that every square looks at its eight neighbors and follows one simple rule:

• If exactly three neighbors are alive, a dead square comes to life.
• If a living square has two or three living neighbors, it stays alive.
• Otherwise, it dies (too lonely or too crowded).

You start with a random pattern, apply the rule to every square at the same time, and draw the new board. Then do it again. And again. What happens is astonishing — from those three tiny rules, you get shapes that glide across the board, patterns that blink on and off, and structures that spit out smaller shapes forever.

This is called the Game of Life, invented by a mathematician named John Conway. It is the most famous cellular automaton — a grid of cells that follow simple rules and create complex behavior.

The amazing thing is that nobody programmed those gliders or blinkers. They just emerge from the rules. It is like planting a seed and being surprised by the tree that grows.

In Python, you can build a cellular automaton in just a few lines. Create a grid of ones and zeros, count each cell’s neighbors, apply the rules, and repeat. People use cellular automata to simulate forest fires, disease spread, crystal growth, and even entire simplified ecosystems.

The one thing to remember: Cellular automata are grids of cells that follow simple neighbor rules — and from those simple rules, beautifully complex patterns appear all on their own.