Conway's Game of Life
The reason it is called a game is because people who play the game can set it up in different ways to make it do different things. Sometimes people play the game by changing the way the imaginary robot is set up at the start to watch what happens. The Game of Life is a zero-player game because it changes without anybody playing (after the starting position is chosen). A different type of game lets two players set up imaginary robots to see which one is better.
Rules[change | change source]
The game is played on a grid of squares called cells, each cell is black (alive) or white (dead). When people are playing the game, they start by making some dead cells alive. Then the alive cells can make other cells alive or dead because of the rules of the game. The rules are:
- Any alive cell that is touching less than two alive neighbours dies.
- Any alive cell touching four or more alive neighbours dies.
- Any alive cell touching two or three alive neighbours does nothing.
- Any dead cell touching exactly three alive neighbours becomes alive.
The way a player sets up the first alive cells starts the game. The first level (generation) is made by using the 4 rules. After the player is done changing the cells, they do the same thing all over again to make the next level. The game is over when all the cells are dead or all the cells are alive or the game is doing the same thing over and over. The Game of Life is Turing-complete.
History[change | change source]
John Horton Conway made the Game of Life because he wanted to know if he could make an imaginary robot out of cells that would be able to get bigger. He combined lots of ideas in math to make the rules for the game. It is one of the first ever 'simulation games' that represent things that happen in real life. It is important because when used in complicated math, it can look at many things like physics, biology, economics, and philosophy.
Patterns[change | change source]
Patterns are special things that happen in the game. Many different types of patterns happen, including static patterns where nothing changes between levels, repeating patterns where the cells that are alive and dead repeat, and patterns that move themselves across the board ("spaceships"). Common examples of these three classes are shown below, with live cells shown in black, and dead cells shown in white.
The "block" and "boat" do not change, the "blinker" and "toad" have 2 looks that repeat, and the "glider" and "lightweight spaceship" ("LWSS") are spaceships which keep moving across the cells in each level. The "pulsar" is the most common repeat that has 3 parts. Most of the repeating patterns have 2 parts, like the blinker and toad. .
Variations on Life[change | change source]
Since the Game of Life was made, some people play with new rules. These rules are usually more ways to make cells alive or dead, or they are more rules to make it harder for cells to switch.
Some variations change the way the cells look or where they are put.
Two players[change | change source]
When two people play the Game of Life, the alive cells have two colors and a player wins when their colors take up all of the cells. When a dead cell becomes alive, its color is the same as the alive cells that touch it. If both colors are touching the new alive cell, then the color that touches it more wins.
References[change | change source]
Other websites[change | change source]
|Wikimedia Commons has media related to Game of Life.|
Many other websites concerning the Game of Life can be found on Conway's Game of Life at the Open Directory Project . In addition, Game of Life News is a blog reporting on recent developments in the Game of Life by many individuals.
Some additional links:
- Cellular Automata FAQ - Conway's Game of Life - Answers to frequently asked questions.
- Robert T. Wainwright's LIFEPAGE - From 1971 to 1973 Wainwright edited LIFELINE, an influential newsletter for enthusiasts. This site contains a downloadable copy of the first issue as well as an index.
- A Turing Machine in Conway's Game of Life - Describes an implementation of a Turing machine engineered from Game of Life pattern components.
- Conway's Game of Life Simulator - Contains a Game of Life implementation that can be run in a web browser.
- Conway's game of life implementation. (Silverlight)