Conway's game of life
This game is one of the most famous cellular automaton, and is the precursor of the a-life systems.
The game is played on a 20x20 matrix, and we are going to consider absorbent boundary conditions. A matrix element with a value of one is said to be alive, and an element with a value of zero is said to be dead. The system evolves by applying the following rules:
- An alive element with two alive neighbours remains alive
- An alive element with three alive neighbours remains alive, or borns if it was dead.
- The rest of the elements die or remains dead.
The following applet makes a simulation of this game, beggining wit a glider. You can change the configuration of the game at any moment by changing the M matrix. You can advance one generation clicking the Step button, or you can advance till the final time clicking the Continue button.
Last modified 1/1/2000 by Juan de Lara ( Juan.Lara@ii.uam.es, http://www.ii.uam.es/~jlara) need help for using this courses?.
The OOCSMP code - The SODA code