COSC 420/527 — Biologically Inspired Computation
NetLogo Simulation

Conway’s Game of Life

This page was automatically generated by 5.0beta2. Questions, problems? Contact feedback@ccl.northwestern.edu.

The applet requires Java 5 or higher. Java must be enabled in your browser settings. Mac users must have Mac OS X 10.4 or higher. Windows and Linux users may obtain the latest Java from Sun's Java site. If the display appear cut off with Firefox, then try another browser (Safari works).

view/download model file: Life.nlogo

WHAT IS IT?

This program is an example of a two-dimensional cellular automaton. A cellular automaton is a computational machine that performs actions based on certain rules. It can be thought of as a board which is divided into cells (such as square cells of a checkerboard). Each cell can be either "alive" or "dead." This is called the "state" of the cell. According to specified rules, each cell will be alive or dead at the next time step.

This particular cellular automaton is called The Game of Life. The rules of the game are as follows. Each cell checks the state of itself and its eight surrounding neighbors and then sets itself to either alive or dead. If there are less than two alive neighbors, then the cell dies. If there are more than three alive neighbors, the cell dies. If there are 2 alive neighbors, the cell remains in the state it is in. If there are exactly three alive neighbors, the cell becomes alive. This is done in parallel and continues forever.

There are certain recurring shapes in Life, for example, the "glider" and the "blinker". The glider is composed of 5 cells which form a small arrow-headed shape, like this:

 X
 X
 XXX

This glider will wiggle across the world, retaining its shape. A blinker is a block of three cells (either up and down or left and right) that rotates between horizontal and vertical orientations.

HOW TO USE IT

The INITIAL-DENSITY slider determines the initial density of cells that are alive. SETUP-RANDOM places these cells. GO-FOREVER runs the rule forever. GO-ONCE runs the rule once.

If you want to draw your own pattern, use the ADD-CELLS button and REMOVE-CELLS button and then use the mouse to "draw" in the view. Make sure only one of the two buttons is active -- if they're both active, you'll get unexpected behavior.

THINGS TO NOTICE

Find some objects that are alive, but motionless.

Is there a "critical density" - one at which all change and motion stops/eternal motion begins?

THINGS TO TRY

Are there any recurring shapes other than gliders and blinkers?

Build some objects that don't die (using "add-cells")

How much life can the board hold and still remain motionless and unchanging? (use "add-cells")

The glider gun is a large conglomeration of cells that repeatedly spits out gliders. Find a "glider gun" (very, very difficult!).

EXTENDING THE MODEL

Give some different rules to life and see what happens.

Experiment with using neighbors4 instead of neighbors (see below).

NETLOGO FEATURES

The neighbors primitive returns the agentset of the patches to the north, south, east, west, northeast, northwest, southeast, and southwest. So "count neighbors with [living?]" counts how many of those eight patches have the living? patch variable set to true.

neighbors4 is like neighbors but only uses the patches to the north, south, east, and west. Some cellular automata, like this one, are defined using the 8-neighbors rule, others the 4-neighbors.

RELATED MODELS

Life Turtle-Based - same as this, but implemented using turtles instead of patches, for a more attractive display
CA 1D Elementary - a model that shows all 256 possible simple 1D cellular automata
CA 1D Totalistic - a model that shows all 2,187 possible 1D 3-color totalistic cellular automata
CA 1D Rule 30 - the basic rule 30 model
CA 1D Rule 30 Turtle - the basic rule 30 model implemented using turtles
CA 1D Rule 90 - the basic rule 90 model
CA 1D Rule 110 - the basic rule 110 model
CA 1D Rule 250 - the basic rule 250 model

CREDITS AND REFERENCES

The Game of Life was invented by John Horton Conway.

PROCEDURES

patches-own [
 living? ;; indicates if the cell is living
live-neighbors ;; counts how many neighboring cells are alive
]
to setup-blank
 ask patches
[ cell-death ]
end
to setup-random
 ask patches
[ ifelse random-float 100.0 < initial-density
 [ cell-birth ]
 [ cell-death ] ]
end
to cell-birth
 set living? true
set pcolor fgcolor
end
to cell-death
 set living? false
set pcolor bgcolor
end
to go
 ask patches
[ set live-neighbors count neighbors with [living?] ]
 ;; Starting a new "ask patches" here ensures that all the patches
;; finish executing the first ask before any of them start executing
;; the second ask. This keeps all the patches in sync with each other,
;; so the births and deaths at each generation all happen in lockstep.
ask patches
[ ifelse live-neighbors = 3
[ cell-birth ]
[ if live-neighbors != 2
[ cell-death ] ] ]
end
to add-cells
 while [mouse-down?]
 [ ask patch mouse-xcor mouse-ycor
[ cell-birth ] ]
end
to remove-cells
 while [mouse-down?]
 [ ask patch mouse-xcor mouse-ycor
[ cell-death ] ]
end
to save-state
 export-world user-input "Enter file name for saving."
end
to load-state
 setup-blank
 import-world word (user-input "Saved file name?") ".csv"
end
; *** NetLogo 3.1.4 Model Copyright Notice ***
;
; This model was created as part of the project: CONNECTED MATHEMATICS:
; MAKING SENSE OF COMPLEX PHENOMENA THROUGH BUILDING OBJECT-BASED PARALLEL
; MODELS (OBPML). The project gratefully acknowledges the support of the
; National Science Foundation (Applications of Advanced Technologies
; Program) -- grant numbers RED #9552950 and REC #9632612.
;
; Copyright 1998 by Uri Wilensky. All rights reserved.
;
; Permission to use, modify or redistribute this model is hereby granted,
; provided that both of the following requirements are followed:
; a) this copyright notice is included.
; b) this model will not be redistributed for profit without permission
; from Uri Wilensky.
; Contact Uri Wilensky for appropriate licenses for redistribution for
; profit.
;
; This model was converted to NetLogo as part of the projects:
; PARTICIPATORY SIMULATIONS: NETWORK-BASED DESIGN FOR SYSTEMS LEARNING
; IN CLASSROOMS and/or INTEGRATED SIMULATION AND MODELING ENVIRONMENT.
; The project gratefully acknowledges the support of the
; National Science Foundation (REPP & ROLE programs) --
; grant numbers REC #9814682 and REC-0126227.
; Converted from StarLogoT to NetLogo, 2001.
;
; To refer to this model in academic publications, please use:
; Wilensky, U. (1998). NetLogo Life model.
; http://ccl.northwestern.edu/netlogo/models/Life.
; Center for Connected Learning and Computer-Based Modeling,
; Northwestern University, Evanston, IL.
;
; In other publications, please use:
; Copyright 1998 Uri Wilensky. All rights reserved.
; See http://ccl.northwestern.edu/netlogo/models/Life
; for terms of use.
;
; *** End of NetLogo 3.1.4 Model Copyright Notice ***