Rule:TheLittleRuleThatCould

@RULE TheLittleRuleThatCould

@TREE

num_states=4 num_neighbors=8 num_nodes=41 1 0 0 0 0 2 0 0 0 0 1 2 0 1 0 2 0 2 0 0 3 1 3 1 1 1 3 1 1 2 2 2 5 2 2 3 3 6 3 3 4 4 7 4 4 1 0 1 0 0 2 5 9 5 5 3 6 10 6 6 4 7 11 7 7 5 8 12 8 8 1 1 1 0 0 2 9 14 9 9 3 10 15 10 10 4 11 16 11 11 5 12 17 12 12 6 13 18 13 13 1 1 0 0 0 2 14 20 14 14 3 15 21 15 15 4 16 22 16 16 5 17 23 17 17 6 18 24 18 18 7 19 25 19 19 2 20 0 20 20 3 21 27 21 21 4 22 28 22 22 5 23 29 23 23 6 24 30 24 24 7 25 31 25 25 8 26 32 26 26 3 27 1 27 27 4 28 34 28 28 5 29 35 29 29 6 30 36 30 30 7 31 37 31 31 8 32 38 32 32 9 33 39 33 33

@TABLE

n_states:4 neighborhood:Moore symmetries:permute

var u={0,2,3} var v=u var w=u var x=u var y=u var z=u var t={0,1,2,3} var a=t var b=t var c=t var d=t var e=t var f=t var g=t var h=t

0,1,1,u,v,w,x,y,z,2 2,1,1,u,v,w,x,y,z,1

0,1,1,1,v,w,x,y,z,3 3,1,1,1,v,w,x,y,z,2 2,1,1,1,v,w,x,y,z,1

0,1,1,1,1,1,t,y,z,1

1,1,1,1,t,a,x,y,z,1

3,a,b,c,d,e,f,g,h,0 2,a,b,c,d,e,f,g,h,0 1,a,b,c,d,e,f,g,h,0