StarLogo Project:

Life

WHAT IS IT?

This project is a StarLogo implementation of the Game of Life (first developed by John Conway). It shows how simple local rules can lead to interesting large-scale patterns.

Each patch can be either "live" or "dead". A live patch can die from loneliness (if it has fewer than two live neighbors) or from overcrowding (if it has more than three live neigbors). A dead patch comes to life if it has exactly three live neighbors. From these simple rules, interesting patterns form.

HOW TO USE IT

Click the setup button to set up a random distribution of live patches. Click the go button to start executing the rules of the Game of Life.

The density slider controls the initial density of live patches.

THINGS TO NOTICE

The Game of Life rules can run for many generations before reaching a stable final state. Look for common patterns that emerge from the underlying rules.

Look for "gliders," a collection of five live patches that seems to move diagonally across the screen. A glider is an example of an "emergent object" -- an apparent object that arises from interactions among simpler, underlying objects.

EXPLORATIONS

Modify the StarLogo program to create other types of "cellular automata." That is, change the rules by which patches die annd come to life. Since StarLogo enables you to write a program for each patch, it offers great flexibility for creating new cellular-automata rules.

STARLOGO FEATURES

Use nsum to sum variables from the eight neighboring patches (including diagonals); use nsum4 to sum variables from the four neighboring patches (north, south, east, west).

Run StarLogo Life program

Back to Project List

Back to StarLogo Homepage