Difference between revisions of "OCA:Day & Night"
Jump to navigation
Jump to search
Apple Bottom (talk | contribs) (LinkForumThread) |
Apple Bottom (talk | contribs) m (ruleinteger) |
||
| Line 5: | Line 5: | ||
|b = 3678 | |b = 3678 | ||
|s = 34678 | |s = 34678 | ||
|ruleinteger = 45256 | |||
}} | }} | ||
'''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 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. | ||
Revision as of 12:18, 18 February 2017
| Day & Night | |
| View static image | |
| Rulestring | 34678/3678 B3678/S34678 |
|---|---|
| Rule integer | 45256 |
| 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
- David I. Bell (1997). "Day & Night - An Interesting Variant of Life". See also Bell's Day & Night pattern archive.
- Pete Carlton. "Pete's Game of Life Page: B3678 S34678".
- Day & Night (B3678/S34678) (discussion thread) at the ConwayLife.com forums
- Day & Night at Wikipedia
Day & Night at Adam P. Goucher's Catagolue Day & Night at David Eppstein's Glider Database