![]() ![]() This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL. If you mention this model or the NetLogo software in a publication, we ask that you include the citations below. William Poundstone, The Recursive Universe, William Morrow: New York, 1985. 112-117.īerlekamp, Conway, and Guy, Winning Ways for your Mathematical Plays, Academic Press: New York, 1982. Martin Gardner, "Mathematical Games: On cellular automata, self-reproduction, the Garden of Eden, and the game `life',", Scientific American, February, 1971, pp. Martin Gardner, "Mathematical Games: The fantastic combinations of John Conway's new solitaire game `life',", Scientific American, October, 1970, pp. "LifeLine: A Quarterly Newsletter for Enthusiasts of John Conway's Game of Life", nos. University of Illinois Press, Champaign, IL. The Game of Life was invented by John Horton Conway. Life Turtle-Based - same as this, but implemented using turtles instead of patches, for a more attractive displayĬA 1D Elementary - a model that shows all 256 possible simple 1D cellular automataĬA 1D Totalistic - a model that shows all 2,187 possible 1D 3-color totalistic cellular automataĬA 1D Rule 30 - the basic rule 30 modelĬA 1D Rule 30 Turtle - the basic rule 30 model implemented using turtlesĬA 1D Rule 90 - the basic rule 90 modelĬA 1D Rule 110 - the basic rule 110 modelĬA 1D Rule 250 - the basic rule 250 model CREDITS AND REFERENCES Some cellular automata, like this one, are defined using the 8-neighbors rule, others the 4-neighbors. Neighbors4 is like neighbors but only uses the patches to the north, south, east, and west. So count neighbors with counts how many of those eight patches have the living? patch variable set to true. The neighbors primitive returns the agentset of the patches to the north, south, east, west, northeast, northwest, southeast, and southwest. Give some different rules to life and see what happens.Įxperiment with using neighbors4 instead of neighbors (see below). ![]() Find a "glider gun" (very, very difficult!). The glider gun is a large conglomeration of cells that repeatedly spits out gliders. How much life can the board hold and still remain motionless and unchanging? (use DRAW-CELLS) Is there a "critical density" - one at which all change and motion stops/eternal motion begins? THINGS TO TRYĪre there any recurring shapes other than gliders and blinkers?īuild some objects that don't die (using DRAW-CELLS) ![]() THINGS TO NOTICEįind some objects that are alive, but motionless. If you want to draw your own pattern, use the DRAW-CELLS button and then use the mouse to "draw" and "erase" in the view. The INITIAL-DENSITY slider determines the initial density of cells that are alive. A blinker is a block of three cells (either up and down or left and right) that rotates between horizontal and vertical orientations. This glider will wiggle across the world, retaining its shape. The glider is composed of 5 cells which form a small arrow-headed shape, like this: There are certain recurring shapes in Life, for example, the "glider" and the "blinker". This is done in parallel and continues forever. If there are exactly three alive neighbors, the cell becomes alive. If there are 2 alive neighbors, the cell remains in the state it is in. If there are more than three alive neighbors, the cell dies. If there are less than two alive neighbors, then the cell dies. Each cell checks the state of itself and its eight surrounding neighbors and then sets itself to either alive or dead. According to specified rules, each cell will be alive or dead at the next time step. Each cell can be either "alive" or "dead." This is called the "state" of the cell. It can be thought of as a board which is divided into cells (such as square cells of a checkerboard). This particular cellular automaton is called The Game of Life.Ī cellular automaton is a computational machine that performs actions based on certain rules. This program is an example of a two-dimensional cellular automaton. You can also Try running it in NetLogo Web If you download the NetLogo application, this model is included. Sample Models/Computer Science/Cellular Automata Beginners Interactive NetLogo Dictionary (BIND)
0 Comments
Leave a Reply. |