Difference between revisions of "Isotropic non-totalistic Life-like cellular automaton"
m (Apple Bottom moved page Non-totalistic Life-like cellular automaton to Isotropic non-totalistic Life-like cellular automaton without leaving a redirect: This is really about the isotropic case.)
Revision as of 08:44, 19 November 2017
Non-totalistic Life-like cellular automata are a generalization of Life-like cellular automata. The term is often erroneously used to refer to isotropic non-totalistic Life-like cellular automata, rules in which any transition function which is isotropic (that is, invariant under rotations and reflections) is allowed.
Non-totalistic rules are described using Hensel notation, an extension of B/S notation developed by Alan Hensel additionally describing allowed or forbidden configurations. Each digit in the rule's birth and survival conditions is followed by an optional suffix, with each allowed configuration described by a specific letter; a minus sign may be used to forbid configurations rather than allow them. If no configurations are specified, all are considered to be allowed, as in the totalistic case. This notation is not used by non-isotropic Life-like cellular automata.
For instance, B2-a/S12 (the "Just Friends" rule) indicates that a live cell will survive on 1 or 2 neighbors, or a dead cell get born on 2 neighbors, except when they are adjacent.
This notation has the following symmetry: For any letter x and number n≠4, nx is defined if and only x(8-n) is defined and moreover x(8-n) is the complement (change live cells to dead and dead cells to live; ignore the center cell) of xn.
It is possible to define non-totalistic Life-like CAs on a hexagonal grid as well. The following table describes all possible neighborhood configurations for the hexagonal neighbourhood, using notation due to Paul Callahan; the names ortho, meta and para were chosen in analogy to arene substitution patterns in aromatic chemistry:
Golly does not support non-totalistic hexagonal rules using this syntax, so they must instead be simulated using either rule tables or MAP.
Soup-searching non-totalistic rules
Adam P. Goucher's apgsearch was modified to support non-totalistic rules by Aidan F. Pierce on December 17, 2015. Catagolue gained the ability to census non-totalistic rules in late January 2016. apgsearch (apgluxe) 4.2, released on September 10, 2017, can search non-totalistic rules without B0.
- Totalistic Life-like cellular automaton
- Non-isotropic Life-like cellular automaton
- Larger than Life
- Paul Callahan (December 3, 1997). "Experiments with a somewhat "Life-like" hexagonal CA (long)". Retrieved on September 29, 2017.
- Aidan F. Pierce (December 17, 2015). "Re: Hacking apgsearch". ConwayLife.com forums. Retrieved on June 12, 2016.
- Adam P. Goucher (January 21, 2016). "Re: apgsearch v2.2". ConwayLife.com forums. Retrieved on June 12, 2016.