Complex patterns generated by next nearest neighbors cellular automata
Wentian Li · Computers & Graphics · 1989
A greater number of complicated patterns can be produced by cellular automata rules with next nearest neighbors in the updating, than those with only nearest neighbors couplings. Some patterns can be identified as gliders moving on the background, while other rules have more intriguing configurations called “creatures” which move irregularly on the background. Sometimes, even the distinction between creatures and the background disappears, and the patterns look strikingly similar to those generated by probabilistic rules, even though the rules used are strictly deterministic.