Conway
This Cellular Automata model implements Conway's game of life.
The rules are:
Death: cell is alive and has less than 2 or greater than 3 neighbors.
Life: cell is alive and has 2 or 3 neighbors
Birth: cell is dead and has 3 neighbors
Below are some patterns to try:
Glider: [4,4,1.0;4,6,1.0;5,5,1.0;5,6,1.0;6,5,1.0]
Blinker: [4,3,1.0;4,4,1.0;4,5,1.0]
Block: [2,2,1.0;2,3,1.0;3,2,1.0;3,3,1.0]
Beacon: [2,2,1.0;2,3,1.0;3,2,1.0;3,3,1.0;4,4,1.0;4,5,1.0;5,4,1.0;5,5,1.0]
Toad: [3,4,1.0;4,4,1.0;5,4,1.0;2,5,1.0;3,5,1.0;4,5,1.0]
Loaf: [3,4,1.0;4,3,1.0;4,5,1.0;5,3,1.0;5,6,1.0;6,4,1.0;6,5,1.0]
Conway is available as:
The Java Web Start version is preferred, though browsers with versions of Java
earlier than Java 1.6.0_13 may only work with the applet version.
See Web Start Help for details.