Alternating rule: Difference between revisions
Jump to navigation
Jump to search
stubby article for now. |
|||
| Line 2: | Line 2: | ||
== Support == | == Support == | ||
[[Golly]] supports a strict class subclass of alternating rules, which are used in simulating [[Birth on zero | [[Golly]] supports a strict class subclass of alternating rules, which are used in simulating [[Birth on zero neighbours|B0 rules]] to avoid [[strobing]], using [http://golly.sourceforge.net/Help/Algorithms/QuickLife.html this process]. | ||
== Extensions == | == Extensions == | ||
Revision as of 12:38, 27 September 2017
Alternating rules are a generalisation of Life-like cellular automata in which cells behaving as one rule change into cells behaving as another rule in the next generation, and then either back to the original rule or onto yet another rule, creating loops.
Support
Golly supports a strict class subclass of alternating rules, which are used in simulating B0 rules to avoid strobing, using this process.
Extensions
It is possible to extend such rules to von Neumann and hexagonal neighbourhoods, extended neighbourhoods, and non-totalistic and non-isotropic rules, and can even alternate between combinations of these.
External links
- Alternating rules (discussion thread) at the ConwayLife.com forums
- Alternating rules (discussion thread) at the ConwayLife.com forums