Tutor AI

Conway's Game of Life

20
Generation: 0

Statistics

Living Cells: 0
Population Change: 0
Stable Pattern: No

Grid Controls

Size: 50x50
Pixels: 12

Drawing Tools

Preset Patterns

Pick a pattern, then click the grid to add as many copies as you like.

Game Rules

How to Play

Click on cells to toggle them alive/dead

Drag to draw patterns

Rules:

  • Live cell with 2-3 neighbors survives
  • Dead cell with exactly 3 neighbors becomes alive
  • All other live cells die, other dead cells stay dead

Conway's Game of Life — Interactive Cellular Automaton Simulation

Conway's Game of Life is a zero-player cellular automaton devised by mathematician John Conway in 1970. This implementation renders the simulation on an HTML5 canvas with adjustable grid size and simulation speed. Users can draw initial cell patterns by clicking or dragging, load classic preset patterns like Gliders, Gosper Gliders, and Still Lifes, and observe how complex emergent structures arise from four simple rules governing cell birth, survival, and death.

The four rules — a live cell with two or three neighbors survives, a dead cell with exactly three neighbors becomes alive, and all other cells die or stay dead — are sufficient to produce self-replicating structures, oscillators, and even Turing-complete computational patterns. The simulation demonstrates how local rules create global complexity, a central concept in complexity theory and artificial life research.