First heading




Basic Rules

  1. Any live cell with fewer than two live neighbours dies, as if caused by under-population.
  2. Any live cell with two or three live neighbours lives on to the next generation.
  3. Any live cell with more than three live neighbours dies, as if by overcrowding.
  4. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.



Linkdump which refers to Wikipedia:Gosper’s_algorithm and a google search suggests Gosper’s Algorithm (Hashlife), An explanation of how the hashlife algorithm reduces processing time and effort for cellular automata evaluation.


variations on the game of life
Conway’s Game of Life
Games of Life in color



See Also

Rudy Rucker et alia
CellularAutomata (CL is really a subset of CA)



Category tags



No comments yet.



Add Comment

 Your Message
 Enter value ← Have you entered the code number?