I developed a multicolor Life variant called “Domination”.
Rules:
Cells can be dead, dominant, or recessive.
A dead cell becomes recessive if it has five dead neighbors and three recessive neighbors.
A dead cell becomes dominant if it has five dead neighbors and at least one of its other neighbors is dominant.
A dominant cell stays dominant if it has exactly two or three living neighbors.
A recessive cell stays recessive if it has 2 or 3 living neighbors and all dominant cells around it will survive in the next generation.
A recessive cell can also stay recessive if it has 2 or 3 living neighbors and none of them are dominant.
A recessive cell becomes dominant if any of its neighbors is dominant and will not survive to the next generation.
Ruletable:
Code: Select all
@RULE Domination
@TABLE
n_states:7
neighborhood:Moore
symmetries:permute
var a={3,4,5,6}
var b=a
var c={4,5}
var d={0,1,2}
var e=d
var f=d
var g=d
var h=d
var i=d
var j=d
var k=d
var l={3,6}
var m=l
var n=l
var o={1,2}
var p=o
var q=p
var r={0,3,4,5,6}
var s=r
var t=r
var u=r
var v=r
var w=r
var x=r
var y=r
0,l,m,n,0,0,0,0,0,1
0,a,b,c,0,0,0,0,0,2
1,o,p,0,0,0,0,0,0,3
1,o,p,q,0,0,0,0,0,3
1,d,e,f,g,h,i,j,k,6
2,o,p,0,0,0,0,0,0,4
2,o,p,q,0,0,0,0,0,4
2,d,e,f,g,h,i,j,k,5
3,5,s,t,u,v,w,x,y,2
3,r,s,t,u,v,w,x,y,1
4,r,s,t,u,v,w,x,y,2
5,r,s,t,u,v,w,x,y,0
6,r,s,t,u,v,w,x,y,0
@COLORS
0 000 000 000
1 000 000 255
2 255 000 000
3 128 000 255
4 255 128 000
5 255 192 000
6 192 128 255
Note that this rule runs at half the speed of regular Life, because it requires knowing whether dominant cells survive or die in the next generation.
This rule is useful for determining necessary cells for catalysis. By reflecting dominant gliders using recessive Snarks, you can observe what parts of the Snark are essential to catalyze certain reactions:
Code:
Select all
x = 65, y = 65, rule = Domination
25.2A3.2A$25.2A2.A.3A$29.A4.A$25.4A.2A2.A$25.A2.A.A.A.2A$28.A.A.A.A$
29.2A.A.A$33.A2$19.2A$20.A7.2A$20.A.A5.2A$21.2A7$31.2A8.B13.A$31.A10.
B10.3A$32.3A5.3B9.A$20.2B12.A17.2A$19.B.B$21.B$60.2A.2A$61.A.2A$61.A$
53.2A4.3A$4.A48.2A3.A3.2A$2.5A14.2A35.4A2.A$.A5.A13.A22.2A15.A.2A$.A
2.3A12.A.A21.A.A12.3A2.A$2A.A15.2A22.A13.A5.A$A2.4A35.2A14.5A$.2A3.A
3.2A48.A$3.3A4.2A$3.A$2A.A$2A.2A$43.B$43.B.B$11.2A17.A12.2B$12.A9.3B
5.3A$9.3A10.B10.A$9.A13.B8.2A7$42.2A$35.2A5.A.A$35.2A7.A$44.2A2$31.A$
30.A.A.2A$30.A.A.A.A$29.2A.A.A.A2.A$30.A2.2A.4A$30.A4.A$31.3A.A2.2A$
33.2A3.2A!
[[ STEP 2 ]]
@RULE Domination
@TABLE
n_states:7
neighborhood:Moore
symmetries:permute
var a={3,4,5,6}
var b=a
var c={4,5}
var d={0,1,2}
var e=d
var f=d
var g=d
var h=d
var i=d
var j=d
var k=d
var l={3,6}
var m=l
var n=l
var o={1,2}
var p=o
var q=p
var r={0,3,4,5,6}
var s=r
var t=r
var u=r
var v=r
var w=r
var x=r
var y=r
0,l,m,n,0,0,0,0,0,1
0,a,b,c,0,0,0,0,0,2
1,o,p,0,0,0,0,0,0,3
1,o,p,q,0,0,0,0,0,3
1,d,e,f,g,h,i,j,k,6
2,o,p,0,0,0,0,0,0,4
2,o,p,q,0,0,0,0,0,4
2,d,e,f,g,h,i,j,k,5
3,5,s,t,u,v,w,x,y,2
3,r,s,t,u,v,w,x,y,1
4,r,s,t,u,v,w,x,y,2
5,r,s,t,u,v,w,x,y,0
6,r,s,t,u,v,w,x,y,0
@COLORS
0 000 000 000
1 000 000 255
2 255 000 000
3 128 000 255
4 255 128 000
5 255 192 000
6 192 128 255