Skip to content

Program Conway's Game of Life

Implement the grid rules and investigate how a few starting patterns evolve over many generations.

achievement

A chessboard beside a stack of books

Saves privately on this device. No account needed.

Read the full guide

How can you code Conway’s Game of Life and check each generation?

Represent cells on a grid, apply the four neighbour-count rules to a copy of the board, and test recognizable patterns before adding controls.

Plan the experience

Implement a cellular automaton and use known patterns to test whether its rules update the grid correctly.

Planning estimates, not a price quote or a deadline. Your version may vary.

Time
A weekend for a first implementation and pattern experiments.
Cost
Free with an existing computer and coding environment.
Where
A computer workspace where you can save code and screenshots.

Before you start

Read the original rule definitions through a reliable mathematical resource. Choose a small finite grid and explicitly decide what happens at its edges before writing the update loop.

How you would actually start

  1. Model one generation

    Represent alive and empty cells and write the neighbor-count operation. Calculate a tiny example on paper. Keep the old and new grids separate so one cell’s update does not change a neighbor’s current generation.

  2. Check recognizable patterns

    Try a still life and a simple oscillator whose expected behavior you can verify. Add generation stepping and reset controls. Test corners and edges separately rather than trusting a pattern placed only in the center.

  3. Explore a starting pattern

    Run a few chosen seeds and save the code with their coordinates. Record when a pattern stabilizes, repeats or reaches the boundary. Explain how the finite grid affects what you observe compared with an unbounded mathematical model.

What counts as done

Your program reproduces checked patterns and you have documented one experiment with explicit boundary rules.

A correct slow version is a better foundation than a fast animation whose cells update in the wrong order.

When you finish, mark it fulfilled in My list. You can remember it in your weekly journal.

Useful sources

  • Program Conway's Game of Life

    University of Auckland · Review the cellular-automaton rules before implementing generation updates and checking known patterns on your grid.

Guide updated 2026-11-07

If this appeals, so might these