Naive
Jump to navigation
Jump to search
Naive rules, so called due to arising in flawed implementations of cellular automata, are a class of cellular automata where transitions are performed in a reading-order fashion, rather than all at once.
Compared with normal rules, their naive counterparts behave in a more distinctive, anisotropic manner. For instance, under NaiveLife (the naive version of Conway's Game of Life), soups tend to explode in the shape of a dense blob,[1] and a natural 17-cell c diagonal spaceship can emerge from chaos. Several methods exist to emulate NaiveLife in Golly with the RuleLoader algorithm.[2][3]
Naive rules can be generalized to other rules beyond Game of Life. lemon41625 has put forth notations for them[4] and supported them in CAViewer.
References
- ↑ GTP (September 9, 2014). New spaceship detected? (discussion thread) at the ConwayLife.com forums
- ↑ gameoflifeboy (July 2, 2015). NaiveLife (discussion thread) at the ConwayLife.com forums
- ↑ Aleph (September 4, 2020). Re: Thread For Your Unrecognised CA (discussion thread) at the ConwayLife.com forums
- ↑ lemon41625 (May 4, 2020). Thread for your rulespace ideas (discussion thread) at the ConwayLife.com forums
External link
- NaiveLife Emulated: A reading-order simulation of Life (discussion thread) at the ConwayLife.com forums