The best-known example of a
cellular automaton; refers to the cellular automaton with these simple rules:
grid = planar square grid
neighborhood = 8 cells adjacent to a cell either orthogonally or diagonally
generation = all cells with fewer than 2 or more than 3 neighbors die, while a cell is born in each empty node with exactly 3 neighbors.
These simple rules generate amazingly complex, chaotic behavior, but balanced in the sense that it always settles down after a while to a static or oscillatory state.
See also: barber pole, barge, beacon, beehive, blinker, block, boat, clock, eater, fishhook, glider, glider gun, loaf, long barge, long boat, long ship, pond, ship, sinking ship, spaceships, toad, tub.