Polystate Life: Difference between revisions
Apple Bottom (talk | contribs) Glossary (?) entry on Lejkin's Polystate Life. |
|||
| (6 intermediate revisions by 4 users not shown) | |||
| Line 2: | Line 2: | ||
The '''Polystate Life''' family of rules is a [[multistate rule|multistate]] generalization of [[Conway's Game of Life]]. Polystate Life rules have one dead state and ''n'' ≥ 2 live states; each live state, along with the shared dead state, evolves according to the rules of [[Conway's Game of Life]], independent of the remaining live states. In the event that a dead cell would get born in two or more different states simultaneously, it gets born in neither. | The '''Polystate Life''' family of rules is a [[multistate rule|multistate]] generalization of [[Conway's Game of Life]]. Polystate Life rules have one dead state and ''n'' ≥ 2 live states; each live state, along with the shared dead state, evolves according to the rules of [[Conway's Game of Life]], independent of the remaining live states. In the event that a dead cell would get born in two or more different states simultaneously, it gets born in neither. | ||
Polystate Life rules were [[Boris Lejkin]] in April 2006.<ref name="dxdyru_thread2376" /><ref name="beluchenko_nstate" /> | Polystate Life rules were developed by [[Boris Lejkin]] in April 2006.<ref name="dxdyru_thread2376" /><ref name="beluchenko_nstate" /> | ||
==Description== | ==Description== | ||
| Line 13: | Line 13: | ||
## gets born in state ''m'' if there is exactly one state ''m'' such that it has exactly 3 neighbors in state ''m''; | ## gets born in state ''m'' if there is exactly one state ''m'' such that it has exactly 3 neighbors in state ''m''; | ||
## remains dead otherwise. | ## remains dead otherwise. | ||
==Software support== | |||
Polystate Life is supported in [[MCell]] using a custom DLL supplied by [[Nicolay Beluchenko]].<ref name="beluchenko_nstate" /> There is no native support for Polystate Life in [[Golly]], but custom rule tables can be used to run the Polystate Life family of rules. | |||
==Extensions== | ==Extensions== | ||
Polystate Life rules can be generalized to more general classes of [[cellular automata]], e.g. arbitrary ([[outer-totalistic]]) [[Life-like cellular automata]], [[isotropic]] or [[non-isotropic]] cellular automata, etc. They can also be adapted to different [[neighborhood]]s, and to different | Polystate Life rules can be generalized to more general classes of [[cellular automata]], e.g. arbitrary ([[outer-totalistic]]) [[Life-like cellular automata]], [[isotropic]] or [[non-isotropic]] cellular automata, etc. They can also be adapted to different [[neighborhood]]s, and to different tesselations of the underlying space. | ||
==Also see== | ==Also see== | ||
* [[Colourised Life]] | * [[Colourised Life]] | ||
* [[OCA:Brew]] | |||
==References== | ==References== | ||
| Line 27: | Line 31: | ||
|author = Nicolay Beluchenko | |author = Nicolay Beluchenko | ||
|accessdate = 2017-09-15 | |accessdate = 2017-09-15 | ||
|date = 2006-05-16 | |||
}}</ref> | }}</ref> | ||
<ref name="dxdyru_thread2376">{{Cite web | <ref name="dxdyru_thread2376">{{Cite web | ||
| Line 38: | Line 43: | ||
==External links== | ==External links== | ||
{{LinkForumThread|f=11|t=3078|title=Lejkin's Polystate Life}} | * {{LinkForumThread|f=11|t=3078|title=Lejkin's Polystate Life}} | ||
[[Category:Algorithms]] | [[Category:Algorithms]] | ||
[[Category:Cellular automata]] | [[Category:Cellular automata]] | ||
[[Category:Multistate rules]] | |||
__NOTOC__ | |||
Latest revision as of 11:19, 14 October 2023
The Polystate Life family of rules is a multistate generalization of Conway's Game of Life. Polystate Life rules have one dead state and n ≥ 2 live states; each live state, along with the shared dead state, evolves according to the rules of Conway's Game of Life, independent of the remaining live states. In the event that a dead cell would get born in two or more different states simultaneously, it gets born in neither.
Polystate Life rules were developed by Boris Lejkin in April 2006.[1][2]
Description
In n-state Life, patterns evolve according to the following rules:
- A live cell in state m:
- survives (remains live) if it has exactly 2 or 3 neighbors in state m;
- dies otherwise.
- A dead cell:
- gets born in state m if there is exactly one state m such that it has exactly 3 neighbors in state m;
- remains dead otherwise.
Software support
Polystate Life is supported in MCell using a custom DLL supplied by Nicolay Beluchenko.[2] There is no native support for Polystate Life in Golly, but custom rule tables can be used to run the Polystate Life family of rules.
Extensions
Polystate Life rules can be generalized to more general classes of cellular automata, e.g. arbitrary (outer-totalistic) Life-like cellular automata, isotropic or non-isotropic cellular automata, etc. They can also be adapted to different neighborhoods, and to different tesselations of the underlying space.
Also see
References
- ↑ Boris Lejkin (2006-04-25). "Такова "Жизнь"". Retrieved on 2017-09-15.
- ↑ 2.0 2.1 Nicolay Beluchenko (2006-05-16). "Polystate Life". Retrieved on 2017-09-15.
External links
- Lejkin's Polystate Life (discussion thread) at the ConwayLife.com forums