Zxc
Posted: October 12th, 2013, 12:13 am
Here's a rule similar to Brian's Brain that can be used to construct stable circuitry and oscillators as well as guns and other such things:
Interactions with state 3 go like this (let's refer to the subject cell as C, refer to both states 1 and 2 as living, state 2 as 'sick', state 1 as 'healthy', and state 3 as 'zombie'):
- If the cell C is living and has one zombie neighbor, it becomes a zombie cell no matter what.
- If the cell C is not a zombie and has more than one zombie neighbor, it will permanently remain in that state. This means no birth or death around a zombie cell once it has appeared.
- If the cell C is sick and has 8 living neighbors, at least six of which are healthy, it will become a zombie.
Here is an example collection:
Why did I choose the name Zxc? Because on a QWERTY keyboard (like what I'm accustomed to) it is possible to type the rule name just by quickly sliding your finger from the shift key to C.
Code: Select all
@RULE Zxc
State 0 is dead
State 1 is live/on
State 2 is sick/half-on
State 3 is zombie (once created, no live cells will be born nearby)
@TABLE
n_states:4
neighborhood:Moore
symmetries:permute
var a={0,1,2}
var b={a}
var c={a}
var d={a}
var e={a}
var f={a}
var g={a}
var h={a}
var i={0,2}
var j={i}
var k={i}
var l={i}
var m={i}
var n={i}
var o={i}
var p={i}
var q={1,2}
var r={q}
var s={q}
var t={q}
# birth
# 0,1,i,j,k,l,m,n,o,1
0,1,1,j,k,l,m,n,o,1
# 0,1,1,1,k,l,m,n,o,1
# 0,1,1,1,1,l,m,n,o,1
# 0,1,1,1,1,1,m,n,o,1
# 0,1,1,1,1,1,1,n,o,1
# 0,1,1,1,1,1,1,1,o,1
# 0,1,1,1,1,1,1,1,1,1
# recovery
# 2,i,j,k,l,m,n,o,p,1
# 2,q,j,k,l,m,n,o,p,1
# 2,q,1,k,l,m,n,o,p,1
# 2,q,r,1,l,m,n,o,p,1
# 2,q,r,1,1,m,n,o,p,1
# 2,q,r,s,1,1,n,o,p,1
# 2,q,r,s,1,1,1,o,p,1
# 2,q,r,s,t,1,1,1,p,1
2,q,r,s,t,1,1,1,1,1
# zombification of sick
# 2,i,j,k,l,m,n,o,p,3
# 2,1,j,k,l,m,n,o,p,3
# 2,1,1,k,l,m,n,o,p,3
# 2,1,1,1,l,m,n,o,p,3
# 2,1,1,1,1,m,n,o,p,3
# 2,1,1,1,1,1,n,o,p,3
2,1,1,1,1,1,1,o,p,3
# 2,1,1,1,1,1,1,1,p,3
# 2,1,1,1,1,1,1,1,1,3
# zombification of infected
q,3,a,b,c,d,e,f,g,3
# live to sick
1,a,b,c,d,e,f,g,h,2
# otherwise sick die
2,a,b,c,d,e,f,g,h,0
@COLORS
1 255 0 0 r
2 255 255 0 y
3 192 0 192 p
- If the cell C is living and has one zombie neighbor, it becomes a zombie cell no matter what.
- If the cell C is not a zombie and has more than one zombie neighbor, it will permanently remain in that state. This means no birth or death around a zombie cell once it has appeared.
- If the cell C is sick and has 8 living neighbors, at least six of which are healthy, it will become a zombie.
Here is an example collection:
Code: Select all
x = 171, y = 125, rule = Zxc
99.C4.C$105.C2.C$109.2C$98.CA10.AC$98.C4.A2.A$98.C3.A4C5.C$98.CA2.C3.
CA3.2A$99.C6.C5.C$106.C3.AC$102.AC2.CA2.2C$74.BA22.BA3.C2.C$74.BA22.B
A3.C2.C$102.A4CA$103.A2.A3$152.C$149.CA$149.C$149.C$148.2CA6.C$149.A
8.2C$159.AC$152.A2.A$151.A4C5.C$152.C2.CA3.2A$155.C5.C$155.C3.AC$155.
CA2.C.CAC$155.C4.C.A2.C$155.C3.CA4.AC$154.2CA9.C$155.A11.C$159.A2.A5.
C$158.A5CA$154.BA3.C3.C$154.BA3.C3.C$158.A5CA$159.A2.A5.C$155.A11.C$
57.AC95.2CA9.C$58.C96.C3.CA4.AC$58.C96.C4.C.A2.C$57.AC96.CA2.C.CAC$
58.C9.C86.C3.AC$58.C8.AC86.C5.C$57.AC93.C2.CA3.2A$58.C4.CA86.A4C5.C$
58.C4.C88.A2.A$57.AC4.C3.C91.AC$3.C54.A5CA84.A8.2C$59.A2.A85.2CA6.C$C
A56.BA7.C81.C$CA64.C82.C$59.CA4.AC82.CA$3.C14.AC39.2C.A2.C86.C$19.C
41.CAC3$18.C2$106.C$11.CA$11.C91.CA$103.CA$14.A2.A133.2C$14.4C88.C14.
AC29.A$122.C35.C2$150.CA$121.C28.CA2$158.C$114.CA36.A$114.C36.2C2$
117.A2.A$117.4C10$151.2C$152.A$156.C2$150.CA$150.CA2$156.C$152.A$151.
2C7$152.2C$152.2A3$152.AC$152.2C8$143.C22.C$141.2CA2C18.2CA2C$139.C2.
A.2A19.A.2A$138.C4$147.C$170.C!