Difference between revisions of "OCA:Day & Night"

From LifeWiki
Jump to navigation Jump to search
(dead link)
Line 18: Line 18:
   | author = Pete Carlton
   | author = Pete Carlton
   | url = http://www.ocf.berkeley.edu/~pcarlton/CA.html
   | url = http://www.ocf.berkeley.edu/~pcarlton/CA.html
   | title = Pete's Game of Life Page: B3678 S34678}}
   | title = Pete's Game of Life Page: B3678 S34678}}[dead link]

Revision as of 22:29, 9 November 2015

Ambox notice.png Please do not move this page and its talk page until this system is updated by Nathaniel.

Zhuyifei1999 07:50, 11 March 2013 (CDT)

Day & Night
Day & Night rule
Rulestring 34678/3678
Character Stable

Day & Night is a Life-like cellular automaton in which cells survive from one generation to the next if they have 3, 6, 7, or 8 neighbours, and are born if they have 3, 4, 6, 7, or 8 neighbours. Day & Night is the most well-known self-complementary rule. That is, if all grid cells have their on/off state exchanged, the history of the pattern is the inverse of the history of the original. Nathan Thompson explored the rule starting in April, 1997, and David Bell discussed the rule in detail the following November.

External links