A cellular automaton exhibits a complex global behaviour that emerges from simple local rules, in this case of birth and death. An example rule is: if a cell on the matrix is inactive (white) and it is surrounded by three active (black) cells then it will become active. Specify your own rules by clicking on the appropriate numbers in the list boxes (You need Java to play this game).