I've made 17-state automata which represents my idea. Save as Expgrowth.table
Code: Select all
n_states:17
neighborhood:Moore
symmetries:none
var a={0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}
var b={a}
var c={a}
var d={a}
var e={a}
var f={a}
var g={a}
var h={a}
9,a,b,c,d,4,f,g,h,3
10,6,b,c,d,e,f,g,h,5
0,1,b,c,d,4,f,g,h,3
0,6,b,c,d,2,f,g,h,5
3,0,0,0,0,7,0,0,0,0
5,8,0,0,0,0,0,0,0,0
4,a,b,c,d,2,f,g,h,7
6,1,b,c,d,e,f,g,h,8
1,a,b,c,d,2,f,g,h,2
2,1,b,c,d,e,f,g,h,1
1,a,b,c,d,e,f,g,h,0
2,a,b,c,d,e,f,g,h,0
0,1,b,c,d,e,f,g,h,1
0,a,b,c,d,2,f,g,h,2
3,a,b,c,d,e,f,g,h,4
4,a,b,c,d,e,f,g,h,0
5,a,b,c,d,e,f,g,h,6
6,a,b,c,d,e,f,g,h,0
0,a,b,c,d,4,f,g,h,3
0,6,b,c,d,e,f,g,h,5
7,a,b,c,d,e,f,g,h,0
8,a,b,c,d,e,f,g,h,0
0,a,b,3,7,e,f,g,h,9
0,a,8,5,d,e,f,g,h,10
9,a,b,c,d,10,f,g,h,13
10,9,b,c,d,e,f,g,h,14
9,a,b,c,d,e,f,g,h,0
10,a,b,c,d,e,f,g,h,0
0,a,9,10,d,e,f,g,h,0
0,a,b,9,10,e,f,g,h,0
0,a,9,c,d,e,f,g,h,9
0,a,b,c,10,e,f,g,h,10
0,a,b,c,d,e,7,3,h,11
0,a,b,c,d,e,f,5,8,12
0,a,b,c,d,e,f,11,h,3
0,a,b,c,d,e,f,g,11,1
0,a,b,c,d,e,12,g,h,2
0,a,b,c,d,e,f,12,h,5
11,a,b,c,d,e,f,g,h,0
12,a,b,c,d,e,f,g,h,0
0,a,b,c,15,e,f,g,h,3
0,a,b,15,d,e,f,g,h,1
0,a,b,16,d,e,f,g,h,2
0,a,16,c,d,e,f,g,h,5
13,a,b,c,d,e,f,g,h,0
14,a,b,c,d,e,f,g,h,0
15,a,b,c,d,e,f,g,h,0
16,a,b,c,d,e,f,g,h,0
0,a,b,c,13,e,f,g,h,15
0,a,14,c,d,e,f,g,h,16
Rule table is not ideal, because some state 9 destroy state 4. It is clearly visible that pattern is a breeder, and number of engines grow (I think) like in my idea.
Now pattern should work, but I haven't tested that. But if we look Dr. Monstaa first post we can read that he means something different than my idea. If i understand that good, he means array of glider duplicators and something like this: first glider is hitting duplicators, and these two gliders fly away to two different duplicators, and they fly to another duplicators and again and again. This is possible in Life as far as there is finite number of duplicators. I will try to make something like that, but today I don't have enough time. Tomorrow I will try to do it