NaiveLife Emulated: A reading-order simulation of Life
Posted: May 24th, 2020, 9:46 pm
Named after a naive implementation of Conway's game of Life, where cells are simulated by reading-order rather than at the same time.
To use, make a border using state 5, and put a black state 2 cell above and to the left of the pattern.
If you put the state 2 cell close to the top left corner of a border, you get a repeatedly evolving pattern.
Alternatively, you could simulate borderless using the green state 4 instead.
As you can see, we used the first spaceship in NaiveLife as the sample pattern. It travels at c/2 diagonally Northeast.
Though, because of the agar's behavior, it's demoted to c/7 NE at the fastest.
Do note that you have to remove the top border, or the green state 4 cell, and wait until the waves pass through, before posting a pattern. This is to get the canonical version of the pattern. When the rule repeatedly evolves, the top left keeps moving forward while the bottom right trails behind in the past.
Code: Select all
@RULE NaiveLifeEmulated
@COLORS
0 48 48 48
1 255 255 255
2 0 0 0
3 160 160 160
4 0 255 0
5 255 0 0
@TABLE
n_states:6
neighborhood:Moore
symmetries:none
var a{0,1,2,3,4,5}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a
var A{2,3,4}
#spread
0 5,b,c,A,e,f,g,h 2
0 a,b,c,4,e,f,g,h 4
0 a,b,c,d,e,f,A,h 2
1 a,b,c,d,e,f,A,h 3
0 a,A,c,d,e,f,g,h 2
1 a,A,c,d,e,f,g,h 3
#evolve
#BS3
A 1,1,1,0,0,0,0,0 1
A 1,1,0,1,0,0,0,0 1
A 1,1,0,0,1,0,0,0 1
A 1,1,0,0,0,1,0,0 1
A 1,1,0,0,0,0,1,0 1
A 1,1,0,0,0,0,0,1 1
A 1,0,1,1,0,0,0,0 1
A 1,0,1,0,1,0,0,0 1
A 1,0,1,0,0,1,0,0 1
A 1,0,1,0,0,0,1,0 1
A 1,0,1,0,0,0,0,1 1
A 1,0,0,1,1,0,0,0 1
A 1,0,0,1,0,1,0,0 1
A 1,0,0,1,0,0,1,0 1
A 1,0,0,1,0,0,0,1 1
A 1,0,0,0,1,1,0,0 1
A 1,0,0,0,1,0,1,0 1
A 1,0,0,0,1,0,0,1 1
A 1,0,0,0,0,1,1,0 1
A 1,0,0,0,0,1,0,1 1
A 1,0,0,0,0,0,1,1 1
A 0,1,1,1,0,0,0,0 1
A 0,1,1,0,1,0,0,0 1
A 0,1,1,0,0,1,0,0 1
A 0,1,1,0,0,0,1,0 1
A 0,1,1,0,0,0,0,1 1
A 0,1,0,1,1,0,0,0 1
A 0,1,0,1,0,1,0,0 1
A 0,1,0,1,0,0,1,0 1
A 0,1,0,1,0,0,0,1 1
A 0,1,0,0,1,1,0,0 1
A 0,1,0,0,1,0,1,0 1
A 0,1,0,0,1,0,0,1 1
A 0,1,0,0,0,1,1,0 1
A 0,1,0,0,0,1,0,1 1
A 0,1,0,0,0,0,1,1 1
A 0,0,1,1,1,0,0,0 1
A 0,0,1,1,0,1,0,0 1
A 0,0,1,1,0,0,1,0 1
A 0,0,1,1,0,0,0,1 1
A 0,0,1,0,1,1,0,0 1
A 0,0,1,0,1,0,1,0 1
A 0,0,1,0,1,0,0,1 1
A 0,0,1,0,0,1,1,0 1
A 0,0,1,0,0,1,0,1 1
A 0,0,1,0,0,0,1,1 1
A 0,0,0,1,1,1,0,0 1
A 0,0,0,1,1,0,1,0 1
A 0,0,0,1,1,0,0,1 1
A 0,0,0,1,0,1,1,0 1
A 0,0,0,1,0,1,0,1 1
A 0,0,0,1,0,0,1,1 1
A 0,0,0,0,1,1,1,0 1
A 0,0,0,0,1,1,0,1 1
A 0,0,0,0,1,0,1,1 1
A 0,0,0,0,0,1,1,1 1
#S2
3 1,1,0,0,0,0,0,0 1
3 1,0,1,0,0,0,0,0 1
3 1,0,0,1,0,0,0,0 1
3 1,0,0,0,1,0,0,0 1
3 1,0,0,0,0,1,0,0 1
3 1,0,0,0,0,0,1,0 1
3 1,0,0,0,0,0,0,1 1
3 0,1,1,0,0,0,0,0 1
3 0,1,0,1,0,0,0,0 1
3 0,1,0,0,1,0,0,0 1
3 0,1,0,0,0,1,0,0 1
3 0,1,0,0,0,0,1,0 1
3 0,1,0,0,0,0,0,1 1
3 0,0,1,1,0,0,0,0 1
3 0,0,1,0,1,0,0,0 1
3 0,0,1,0,0,1,0,0 1
3 0,0,1,0,0,0,1,0 1
3 0,0,1,0,0,0,0,1 1
3 0,0,0,1,1,0,0,0 1
3 0,0,0,1,0,1,0,0 1
3 0,0,0,1,0,0,1,0 1
3 0,0,0,1,0,0,0,1 1
3 0,0,0,0,1,1,0,0 1
3 0,0,0,0,1,0,1,0 1
3 0,0,0,0,1,0,0,1 1
3 0,0,0,0,0,1,1,0 1
3 0,0,0,0,0,1,0,1 1
3 0,0,0,0,0,0,1,1 1
#death
A a,b,c,d,e,f,g,h 0
Code: Select all
x = 28, y = 23, rule = NaiveLifeEmulated
28E$E26.E$E26.E$E2.B23.E$E26.E$E26.E$E26.E$E26.E$E6.3A17.E$E6.A.A17.E
$E8.2A16.E$E9.A16.E$E26.E$E26.E$E26.E$E26.E$E26.E$E26.E$E26.E$E26.E$E
26.E$E26.E$28E!
Code: Select all
x = 28, y = 23, rule = NaiveLifeEmulated
28E$EB25.E$E26.E$E26.E$E26.E$E26.E$E26.E$E26.E$E6.3A17.E$E6.A.A17.E$E
8.2A16.E$E9.A16.E$E26.E$E26.E$E26.E$E26.E$E26.E$E26.E$E26.E$E26.E$E
26.E$E26.E$28E!
Code: Select all
x = 10, y = 8, rule = NaiveLifeEmulated
D4$6.3A$6.A.A$8.2A$9.A!
Though, because of the agar's behavior, it's demoted to c/7 NE at the fastest.
Do note that you have to remove the top border, or the green state 4 cell, and wait until the waves pass through, before posting a pattern. This is to get the canonical version of the pattern. When the rule repeatedly evolves, the top left keeps moving forward while the bottom right trails behind in the past.