Private preview · educational prototype

Life-like patterns from simple rules

Each cell lives or dies only by counting its eight neighbours: a live cell with two or three live neighbours survives, and a dead cell with exactly three is born. From those rules alone come oscillators and a pattern that glides across the board (the glider). You can also tap cells to draw your own.

Publication status: Simulation (model-based experiment)

Famous patterns:

Generation: 0 · Live cells: 0

Assumptions and scientific references

The rules are exactly Conway’s Game of Life (1970), known as B3/S23. The board is finite and cells outside the edge are always dead (no wrapping). Tests confirm the classic behaviours: a blinker returns to its start in two generations, a block never changes, and a glider moves one cell diagonally every four generations.

Game of Life is one of the substrates studied by Sakana AI’s ASAL, but this page is not ASAL code and includes no foundation-model search. It is an original, lightweight implementation of the rules only.

Sources

No accounts, learning history, or external AI. All computation runs in this page and nothing is sent anywhere.

Back to Science Lab Back to home