Naive: Difference between revisions

From LifeWiki
Jump to navigation Jump to search
Created page with "{{stub}} Naive rules, so-called due to arising in flawed implementations of cellular automata by unfamiliar programmers, are a class of cellular automata where transitions are..."
 
No edit summary
 
(5 intermediate revisions by 4 users not shown)
Line 1: Line 1:
{{stub}}
{{Glossary}}
Naive rules, so-called due to arising in flawed implementations of cellular automata by unfamiliar programmers, are a class of cellular automata where transitions are incremented in a reading-order fashion, rather than all at once.
'''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.
 
<!-- Get a piece of code in any language here for NaiveLife transitions, and another for the correct Game of Life implementation; possibly this can be in a section for NaiveLife specifically, followed by another section on naive rules in general. -->
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]]), [[soup]]s tend to explode in the shape of a dense blob,<ref name="post13142" /> and a [[natural]] 17-cell [[c diagonal]] [[spaceship]] can emerge from chaos. Several methods exist to emulate NaiveLife in [[Golly]] with the [[RuleLoader]] algorithm.<ref name="post20942" /><ref name="post103487" />
 
Naive rules can be generalized to other rules beyond Game of Life. [[lemon41625]] has put forth notations for them<ref name="post96013" /> and supported them in [[CAViewer]].
 
==References==
<references>
<ref name="post13142">{{LinkForumThread
|format    = ref
|p          = 13142
|title      = New spaceship detected?
|author    = GTP
|date      = September 9, 2014
}}</ref>
<ref name="post20942">{{LinkForumThread
|format    = ref
|p          = 20942
|title      = NaiveLife
|author    = gameoflifeboy
|date      = July 2, 2015
}}</ref>
<ref name="post103487">{{LinkForumThread
|format    = ref
|p          = 103487
|title      = Re: Thread For Your Unrecognised CA
|author    = Aleph
|date      = September 4, 2020
}}</ref>
<ref name="post96013">{{LinkForumThread
|format    = ref
|p          = 96013
|title      = Thread for your rulespace ideas
|author    = lemon41625
|date      = May 4, 2020
}}</ref>
</references>
 
==External link==
* {{LinkForumThread|f=11|t=4523|title=NaiveLife Emulated: A reading-order simulation of Life}}
 
[[Category:Algorithms]]
[[Category:Cellular automata]]

Latest revision as of 12:53, 19 July 2026

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

  1. ↑ GTP (September 9, 2014). New spaceship detected? (discussion thread) at the ConwayLife.com forums
  2. ↑ gameoflifeboy (July 2, 2015). NaiveLife (discussion thread) at the ConwayLife.com forums
  3. ↑ Aleph (September 4, 2020). Re: Thread For Your Unrecognised CA (discussion thread) at the ConwayLife.com forums
  4. ↑ lemon41625 (May 4, 2020). Thread for your rulespace ideas (discussion thread) at the ConwayLife.com forums