Rule:DoubleB3S23

@RULE DoubleB3S23 @TABLE

n_states:4 neighborhood:Moore symmetries:permute

1. 0x01 bit ON

var a={1,3} var aa=a var ab=a var ac=a var ad=a var ae=a var af=a var ag=a

1. 0x01 bit OFF

var b={0,2} var ba=b var bb=b var bc=b var bd=b var be=b var bf=b var bg=b

1. 0x10 bit ON

var c={2,3} var ca=c var cb=c var cc=c var cd=c var ce=c var cf=c var cg=c

1. 0x10 bit OFF

var d={0,1} var da=d var db=d var dc=d var dd=d var de=d var df=d var dg=d

1. don't-care cells

var x={0,1,2,3} var xa=x var xb=x var xc=x var xd=x var xe=x var xf=x var xg=x var xh=x

1. birth for both 0x01 and 0x10 bits

x,1,1,1,2,2,2,0,0,3 x,1,1,3,2,2,0,0,0,3 x,1,3,3,2,0,0,0,0,3 x,3,3,3,0,0,0,0,0,3

1. survival for 0x01 bit, birth for 0x10 bit

1,2,2,2,1,1,0,0,0,3 1,2,2,3,1,0,0,0,0,3 1,2,3,3,0,0,0,0,0,3

1. birth for 0x01 bit, survival for 0x10 bit

2,1,1,1,2,2,0,0,0,3 2,1,1,3,2,0,0,0,0,3 2,1,3,3,0,0,0,0,0,3

1. 2-neighbor survival for 0x01 bit, 3-neighbor survival for 0x10 bit

3,1,1,2,2,2,0,0,0,3 3,1,3,2,2,0,0,0,0,3 3,3,3,2,0,0,0,0,0,3

1. 3-neighbor survival for 0x01 bit, 2-neighbor survival for 0x10 bit

3,1,1,1,2,2,0,0,0,3 3,1,1,3,2,0,0,0,0,3 3,1,3,3,0,0,0,0,0,3

1. 2-neighbor survival for both 0x01 and 0x10 bits

3,1,1,2,2,0,0,0,0,3 3,1,3,2,0,0,0,0,0,3 3,3,3,0,0,0,0,0,0,3

1. birth for 0x01 bit, death for 0x10 bit

x,a,aa,ab,ba,bb,bc,bd,be,1 x,a,aa,ab,ba,bb,bc,bd,be,1 1,a,aa,ba,bb,bc,bd,be,bf,1 3,a,aa,ba,bb,bc,bd,be,bf,1

1. death for 0x01 bit, birth for 0x10 bit

x,c,ca,cb,da,db,dc,dd,de,2 x,c,ca,cb,da,db,dc,dd,de,2 2,c,ca,da,db,dc,dd,de,df,2 3,c,ca,da,db,dc,dd,de,df,2

1. death for both bits

x,xa,xb,xc,xd,xe,xf,xg,xh,0

@COLORS

0 0 0 0 1 255 0 0 2 0 255 0 3 255 255 255