Conway's Game of Life Simulator with Pattern Detection
Runs Conway's Game of Life on a grid you type, on a torus or with dead edges, and reports the population, snapshots and cycles.
Use the tool
Why this tool exists
Life has two rules and endless behavior: a live cell with two or three live neighbours survives, and a dead cell with exactly three becomes live. Draw a glider with # and . characters and watch it walk across the grid.
The tool prints snapshots and the population per generation and detects when the grid repeats, telling you whether it is a still life or an oscillator and its period, or that everything died. Results were compared with an independent implementation on random grids with both edge rules. It is text-based, not a clickable canvas.
How to use it
- Type the grid with # for live and . for dead cells.
- Set the number of generations.
- Choose wrap-around (torus) or bounded edges.
- Read the snapshots, population list and the cycle note.
Frequently asked questions
Which cell characters work?
#, O, o, * and 1 are live; everything else is dead.
What is the largest grid?
160 columns by 120 rows.
Why does a glider come back?
On a torus it wraps around the edges.
What about other rules?
For one-dimensional rules like Rule 30 use the elementary cellular automaton tool.