|
This applets is an implementation of
the Jhon Conway's Game of Life, a cellular automaton,
which simulates birth, death, etc. of cells strictly
following the set of rules.
The rules:
(1) The game is played on an infinite
quadratic grid.
(2) Each grid cell is either alive or dead.
(3) The new state of each cells is determined by its
old state and the sum of the alive cells among its surrounding
8 cells.
(4) If a cell has 0, 1, 4, 5, 6, 7, or 8 alive neighbour
cells, it will die.
(5) If a cell has 2 or 3 alive neighbours, it will survive
to the next generation.
(6) If a dead cell has exactly 3 alive neighbours, the
dead cell turns to be alive.
The game shows various interesting equilibrium
states depending on the initial patterns of cells.
[For more technical
information about the available parameters, click
here.]
First of all, most parameters are self-explanatory
and you can always see brief description of each parameter
by moving the mouse pointer over the wizard.
|
