LifeWiki - User contributions [en]

Rule:DN-y4z

2025-04-10T03:46:01Z

Yoel:

@RULE DN-y4z
# By Yoel Matveyev, 2025
# A non-reflective version of Day & Night modified as follows:

# 0 0 1 ? ? ?
# 1 0 1 ==> ? 0 ?
# 1 0 0 ? ? ?

# 1 1 0 ? ? ?
# 0 0 0 ==> ? 0 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 0 1 ==> ? 1 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 0 0 ==> ? 1 ?
# 1 1 0 ? ? ?

# 0 0 1 ? ? ?
# 1 1 1 ==> ? 1 ?
# 1 1 0 ? ? ?

# 1 1 0 ? ? ?
# 0 1 0 ==> ? 1 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 1 1 ==> ? 0 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 1 0 ==> ? 0 ?
# 1 1 0 ? ? ?

# It has rotational symmetry, but lacks reflection symmetry. As this rule is declared anisotropic, one can tweak it any non-symmetrical way.

@COLORS
1 255 255 255
@TABLE
n_states:2
neighborhood:Moore
symmetries:none
var A={0,1}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A
# Birth conditions
0,1,0,0,0,0,0,1,1,1
0,1,1,1,0,0,0,0,0,1
0,0,0,1,1,1,0,0,0,1
0,0,0,0,0,1,1,1,0,1
0,0,0,0,1,0,1,0,1,1
0,0,1,0,0,0,1,0,1,1
0,0,1,0,1,0,0,0,1,1
0,0,1,0,1,0,1,0,0,1
0,1,0,0,0,1,0,1,0,1
0,1,0,1,0,0,0,1,0,1
0,1,0,1,0,1,0,0,0,1
0,0,0,1,0,1,0,1,0,1
0,0,0,0,0,0,1,1,1,1
0,1,1,0,0,0,0,0,1,1
0,0,1,1,1,0,0,0,0,1
0,0,0,0,1,1,1,0,0,1
0,1,0,1,1,0,0,0,0,1
0,0,0,1,0,1,1,0,0,1
0,0,0,0,0,1,0,1,1,1
0,1,1,0,0,0,0,1,0,1
0,1,0,0,0,0,1,1,0,1
0,1,0,1,0,0,0,0,1,1
0,0,1,1,0,1,0,0,0,1
0,0,0,0,1,1,0,1,0,1
0,1,0,0,1,0,0,1,0,1
0,1,0,1,0,0,1,0,0,1
0,0,0,1,0,1,0,0,1,1
0,0,1,0,0,1,0,1,0,1
0,1,1,0,1,0,0,0,0,1
0,0,0,1,1,0,1,0,0,1
0,0,0,0,0,1,1,0,1,1
0,0,1,0,0,0,0,1,1,1
0,1,0,0,0,0,1,0,1,1
0,0,1,1,0,0,0,0,1,1
0,0,1,0,1,1,0,0,0,1
0,0,0,0,1,0,1,1,0,1
0,1,1,0,0,0,1,0,0,1
0,0,0,1,1,0,0,0,1,1
0,0,1,0,0,1,1,0,0,1
0,0,0,0,1,0,0,1,1,1
0,1,0,0,1,0,0,0,1,1
0,0,1,1,0,0,1,0,0,1
0,0,0,0,1,1,0,0,1,1
0,0,1,0,0,0,1,1,0,1
0,1,1,0,0,1,0,0,0,1
0,0,0,1,1,0,0,1,0,1
0,1,0,0,0,1,1,0,0,1
0,0,0,1,0,0,0,1,1,1
0,1,0,0,0,1,0,0,1,1
0,0,1,1,0,0,0,1,0,1
0,1,0,0,1,1,0,0,0,1
0,0,0,1,0,0,1,1,0,1
0,1,0,0,1,0,1,0,0,1
0,0,0,1,0,0,1,0,1,1
0,0,1,0,0,1,0,0,1,1
0,0,1,0,1,0,0,1,0,1

# Adding non-reflective B4z

0,1,1,0,0,1,1,0,0,1
0,0,0,1,1,0,0,1,1,1

0,1,1,1,1,1,1,0,0,1
0,0,0,1,1,1,1,1,1,1
0,1,1,0,0,1,1,1,1,1
0,1,1,1,1,0,0,1,1,1
0,1,0,0,1,1,1,1,1,1
0,1,1,1,0,0,1,1,1,1
0,1,1,1,1,1,0,0,1,1
0,0,1,1,1,1,1,1,0,1
0,1,0,1,1,1,1,1,0,1
0,1,0,1,0,1,1,1,1,1
0,1,1,1,0,1,0,1,1,1
0,1,1,1,1,1,0,1,0,1
0,0,1,0,1,1,1,1,1,1
0,1,1,0,1,0,1,1,1,1
0,1,1,1,1,0,1,0,1,1
0,0,1,1,1,1,1,0,1,1
0,0,1,1,1,0,1,1,1,1
0,1,1,0,1,1,1,0,1,1
0,1,1,1,1,0,1,1,0,1
0,1,0,1,1,1,1,0,1,1
0,0,1,1,0,1,1,1,1,1
0,1,1,0,1,1,0,1,1,1
0,1,0,1,1,0,1,1,1,1
0,1,1,1,0,1,1,0,1,1
0,0,1,1,1,1,0,1,1,1
0,1,1,0,1,1,1,1,0,1
0,1,0,1,1,1,0,1,1,1
0,1,1,1,0,1,1,1,0,1
0,1,0,1,1,1,1,1,1,1
0,1,1,1,0,1,1,1,1,1
0,1,1,1,1,1,0,1,1,1
0,1,1,1,1,1,1,1,0,1
0,0,1,1,1,1,1,1,1,1
0,1,1,0,1,1,1,1,1,1
0,1,1,1,1,0,1,1,1,1
0,1,1,1,1,1,1,0,1,1
0,1,1,1,1,1,1,1,1,1
# Survival conditions
1,1,0,0,0,0,0,1,1,1
1,1,1,1,0,0,0,0,0,1
1,0,0,1,1,1,0,0,0,1
1,0,0,0,0,1,1,1,0,1
1,0,0,0,1,0,1,0,1,1
1,0,1,0,0,0,1,0,1,1
1,0,1,0,1,0,0,0,1,1
1,0,1,0,1,0,1,0,0,1
1,1,0,0,0,1,0,1,0,1
1,1,0,1,0,0,0,1,0,1
1,1,0,1,0,1,0,0,0,1
1,0,0,1,0,1,0,1,0,1
1,0,0,0,0,0,1,1,1,1
1,1,1,0,0,0,0,0,1,1
1,0,1,1,1,0,0,0,0,1
1,0,0,0,1,1,1,0,0,1
1,1,0,1,1,0,0,0,0,1
1,0,0,1,0,1,1,0,0,1
1,0,0,0,0,1,0,1,1,1
1,1,1,0,0,0,0,1,0,1
1,1,0,0,0,0,1,1,0,1
1,1,0,1,0,0,0,0,1,1
1,0,1,1,0,1,0,0,0,1
1,0,0,0,1,1,0,1,0,1
1,1,0,0,1,0,0,1,0,1
1,1,0,1,0,0,1,0,0,1
1,0,0,1,0,1,0,0,1,1
1,0,1,0,0,1,0,1,0,1
1,1,1,0,1,0,0,0,0,1
1,0,0,1,1,0,1,0,0,1
1,0,0,0,0,1,1,0,1,1
1,0,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,0,1,1
1,0,1,1,0,0,0,0,1,1
1,0,1,0,1,1,0,0,0,1
1,0,0,0,1,0,1,1,0,1
1,1,1,0,0,0,1,0,0,1
1,0,0,1,1,0,0,0,1,1
1,0,1,0,0,1,1,0,0,1
1,0,0,0,1,0,0,1,1,1
1,1,0,0,1,0,0,0,1,1
1,0,1,1,0,0,1,0,0,1
1,0,0,0,1,1,0,0,1,1
1,0,1,0,0,0,1,1,0,1
1,1,1,0,0,1,0,0,0,1
1,0,0,1,1,0,0,1,0,1
1,1,0,0,0,1,1,0,0,1
1,0,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,0,1,1
1,0,1,1,0,0,0,1,0,1
1,1,0,0,1,1,0,0,0,1
1,0,0,1,0,0,1,1,0,1
1,1,0,0,1,0,1,0,0,1
1,0,0,1,0,0,1,0,1,1
1,0,1,0,0,1,0,0,1,1
1,0,1,0,1,0,0,1,0,1
1,1,1,1,1,0,0,0,0,1
1,0,0,1,1,1,1,0,0,1
1,0,0,0,0,1,1,1,1,1
1,1,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,1,1,1
1,1,1,1,0,0,0,0,1,1
1,0,1,1,1,1,0,0,0,1
1,0,0,0,1,1,1,1,0,1
1,0,1,0,1,0,1,0,1,1
1,1,0,1,0,1,0,1,0,1
1,0,1,1,0,0,0,1,1,1
1,1,1,0,1,1,0,0,0,1
1,0,0,1,1,0,1,1,0,1
1,1,0,0,0,1,1,0,1,1
1,0,1,1,0,1,0,1,0,1
1,1,0,0,1,1,0,1,0,1
1,1,0,1,0,0,1,1,0,1
1,1,0,1,0,1,0,0,1,1
1,0,0,1,0,1,0,1,1,1
1,1,1,0,0,1,0,1,0,1
1,1,0,1,1,0,0,1,0,1
1,1,0,1,0,1,1,0,0,1
1,1,1,0,1,0,0,1,0,1
1,1,0,1,1,0,1,0,0,1
1,0,0,1,0,1,1,0,1,1
1,0,1,0,0,1,0,1,1,1
1,1,0,1,0,0,1,0,1,1
1,0,1,1,0,1,0,0,1,1
1,0,1,0,1,1,0,1,0,1
1,1,0,0,1,0,1,1,0,1
1,0,1,1,1,0,0,0,1,1
1,0,1,0,1,1,1,0,0,1
1,0,0,0,1,0,1,1,1,1
1,1,1,0,0,0,1,0,1,1
1,0,1,0,0,0,1,1,1,1
1,1,1,0,1,0,0,0,1,1
1,0,1,1,1,0,1,0,0,1
1,0,0,0,1,1,1,0,1,1
1,1,0,0,1,0,0,1,1,1
1,1,1,1,0,0,1,0,0,1
1,0,0,1,1,1,0,0,1,1
1,0,1,0,0,1,1,1,0,1
1,1,1,1,0,1,0,0,0,1
1,0,0,1,1,1,0,1,0,1
1,1,0,0,0,1,1,1,0,1
1,1,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,1,1,1
1,1,1,1,0,0,0,1,0,1
1,1,0,1,1,1,0,0,0,1
1,0,0,1,0,1,1,1,0,1
1,1,0,0,1,1,1,0,0,1
1,0,0,1,0,0,1,1,1,1
1,1,1,0,0,1,0,0,1,1
1,0,1,1,1,0,0,1,0,1
1,1,0,1,1,0,0,0,1,1
1,0,1,1,0,1,1,0,0,1
1,0,0,0,1,1,0,1,1,1
1,1,1,0,0,0,1,1,0,1
1,1,1,0,1,0,1,0,0,1
1,0,0,1,1,0,1,0,1,1
1,0,1,0,0,1,1,0,1,1
1,0,1,0,1,0,0,1,1,1
1,1,0,0,1,0,1,0,1,1
1,0,1,1,0,0,1,0,1,1
1,0,1,0,1,1,0,0,1,1
1,0,1,0,1,0,1,1,0,1

# Making S4z non-reflective

1,1,0,0,1,1,0,0,1,1
1,0,1,1,0,0,1,1,0,1

1,1,1,1,1,1,1,0,0,1
1,0,0,1,1,1,1,1,1,1
1,1,1,0,0,1,1,1,1,1
1,1,1,1,1,0,0,1,1,1
1,1,0,0,1,1,1,1,1,1
1,1,1,1,0,0,1,1,1,1
1,1,1,1,1,1,0,0,1,1
1,0,1,1,1,1,1,1,0,1
1,1,0,1,1,1,1,1,0,1
1,1,0,1,0,1,1,1,1,1
1,1,1,1,0,1,0,1,1,1
1,1,1,1,1,1,0,1,0,1
1,0,1,0,1,1,1,1,1,1
1,1,1,0,1,0,1,1,1,1
1,1,1,1,1,0,1,0,1,1
1,0,1,1,1,1,1,0,1,1
1,0,1,1,1,0,1,1,1,1
1,1,1,0,1,1,1,0,1,1
1,1,1,1,1,0,1,1,0,1
1,1,0,1,1,1,1,0,1,1
1,0,1,1,0,1,1,1,1,1
1,1,1,0,1,1,0,1,1,1
1,1,0,1,1,0,1,1,1,1
1,1,1,1,0,1,1,0,1,1
1,0,1,1,1,1,0,1,1,1
1,1,1,0,1,1,1,1,0,1
1,1,0,1,1,1,0,1,1,1
1,1,1,1,0,1,1,1,0,1
1,1,0,1,1,1,1,1,1,1
1,1,1,1,0,1,1,1,1,1
1,1,1,1,1,1,0,1,1,1
1,1,1,1,1,1,1,1,0,1
1,0,1,1,1,1,1,1,1,1
1,1,1,0,1,1,1,1,1,1
1,1,1,1,1,0,1,1,1,1
1,1,1,1,1,1,1,0,1,1
1,1,1,1,1,1,1,1,1,1
1,A,B,C,D,E,F,G,H,0

Rule:DN-y4z

2025-04-10T03:39:19Z

Yoel:

@RULE DN-x4z
# By Yoel Matveyev, 2025
# A non-reflective version of Day & Night modified as follows:

# 0 0 1 ? ? ?
# 1 0 1 ==> ? 0 ?
# 1 0 0 ? ? ?

# 1 1 0 ? ? ?
# 0 0 0 ==> ? 0 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 0 1 ==> ? 1 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 0 0 ==> ? 1 ?
# 1 1 0 ? ? ?

# 0 0 1 ? ? ?
# 1 1 1 ==> ? 1 ?
# 1 1 0 ? ? ?

# 1 1 0 ? ? ?
# 0 1 0 ==> ? 1 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 1 1 ==> ? 0 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 1 0 ==> ? 0 ?
# 1 1 0 ? ? ?

# It has rotational symmetry, but lacks reflection symmetry. As this rule is declared anisotropic, one can tweak it any non-symmetrical way.

@COLORS
1 255 255 255
@TABLE
n_states:2
neighborhood:Moore
symmetries:none
var A={0,1}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A
# Birth conditions
0,1,0,0,0,0,0,1,1,1
0,1,1,1,0,0,0,0,0,1
0,0,0,1,1,1,0,0,0,1
0,0,0,0,0,1,1,1,0,1
0,0,0,0,1,0,1,0,1,1
0,0,1,0,0,0,1,0,1,1
0,0,1,0,1,0,0,0,1,1
0,0,1,0,1,0,1,0,0,1
0,1,0,0,0,1,0,1,0,1
0,1,0,1,0,0,0,1,0,1
0,1,0,1,0,1,0,0,0,1
0,0,0,1,0,1,0,1,0,1
0,0,0,0,0,0,1,1,1,1
0,1,1,0,0,0,0,0,1,1
0,0,1,1,1,0,0,0,0,1
0,0,0,0,1,1,1,0,0,1
0,1,0,1,1,0,0,0,0,1
0,0,0,1,0,1,1,0,0,1
0,0,0,0,0,1,0,1,1,1
0,1,1,0,0,0,0,1,0,1
0,1,0,0,0,0,1,1,0,1
0,1,0,1,0,0,0,0,1,1
0,0,1,1,0,1,0,0,0,1
0,0,0,0,1,1,0,1,0,1
0,1,0,0,1,0,0,1,0,1
0,1,0,1,0,0,1,0,0,1
0,0,0,1,0,1,0,0,1,1
0,0,1,0,0,1,0,1,0,1
0,1,1,0,1,0,0,0,0,1
0,0,0,1,1,0,1,0,0,1
0,0,0,0,0,1,1,0,1,1
0,0,1,0,0,0,0,1,1,1
0,1,0,0,0,0,1,0,1,1
0,0,1,1,0,0,0,0,1,1
0,0,1,0,1,1,0,0,0,1
0,0,0,0,1,0,1,1,0,1
0,1,1,0,0,0,1,0,0,1
0,0,0,1,1,0,0,0,1,1
0,0,1,0,0,1,1,0,0,1
0,0,0,0,1,0,0,1,1,1
0,1,0,0,1,0,0,0,1,1
0,0,1,1,0,0,1,0,0,1
0,0,0,0,1,1,0,0,1,1
0,0,1,0,0,0,1,1,0,1
0,1,1,0,0,1,0,0,0,1
0,0,0,1,1,0,0,1,0,1
0,1,0,0,0,1,1,0,0,1
0,0,0,1,0,0,0,1,1,1
0,1,0,0,0,1,0,0,1,1
0,0,1,1,0,0,0,1,0,1
0,1,0,0,1,1,0,0,0,1
0,0,0,1,0,0,1,1,0,1
0,1,0,0,1,0,1,0,0,1
0,0,0,1,0,0,1,0,1,1
0,0,1,0,0,1,0,0,1,1
0,0,1,0,1,0,0,1,0,1

# Adding non-reflective B4z

0,1,1,0,0,1,1,0,0,1
0,0,0,1,1,0,0,1,1,1

0,1,1,1,1,1,1,0,0,1
0,0,0,1,1,1,1,1,1,1
0,1,1,0,0,1,1,1,1,1
0,1,1,1,1,0,0,1,1,1
0,1,0,0,1,1,1,1,1,1
0,1,1,1,0,0,1,1,1,1
0,1,1,1,1,1,0,0,1,1
0,0,1,1,1,1,1,1,0,1
0,1,0,1,1,1,1,1,0,1
0,1,0,1,0,1,1,1,1,1
0,1,1,1,0,1,0,1,1,1
0,1,1,1,1,1,0,1,0,1
0,0,1,0,1,1,1,1,1,1
0,1,1,0,1,0,1,1,1,1
0,1,1,1,1,0,1,0,1,1
0,0,1,1,1,1,1,0,1,1
0,0,1,1,1,0,1,1,1,1
0,1,1,0,1,1,1,0,1,1
0,1,1,1,1,0,1,1,0,1
0,1,0,1,1,1,1,0,1,1
0,0,1,1,0,1,1,1,1,1
0,1,1,0,1,1,0,1,1,1
0,1,0,1,1,0,1,1,1,1
0,1,1,1,0,1,1,0,1,1
0,0,1,1,1,1,0,1,1,1
0,1,1,0,1,1,1,1,0,1
0,1,0,1,1,1,0,1,1,1
0,1,1,1,0,1,1,1,0,1
0,1,0,1,1,1,1,1,1,1
0,1,1,1,0,1,1,1,1,1
0,1,1,1,1,1,0,1,1,1
0,1,1,1,1,1,1,1,0,1
0,0,1,1,1,1,1,1,1,1
0,1,1,0,1,1,1,1,1,1
0,1,1,1,1,0,1,1,1,1
0,1,1,1,1,1,1,0,1,1
0,1,1,1,1,1,1,1,1,1
# Survival conditions
1,1,0,0,0,0,0,1,1,1
1,1,1,1,0,0,0,0,0,1
1,0,0,1,1,1,0,0,0,1
1,0,0,0,0,1,1,1,0,1
1,0,0,0,1,0,1,0,1,1
1,0,1,0,0,0,1,0,1,1
1,0,1,0,1,0,0,0,1,1
1,0,1,0,1,0,1,0,0,1
1,1,0,0,0,1,0,1,0,1
1,1,0,1,0,0,0,1,0,1
1,1,0,1,0,1,0,0,0,1
1,0,0,1,0,1,0,1,0,1
1,0,0,0,0,0,1,1,1,1
1,1,1,0,0,0,0,0,1,1
1,0,1,1,1,0,0,0,0,1
1,0,0,0,1,1,1,0,0,1
1,1,0,1,1,0,0,0,0,1
1,0,0,1,0,1,1,0,0,1
1,0,0,0,0,1,0,1,1,1
1,1,1,0,0,0,0,1,0,1
1,1,0,0,0,0,1,1,0,1
1,1,0,1,0,0,0,0,1,1
1,0,1,1,0,1,0,0,0,1
1,0,0,0,1,1,0,1,0,1
1,1,0,0,1,0,0,1,0,1
1,1,0,1,0,0,1,0,0,1
1,0,0,1,0,1,0,0,1,1
1,0,1,0,0,1,0,1,0,1
1,1,1,0,1,0,0,0,0,1
1,0,0,1,1,0,1,0,0,1
1,0,0,0,0,1,1,0,1,1
1,0,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,0,1,1
1,0,1,1,0,0,0,0,1,1
1,0,1,0,1,1,0,0,0,1
1,0,0,0,1,0,1,1,0,1
1,1,1,0,0,0,1,0,0,1
1,0,0,1,1,0,0,0,1,1
1,0,1,0,0,1,1,0,0,1
1,0,0,0,1,0,0,1,1,1
1,1,0,0,1,0,0,0,1,1
1,0,1,1,0,0,1,0,0,1
1,0,0,0,1,1,0,0,1,1
1,0,1,0,0,0,1,1,0,1
1,1,1,0,0,1,0,0,0,1
1,0,0,1,1,0,0,1,0,1
1,1,0,0,0,1,1,0,0,1
1,0,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,0,1,1
1,0,1,1,0,0,0,1,0,1
1,1,0,0,1,1,0,0,0,1
1,0,0,1,0,0,1,1,0,1
1,1,0,0,1,0,1,0,0,1
1,0,0,1,0,0,1,0,1,1
1,0,1,0,0,1,0,0,1,1
1,0,1,0,1,0,0,1,0,1
1,1,1,1,1,0,0,0,0,1
1,0,0,1,1,1,1,0,0,1
1,0,0,0,0,1,1,1,1,1
1,1,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,1,1,1
1,1,1,1,0,0,0,0,1,1
1,0,1,1,1,1,0,0,0,1
1,0,0,0,1,1,1,1,0,1
1,0,1,0,1,0,1,0,1,1
1,1,0,1,0,1,0,1,0,1
1,0,1,1,0,0,0,1,1,1
1,1,1,0,1,1,0,0,0,1
1,0,0,1,1,0,1,1,0,1
1,1,0,0,0,1,1,0,1,1
1,0,1,1,0,1,0,1,0,1
1,1,0,0,1,1,0,1,0,1
1,1,0,1,0,0,1,1,0,1
1,1,0,1,0,1,0,0,1,1
1,0,0,1,0,1,0,1,1,1
1,1,1,0,0,1,0,1,0,1
1,1,0,1,1,0,0,1,0,1
1,1,0,1,0,1,1,0,0,1
1,1,1,0,1,0,0,1,0,1
1,1,0,1,1,0,1,0,0,1
1,0,0,1,0,1,1,0,1,1
1,0,1,0,0,1,0,1,1,1
1,1,0,1,0,0,1,0,1,1
1,0,1,1,0,1,0,0,1,1
1,0,1,0,1,1,0,1,0,1
1,1,0,0,1,0,1,1,0,1
1,0,1,1,1,0,0,0,1,1
1,0,1,0,1,1,1,0,0,1
1,0,0,0,1,0,1,1,1,1
1,1,1,0,0,0,1,0,1,1
1,0,1,0,0,0,1,1,1,1
1,1,1,0,1,0,0,0,1,1
1,0,1,1,1,0,1,0,0,1
1,0,0,0,1,1,1,0,1,1
1,1,0,0,1,0,0,1,1,1
1,1,1,1,0,0,1,0,0,1
1,0,0,1,1,1,0,0,1,1
1,0,1,0,0,1,1,1,0,1
1,1,1,1,0,1,0,0,0,1
1,0,0,1,1,1,0,1,0,1
1,1,0,0,0,1,1,1,0,1
1,1,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,1,1,1
1,1,1,1,0,0,0,1,0,1
1,1,0,1,1,1,0,0,0,1
1,0,0,1,0,1,1,1,0,1
1,1,0,0,1,1,1,0,0,1
1,0,0,1,0,0,1,1,1,1
1,1,1,0,0,1,0,0,1,1
1,0,1,1,1,0,0,1,0,1
1,1,0,1,1,0,0,0,1,1
1,0,1,1,0,1,1,0,0,1
1,0,0,0,1,1,0,1,1,1
1,1,1,0,0,0,1,1,0,1
1,1,1,0,1,0,1,0,0,1
1,0,0,1,1,0,1,0,1,1
1,0,1,0,0,1,1,0,1,1
1,0,1,0,1,0,0,1,1,1
1,1,0,0,1,0,1,0,1,1
1,0,1,1,0,0,1,0,1,1
1,0,1,0,1,1,0,0,1,1
1,0,1,0,1,0,1,1,0,1

# Making S4z non-reflective

1,1,0,0,1,1,0,0,1,1
1,0,1,1,0,0,1,1,0,1

1,1,1,1,1,1,1,0,0,1
1,0,0,1,1,1,1,1,1,1
1,1,1,0,0,1,1,1,1,1
1,1,1,1,1,0,0,1,1,1
1,1,0,0,1,1,1,1,1,1
1,1,1,1,0,0,1,1,1,1
1,1,1,1,1,1,0,0,1,1
1,0,1,1,1,1,1,1,0,1
1,1,0,1,1,1,1,1,0,1
1,1,0,1,0,1,1,1,1,1
1,1,1,1,0,1,0,1,1,1
1,1,1,1,1,1,0,1,0,1
1,0,1,0,1,1,1,1,1,1
1,1,1,0,1,0,1,1,1,1
1,1,1,1,1,0,1,0,1,1
1,0,1,1,1,1,1,0,1,1
1,0,1,1,1,0,1,1,1,1
1,1,1,0,1,1,1,0,1,1
1,1,1,1,1,0,1,1,0,1
1,1,0,1,1,1,1,0,1,1
1,0,1,1,0,1,1,1,1,1
1,1,1,0,1,1,0,1,1,1
1,1,0,1,1,0,1,1,1,1
1,1,1,1,0,1,1,0,1,1
1,0,1,1,1,1,0,1,1,1
1,1,1,0,1,1,1,1,0,1
1,1,0,1,1,1,0,1,1,1
1,1,1,1,0,1,1,1,0,1
1,1,0,1,1,1,1,1,1,1
1,1,1,1,0,1,1,1,1,1
1,1,1,1,1,1,0,1,1,1
1,1,1,1,1,1,1,1,0,1
1,0,1,1,1,1,1,1,1,1
1,1,1,0,1,1,1,1,1,1
1,1,1,1,1,0,1,1,1,1
1,1,1,1,1,1,1,0,1,1
1,1,1,1,1,1,1,1,1,1
1,A,B,C,D,E,F,G,H,0

Rule:DN-x4z

2025-04-10T03:38:54Z

Yoel:

@RULE DN-x4z
# By Yoel Matveyev, 2025
# A non-reflective version of Day & Night modified as follows:

# 0 0 1 ? ? ?
# 1 0 1 ==> ? 1 ?
# 1 0 0 ? ? ?

# 1 1 0 ? ? ?
# 0 0 0 ==> ? 1 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 0 1 ==> ? 0 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 0 0 ==> ? 0 ?
# 1 1 0 ? ? ?

# 0 0 1 ? ? ?
# 1 1 1 ==> ? 0 ?
# 1 1 0 ? ? ?

# 1 1 0 ? ? ?
# 0 1 0 ==> ? 0 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 1 1 ==> ? 1 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 1 0 ==> ? 1 ?
# 1 1 0 ? ? ?

# It has rotational symmetry, but lacks reflection symmetry. As this rule is declared anisotropic, one can tweak it any non-symmetrical way.

@COLORS
1 255 255 255
@TABLE
n_states:2
neighborhood:Moore
symmetries:none
var A={0,1}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A
# Birth conditions
0,1,0,0,0,0,0,1,1,1
0,1,1,1,0,0,0,0,0,1
0,0,0,1,1,1,0,0,0,1
0,0,0,0,0,1,1,1,0,1
0,0,0,0,1,0,1,0,1,1
0,0,1,0,0,0,1,0,1,1
0,0,1,0,1,0,0,0,1,1
0,0,1,0,1,0,1,0,0,1
0,1,0,0,0,1,0,1,0,1
0,1,0,1,0,0,0,1,0,1
0,1,0,1,0,1,0,0,0,1
0,0,0,1,0,1,0,1,0,1
0,0,0,0,0,0,1,1,1,1
0,1,1,0,0,0,0,0,1,1
0,0,1,1,1,0,0,0,0,1
0,0,0,0,1,1,1,0,0,1
0,1,0,1,1,0,0,0,0,1
0,0,0,1,0,1,1,0,0,1
0,0,0,0,0,1,0,1,1,1
0,1,1,0,0,0,0,1,0,1
0,1,0,0,0,0,1,1,0,1
0,1,0,1,0,0,0,0,1,1
0,0,1,1,0,1,0,0,0,1
0,0,0,0,1,1,0,1,0,1
0,1,0,0,1,0,0,1,0,1
0,1,0,1,0,0,1,0,0,1
0,0,0,1,0,1,0,0,1,1
0,0,1,0,0,1,0,1,0,1
0,1,1,0,1,0,0,0,0,1
0,0,0,1,1,0,1,0,0,1
0,0,0,0,0,1,1,0,1,1
0,0,1,0,0,0,0,1,1,1
0,1,0,0,0,0,1,0,1,1
0,0,1,1,0,0,0,0,1,1
0,0,1,0,1,1,0,0,0,1
0,0,0,0,1,0,1,1,0,1
0,1,1,0,0,0,1,0,0,1
0,0,0,1,1,0,0,0,1,1
0,0,1,0,0,1,1,0,0,1
0,0,0,0,1,0,0,1,1,1
0,1,0,0,1,0,0,0,1,1
0,0,1,1,0,0,1,0,0,1
0,0,0,0,1,1,0,0,1,1
0,0,1,0,0,0,1,1,0,1
0,1,1,0,0,1,0,0,0,1
0,0,0,1,1,0,0,1,0,1
0,1,0,0,0,1,1,0,0,1
0,0,0,1,0,0,0,1,1,1
0,1,0,0,0,1,0,0,1,1
0,0,1,1,0,0,0,1,0,1
0,1,0,0,1,1,0,0,0,1
0,0,0,1,0,0,1,1,0,1
0,1,0,0,1,0,1,0,0,1
0,0,0,1,0,0,1,0,1,1
0,0,1,0,0,1,0,0,1,1
0,0,1,0,1,0,0,1,0,1

# Adding non-reflective B4z

0,1,0,0,1,1,0,0,1,1
0,0,1,1,0,0,1,1,0,1

0,1,1,1,1,1,1,0,0,1
0,0,0,1,1,1,1,1,1,1
0,1,1,0,0,1,1,1,1,1
0,1,1,1,1,0,0,1,1,1
0,1,0,0,1,1,1,1,1,1
0,1,1,1,0,0,1,1,1,1
0,1,1,1,1,1,0,0,1,1
0,0,1,1,1,1,1,1,0,1
0,1,0,1,1,1,1,1,0,1
0,1,0,1,0,1,1,1,1,1
0,1,1,1,0,1,0,1,1,1
0,1,1,1,1,1,0,1,0,1
0,0,1,0,1,1,1,1,1,1
0,1,1,0,1,0,1,1,1,1
0,1,1,1,1,0,1,0,1,1
0,0,1,1,1,1,1,0,1,1
0,0,1,1,1,0,1,1,1,1
0,1,1,0,1,1,1,0,1,1
0,1,1,1,1,0,1,1,0,1
0,1,0,1,1,1,1,0,1,1
0,0,1,1,0,1,1,1,1,1
0,1,1,0,1,1,0,1,1,1
0,1,0,1,1,0,1,1,1,1
0,1,1,1,0,1,1,0,1,1
0,0,1,1,1,1,0,1,1,1
0,1,1,0,1,1,1,1,0,1
0,1,0,1,1,1,0,1,1,1
0,1,1,1,0,1,1,1,0,1
0,1,0,1,1,1,1,1,1,1
0,1,1,1,0,1,1,1,1,1
0,1,1,1,1,1,0,1,1,1
0,1,1,1,1,1,1,1,0,1
0,0,1,1,1,1,1,1,1,1
0,1,1,0,1,1,1,1,1,1
0,1,1,1,1,0,1,1,1,1
0,1,1,1,1,1,1,0,1,1
0,1,1,1,1,1,1,1,1,1
# Survival conditions
1,1,0,0,0,0,0,1,1,1
1,1,1,1,0,0,0,0,0,1
1,0,0,1,1,1,0,0,0,1
1,0,0,0,0,1,1,1,0,1
1,0,0,0,1,0,1,0,1,1
1,0,1,0,0,0,1,0,1,1
1,0,1,0,1,0,0,0,1,1
1,0,1,0,1,0,1,0,0,1
1,1,0,0,0,1,0,1,0,1
1,1,0,1,0,0,0,1,0,1
1,1,0,1,0,1,0,0,0,1
1,0,0,1,0,1,0,1,0,1
1,0,0,0,0,0,1,1,1,1
1,1,1,0,0,0,0,0,1,1
1,0,1,1,1,0,0,0,0,1
1,0,0,0,1,1,1,0,0,1
1,1,0,1,1,0,0,0,0,1
1,0,0,1,0,1,1,0,0,1
1,0,0,0,0,1,0,1,1,1
1,1,1,0,0,0,0,1,0,1
1,1,0,0,0,0,1,1,0,1
1,1,0,1,0,0,0,0,1,1
1,0,1,1,0,1,0,0,0,1
1,0,0,0,1,1,0,1,0,1
1,1,0,0,1,0,0,1,0,1
1,1,0,1,0,0,1,0,0,1
1,0,0,1,0,1,0,0,1,1
1,0,1,0,0,1,0,1,0,1
1,1,1,0,1,0,0,0,0,1
1,0,0,1,1,0,1,0,0,1
1,0,0,0,0,1,1,0,1,1
1,0,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,0,1,1
1,0,1,1,0,0,0,0,1,1
1,0,1,0,1,1,0,0,0,1
1,0,0,0,1,0,1,1,0,1
1,1,1,0,0,0,1,0,0,1
1,0,0,1,1,0,0,0,1,1
1,0,1,0,0,1,1,0,0,1
1,0,0,0,1,0,0,1,1,1
1,1,0,0,1,0,0,0,1,1
1,0,1,1,0,0,1,0,0,1
1,0,0,0,1,1,0,0,1,1
1,0,1,0,0,0,1,1,0,1
1,1,1,0,0,1,0,0,0,1
1,0,0,1,1,0,0,1,0,1
1,1,0,0,0,1,1,0,0,1
1,0,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,0,1,1
1,0,1,1,0,0,0,1,0,1
1,1,0,0,1,1,0,0,0,1
1,0,0,1,0,0,1,1,0,1
1,1,0,0,1,0,1,0,0,1
1,0,0,1,0,0,1,0,1,1
1,0,1,0,0,1,0,0,1,1
1,0,1,0,1,0,0,1,0,1
1,1,1,1,1,0,0,0,0,1
1,0,0,1,1,1,1,0,0,1
1,0,0,0,0,1,1,1,1,1
1,1,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,1,1,1
1,1,1,1,0,0,0,0,1,1
1,0,1,1,1,1,0,0,0,1
1,0,0,0,1,1,1,1,0,1
1,0,1,0,1,0,1,0,1,1
1,1,0,1,0,1,0,1,0,1
1,0,1,1,0,0,0,1,1,1
1,1,1,0,1,1,0,0,0,1
1,0,0,1,1,0,1,1,0,1
1,1,0,0,0,1,1,0,1,1
1,0,1,1,0,1,0,1,0,1
1,1,0,0,1,1,0,1,0,1
1,1,0,1,0,0,1,1,0,1
1,1,0,1,0,1,0,0,1,1
1,0,0,1,0,1,0,1,1,1
1,1,1,0,0,1,0,1,0,1
1,1,0,1,1,0,0,1,0,1
1,1,0,1,0,1,1,0,0,1
1,1,1,0,1,0,0,1,0,1
1,1,0,1,1,0,1,0,0,1
1,0,0,1,0,1,1,0,1,1
1,0,1,0,0,1,0,1,1,1
1,1,0,1,0,0,1,0,1,1
1,0,1,1,0,1,0,0,1,1
1,0,1,0,1,1,0,1,0,1
1,1,0,0,1,0,1,1,0,1
1,0,1,1,1,0,0,0,1,1
1,0,1,0,1,1,1,0,0,1
1,0,0,0,1,0,1,1,1,1
1,1,1,0,0,0,1,0,1,1
1,0,1,0,0,0,1,1,1,1
1,1,1,0,1,0,0,0,1,1
1,0,1,1,1,0,1,0,0,1
1,0,0,0,1,1,1,0,1,1
1,1,0,0,1,0,0,1,1,1
1,1,1,1,0,0,1,0,0,1
1,0,0,1,1,1,0,0,1,1
1,0,1,0,0,1,1,1,0,1
1,1,1,1,0,1,0,0,0,1
1,0,0,1,1,1,0,1,0,1
1,1,0,0,0,1,1,1,0,1
1,1,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,1,1,1
1,1,1,1,0,0,0,1,0,1
1,1,0,1,1,1,0,0,0,1
1,0,0,1,0,1,1,1,0,1
1,1,0,0,1,1,1,0,0,1
1,0,0,1,0,0,1,1,1,1
1,1,1,0,0,1,0,0,1,1
1,0,1,1,1,0,0,1,0,1
1,1,0,1,1,0,0,0,1,1
1,0,1,1,0,1,1,0,0,1
1,0,0,0,1,1,0,1,1,1
1,1,1,0,0,0,1,1,0,1
1,1,1,0,1,0,1,0,0,1
1,0,0,1,1,0,1,0,1,1
1,0,1,0,0,1,1,0,1,1
1,0,1,0,1,0,0,1,1,1
1,1,0,0,1,0,1,0,1,1
1,0,1,1,0,0,1,0,1,1
1,0,1,0,1,1,0,0,1,1
1,0,1,0,1,0,1,1,0,1

# Making S4z non-reflective

1,1,1,0,0,1,1,0,0,1
1,0,0,1,1,0,0,1,1,1

1,1,1,1,1,1,1,0,0,1
1,0,0,1,1,1,1,1,1,1
1,1,1,0,0,1,1,1,1,1
1,1,1,1,1,0,0,1,1,1
1,1,0,0,1,1,1,1,1,1
1,1,1,1,0,0,1,1,1,1
1,1,1,1,1,1,0,0,1,1
1,0,1,1,1,1,1,1,0,1
1,1,0,1,1,1,1,1,0,1
1,1,0,1,0,1,1,1,1,1
1,1,1,1,0,1,0,1,1,1
1,1,1,1,1,1,0,1,0,1
1,0,1,0,1,1,1,1,1,1
1,1,1,0,1,0,1,1,1,1
1,1,1,1,1,0,1,0,1,1
1,0,1,1,1,1,1,0,1,1
1,0,1,1,1,0,1,1,1,1
1,1,1,0,1,1,1,0,1,1
1,1,1,1,1,0,1,1,0,1
1,1,0,1,1,1,1,0,1,1
1,0,1,1,0,1,1,1,1,1
1,1,1,0,1,1,0,1,1,1
1,1,0,1,1,0,1,1,1,1
1,1,1,1,0,1,1,0,1,1
1,0,1,1,1,1,0,1,1,1
1,1,1,0,1,1,1,1,0,1
1,1,0,1,1,1,0,1,1,1
1,1,1,1,0,1,1,1,0,1
1,1,0,1,1,1,1,1,1,1
1,1,1,1,0,1,1,1,1,1
1,1,1,1,1,1,0,1,1,1
1,1,1,1,1,1,1,1,0,1
1,0,1,1,1,1,1,1,1,1
1,1,1,0,1,1,1,1,1,1
1,1,1,1,1,0,1,1,1,1
1,1,1,1,1,1,1,0,1,1
1,1,1,1,1,1,1,1,1,1
1,A,B,C,D,E,F,G,H,0

Rule:DN-y4z

2025-04-10T03:35:33Z

Yoel: A non-reflective version of Day & Night

@RULE DN-x4z
# By Yoel Matveev, 2025
# A non-reflective version of Day & Night modified as follows:

# 0 0 1 ? ? ?
# 1 0 1 ==> ? 0 ?
# 1 0 0 ? ? ?

# 1 1 0 ? ? ?
# 0 0 0 ==> ? 0 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 0 1 ==> ? 1 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 0 0 ==> ? 1 ?
# 1 1 0 ? ? ?

# 0 0 1 ? ? ?
# 1 1 1 ==> ? 1 ?
# 1 1 0 ? ? ?

# 1 1 0 ? ? ?
# 0 1 0 ==> ? 1 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 1 1 ==> ? 0 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 1 0 ==> ? 0 ?
# 1 1 0 ? ? ?

# It has rotational symmetry, but lacks reflection symmetry. As this rule is declared anisotropic, one can tweak it any non-symmetrical way.

@COLORS
1 255 255 255
@TABLE
n_states:2
neighborhood:Moore
symmetries:none
var A={0,1}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A
# Birth conditions
0,1,0,0,0,0,0,1,1,1
0,1,1,1,0,0,0,0,0,1
0,0,0,1,1,1,0,0,0,1
0,0,0,0,0,1,1,1,0,1
0,0,0,0,1,0,1,0,1,1
0,0,1,0,0,0,1,0,1,1
0,0,1,0,1,0,0,0,1,1
0,0,1,0,1,0,1,0,0,1
0,1,0,0,0,1,0,1,0,1
0,1,0,1,0,0,0,1,0,1
0,1,0,1,0,1,0,0,0,1
0,0,0,1,0,1,0,1,0,1
0,0,0,0,0,0,1,1,1,1
0,1,1,0,0,0,0,0,1,1
0,0,1,1,1,0,0,0,0,1
0,0,0,0,1,1,1,0,0,1
0,1,0,1,1,0,0,0,0,1
0,0,0,1,0,1,1,0,0,1
0,0,0,0,0,1,0,1,1,1
0,1,1,0,0,0,0,1,0,1
0,1,0,0,0,0,1,1,0,1
0,1,0,1,0,0,0,0,1,1
0,0,1,1,0,1,0,0,0,1
0,0,0,0,1,1,0,1,0,1
0,1,0,0,1,0,0,1,0,1
0,1,0,1,0,0,1,0,0,1
0,0,0,1,0,1,0,0,1,1
0,0,1,0,0,1,0,1,0,1
0,1,1,0,1,0,0,0,0,1
0,0,0,1,1,0,1,0,0,1
0,0,0,0,0,1,1,0,1,1
0,0,1,0,0,0,0,1,1,1
0,1,0,0,0,0,1,0,1,1
0,0,1,1,0,0,0,0,1,1
0,0,1,0,1,1,0,0,0,1
0,0,0,0,1,0,1,1,0,1
0,1,1,0,0,0,1,0,0,1
0,0,0,1,1,0,0,0,1,1
0,0,1,0,0,1,1,0,0,1
0,0,0,0,1,0,0,1,1,1
0,1,0,0,1,0,0,0,1,1
0,0,1,1,0,0,1,0,0,1
0,0,0,0,1,1,0,0,1,1
0,0,1,0,0,0,1,1,0,1
0,1,1,0,0,1,0,0,0,1
0,0,0,1,1,0,0,1,0,1
0,1,0,0,0,1,1,0,0,1
0,0,0,1,0,0,0,1,1,1
0,1,0,0,0,1,0,0,1,1
0,0,1,1,0,0,0,1,0,1
0,1,0,0,1,1,0,0,0,1
0,0,0,1,0,0,1,1,0,1
0,1,0,0,1,0,1,0,0,1
0,0,0,1,0,0,1,0,1,1
0,0,1,0,0,1,0,0,1,1
0,0,1,0,1,0,0,1,0,1

# Adding non-reflective B4z

0,1,1,0,0,1,1,0,0,1
0,0,0,1,1,0,0,1,1,1

0,1,1,1,1,1,1,0,0,1
0,0,0,1,1,1,1,1,1,1
0,1,1,0,0,1,1,1,1,1
0,1,1,1,1,0,0,1,1,1
0,1,0,0,1,1,1,1,1,1
0,1,1,1,0,0,1,1,1,1
0,1,1,1,1,1,0,0,1,1
0,0,1,1,1,1,1,1,0,1
0,1,0,1,1,1,1,1,0,1
0,1,0,1,0,1,1,1,1,1
0,1,1,1,0,1,0,1,1,1
0,1,1,1,1,1,0,1,0,1
0,0,1,0,1,1,1,1,1,1
0,1,1,0,1,0,1,1,1,1
0,1,1,1,1,0,1,0,1,1
0,0,1,1,1,1,1,0,1,1
0,0,1,1,1,0,1,1,1,1
0,1,1,0,1,1,1,0,1,1
0,1,1,1,1,0,1,1,0,1
0,1,0,1,1,1,1,0,1,1
0,0,1,1,0,1,1,1,1,1
0,1,1,0,1,1,0,1,1,1
0,1,0,1,1,0,1,1,1,1
0,1,1,1,0,1,1,0,1,1
0,0,1,1,1,1,0,1,1,1
0,1,1,0,1,1,1,1,0,1
0,1,0,1,1,1,0,1,1,1
0,1,1,1,0,1,1,1,0,1
0,1,0,1,1,1,1,1,1,1
0,1,1,1,0,1,1,1,1,1
0,1,1,1,1,1,0,1,1,1
0,1,1,1,1,1,1,1,0,1
0,0,1,1,1,1,1,1,1,1
0,1,1,0,1,1,1,1,1,1
0,1,1,1,1,0,1,1,1,1
0,1,1,1,1,1,1,0,1,1
0,1,1,1,1,1,1,1,1,1
# Survival conditions
1,1,0,0,0,0,0,1,1,1
1,1,1,1,0,0,0,0,0,1
1,0,0,1,1,1,0,0,0,1
1,0,0,0,0,1,1,1,0,1
1,0,0,0,1,0,1,0,1,1
1,0,1,0,0,0,1,0,1,1
1,0,1,0,1,0,0,0,1,1
1,0,1,0,1,0,1,0,0,1
1,1,0,0,0,1,0,1,0,1
1,1,0,1,0,0,0,1,0,1
1,1,0,1,0,1,0,0,0,1
1,0,0,1,0,1,0,1,0,1
1,0,0,0,0,0,1,1,1,1
1,1,1,0,0,0,0,0,1,1
1,0,1,1,1,0,0,0,0,1
1,0,0,0,1,1,1,0,0,1
1,1,0,1,1,0,0,0,0,1
1,0,0,1,0,1,1,0,0,1
1,0,0,0,0,1,0,1,1,1
1,1,1,0,0,0,0,1,0,1
1,1,0,0,0,0,1,1,0,1
1,1,0,1,0,0,0,0,1,1
1,0,1,1,0,1,0,0,0,1
1,0,0,0,1,1,0,1,0,1
1,1,0,0,1,0,0,1,0,1
1,1,0,1,0,0,1,0,0,1
1,0,0,1,0,1,0,0,1,1
1,0,1,0,0,1,0,1,0,1
1,1,1,0,1,0,0,0,0,1
1,0,0,1,1,0,1,0,0,1
1,0,0,0,0,1,1,0,1,1
1,0,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,0,1,1
1,0,1,1,0,0,0,0,1,1
1,0,1,0,1,1,0,0,0,1
1,0,0,0,1,0,1,1,0,1
1,1,1,0,0,0,1,0,0,1
1,0,0,1,1,0,0,0,1,1
1,0,1,0,0,1,1,0,0,1
1,0,0,0,1,0,0,1,1,1
1,1,0,0,1,0,0,0,1,1
1,0,1,1,0,0,1,0,0,1
1,0,0,0,1,1,0,0,1,1
1,0,1,0,0,0,1,1,0,1
1,1,1,0,0,1,0,0,0,1
1,0,0,1,1,0,0,1,0,1
1,1,0,0,0,1,1,0,0,1
1,0,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,0,1,1
1,0,1,1,0,0,0,1,0,1
1,1,0,0,1,1,0,0,0,1
1,0,0,1,0,0,1,1,0,1
1,1,0,0,1,0,1,0,0,1
1,0,0,1,0,0,1,0,1,1
1,0,1,0,0,1,0,0,1,1
1,0,1,0,1,0,0,1,0,1
1,1,1,1,1,0,0,0,0,1
1,0,0,1,1,1,1,0,0,1
1,0,0,0,0,1,1,1,1,1
1,1,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,1,1,1
1,1,1,1,0,0,0,0,1,1
1,0,1,1,1,1,0,0,0,1
1,0,0,0,1,1,1,1,0,1
1,0,1,0,1,0,1,0,1,1
1,1,0,1,0,1,0,1,0,1
1,0,1,1,0,0,0,1,1,1
1,1,1,0,1,1,0,0,0,1
1,0,0,1,1,0,1,1,0,1
1,1,0,0,0,1,1,0,1,1
1,0,1,1,0,1,0,1,0,1
1,1,0,0,1,1,0,1,0,1
1,1,0,1,0,0,1,1,0,1
1,1,0,1,0,1,0,0,1,1
1,0,0,1,0,1,0,1,1,1
1,1,1,0,0,1,0,1,0,1
1,1,0,1,1,0,0,1,0,1
1,1,0,1,0,1,1,0,0,1
1,1,1,0,1,0,0,1,0,1
1,1,0,1,1,0,1,0,0,1
1,0,0,1,0,1,1,0,1,1
1,0,1,0,0,1,0,1,1,1
1,1,0,1,0,0,1,0,1,1
1,0,1,1,0,1,0,0,1,1
1,0,1,0,1,1,0,1,0,1
1,1,0,0,1,0,1,1,0,1
1,0,1,1,1,0,0,0,1,1
1,0,1,0,1,1,1,0,0,1
1,0,0,0,1,0,1,1,1,1
1,1,1,0,0,0,1,0,1,1
1,0,1,0,0,0,1,1,1,1
1,1,1,0,1,0,0,0,1,1
1,0,1,1,1,0,1,0,0,1
1,0,0,0,1,1,1,0,1,1
1,1,0,0,1,0,0,1,1,1
1,1,1,1,0,0,1,0,0,1
1,0,0,1,1,1,0,0,1,1
1,0,1,0,0,1,1,1,0,1
1,1,1,1,0,1,0,0,0,1
1,0,0,1,1,1,0,1,0,1
1,1,0,0,0,1,1,1,0,1
1,1,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,1,1,1
1,1,1,1,0,0,0,1,0,1
1,1,0,1,1,1,0,0,0,1
1,0,0,1,0,1,1,1,0,1
1,1,0,0,1,1,1,0,0,1
1,0,0,1,0,0,1,1,1,1
1,1,1,0,0,1,0,0,1,1
1,0,1,1,1,0,0,1,0,1
1,1,0,1,1,0,0,0,1,1
1,0,1,1,0,1,1,0,0,1
1,0,0,0,1,1,0,1,1,1
1,1,1,0,0,0,1,1,0,1
1,1,1,0,1,0,1,0,0,1
1,0,0,1,1,0,1,0,1,1
1,0,1,0,0,1,1,0,1,1
1,0,1,0,1,0,0,1,1,1
1,1,0,0,1,0,1,0,1,1
1,0,1,1,0,0,1,0,1,1
1,0,1,0,1,1,0,0,1,1
1,0,1,0,1,0,1,1,0,1

# Making S4z non-reflective

1,1,0,0,1,1,0,0,1,1
1,0,1,1,0,0,1,1,0,1

1,1,1,1,1,1,1,0,0,1
1,0,0,1,1,1,1,1,1,1
1,1,1,0,0,1,1,1,1,1
1,1,1,1,1,0,0,1,1,1
1,1,0,0,1,1,1,1,1,1
1,1,1,1,0,0,1,1,1,1
1,1,1,1,1,1,0,0,1,1
1,0,1,1,1,1,1,1,0,1
1,1,0,1,1,1,1,1,0,1
1,1,0,1,0,1,1,1,1,1
1,1,1,1,0,1,0,1,1,1
1,1,1,1,1,1,0,1,0,1
1,0,1,0,1,1,1,1,1,1
1,1,1,0,1,0,1,1,1,1
1,1,1,1,1,0,1,0,1,1
1,0,1,1,1,1,1,0,1,1
1,0,1,1,1,0,1,1,1,1
1,1,1,0,1,1,1,0,1,1
1,1,1,1,1,0,1,1,0,1
1,1,0,1,1,1,1,0,1,1
1,0,1,1,0,1,1,1,1,1
1,1,1,0,1,1,0,1,1,1
1,1,0,1,1,0,1,1,1,1
1,1,1,1,0,1,1,0,1,1
1,0,1,1,1,1,0,1,1,1
1,1,1,0,1,1,1,1,0,1
1,1,0,1,1,1,0,1,1,1
1,1,1,1,0,1,1,1,0,1
1,1,0,1,1,1,1,1,1,1
1,1,1,1,0,1,1,1,1,1
1,1,1,1,1,1,0,1,1,1
1,1,1,1,1,1,1,1,0,1
1,0,1,1,1,1,1,1,1,1
1,1,1,0,1,1,1,1,1,1
1,1,1,1,1,0,1,1,1,1
1,1,1,1,1,1,1,0,1,1
1,1,1,1,1,1,1,1,1,1
1,A,B,C,D,E,F,G,H,0

Rule:DN-x4z

2025-04-10T03:32:48Z

Yoel: A non-reflective version of Day & Night

@RULE DN-x4z
# By Yoel Matveev, 2025
# A non-reflective version of Day & Night modified as follows:

# 0 0 1 ? ? ?
# 1 0 1 ==> ? 1 ?
# 1 0 0 ? ? ?

# 1 1 0 ? ? ?
# 0 0 0 ==> ? 1 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 0 1 ==> ? 0 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 0 0 ==> ? 0 ?
# 1 1 0 ? ? ?

# 0 0 1 ? ? ?
# 1 1 1 ==> ? 0 ?
# 1 1 0 ? ? ?

# 1 1 0 ? ? ?
# 0 1 0 ==> ? 0 ?
# 0 1 1 ? ? ?

# 1 0 0 ? ? ?
# 1 1 1 ==> ? 1 ?
# 0 0 1 ? ? ?

# 0 1 1 ? ? ?
# 0 1 0 ==> ? 1 ?
# 1 1 0 ? ? ?

# It has rotational symmetry, but lacks reflection symmetry. As this rule is declared anisotropic, one can tweak it any non-symmetrical way.

@COLORS
1 255 255 255
@TABLE
n_states:2
neighborhood:Moore
symmetries:none
var A={0,1}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A
# Birth conditions
0,1,0,0,0,0,0,1,1,1
0,1,1,1,0,0,0,0,0,1
0,0,0,1,1,1,0,0,0,1
0,0,0,0,0,1,1,1,0,1
0,0,0,0,1,0,1,0,1,1
0,0,1,0,0,0,1,0,1,1
0,0,1,0,1,0,0,0,1,1
0,0,1,0,1,0,1,0,0,1
0,1,0,0,0,1,0,1,0,1
0,1,0,1,0,0,0,1,0,1
0,1,0,1,0,1,0,0,0,1
0,0,0,1,0,1,0,1,0,1
0,0,0,0,0,0,1,1,1,1
0,1,1,0,0,0,0,0,1,1
0,0,1,1,1,0,0,0,0,1
0,0,0,0,1,1,1,0,0,1
0,1,0,1,1,0,0,0,0,1
0,0,0,1,0,1,1,0,0,1
0,0,0,0,0,1,0,1,1,1
0,1,1,0,0,0,0,1,0,1
0,1,0,0,0,0,1,1,0,1
0,1,0,1,0,0,0,0,1,1
0,0,1,1,0,1,0,0,0,1
0,0,0,0,1,1,0,1,0,1
0,1,0,0,1,0,0,1,0,1
0,1,0,1,0,0,1,0,0,1
0,0,0,1,0,1,0,0,1,1
0,0,1,0,0,1,0,1,0,1
0,1,1,0,1,0,0,0,0,1
0,0,0,1,1,0,1,0,0,1
0,0,0,0,0,1,1,0,1,1
0,0,1,0,0,0,0,1,1,1
0,1,0,0,0,0,1,0,1,1
0,0,1,1,0,0,0,0,1,1
0,0,1,0,1,1,0,0,0,1
0,0,0,0,1,0,1,1,0,1
0,1,1,0,0,0,1,0,0,1
0,0,0,1,1,0,0,0,1,1
0,0,1,0,0,1,1,0,0,1
0,0,0,0,1,0,0,1,1,1
0,1,0,0,1,0,0,0,1,1
0,0,1,1,0,0,1,0,0,1
0,0,0,0,1,1,0,0,1,1
0,0,1,0,0,0,1,1,0,1
0,1,1,0,0,1,0,0,0,1
0,0,0,1,1,0,0,1,0,1
0,1,0,0,0,1,1,0,0,1
0,0,0,1,0,0,0,1,1,1
0,1,0,0,0,1,0,0,1,1
0,0,1,1,0,0,0,1,0,1
0,1,0,0,1,1,0,0,0,1
0,0,0,1,0,0,1,1,0,1
0,1,0,0,1,0,1,0,0,1
0,0,0,1,0,0,1,0,1,1
0,0,1,0,0,1,0,0,1,1
0,0,1,0,1,0,0,1,0,1

# Adding non-reflective B4z

0,1,0,0,1,1,0,0,1,1
0,0,1,1,0,0,1,1,0,1

0,1,1,1,1,1,1,0,0,1
0,0,0,1,1,1,1,1,1,1
0,1,1,0,0,1,1,1,1,1
0,1,1,1,1,0,0,1,1,1
0,1,0,0,1,1,1,1,1,1
0,1,1,1,0,0,1,1,1,1
0,1,1,1,1,1,0,0,1,1
0,0,1,1,1,1,1,1,0,1
0,1,0,1,1,1,1,1,0,1
0,1,0,1,0,1,1,1,1,1
0,1,1,1,0,1,0,1,1,1
0,1,1,1,1,1,0,1,0,1
0,0,1,0,1,1,1,1,1,1
0,1,1,0,1,0,1,1,1,1
0,1,1,1,1,0,1,0,1,1
0,0,1,1,1,1,1,0,1,1
0,0,1,1,1,0,1,1,1,1
0,1,1,0,1,1,1,0,1,1
0,1,1,1,1,0,1,1,0,1
0,1,0,1,1,1,1,0,1,1
0,0,1,1,0,1,1,1,1,1
0,1,1,0,1,1,0,1,1,1
0,1,0,1,1,0,1,1,1,1
0,1,1,1,0,1,1,0,1,1
0,0,1,1,1,1,0,1,1,1
0,1,1,0,1,1,1,1,0,1
0,1,0,1,1,1,0,1,1,1
0,1,1,1,0,1,1,1,0,1
0,1,0,1,1,1,1,1,1,1
0,1,1,1,0,1,1,1,1,1
0,1,1,1,1,1,0,1,1,1
0,1,1,1,1,1,1,1,0,1
0,0,1,1,1,1,1,1,1,1
0,1,1,0,1,1,1,1,1,1
0,1,1,1,1,0,1,1,1,1
0,1,1,1,1,1,1,0,1,1
0,1,1,1,1,1,1,1,1,1
# Survival conditions
1,1,0,0,0,0,0,1,1,1
1,1,1,1,0,0,0,0,0,1
1,0,0,1,1,1,0,0,0,1
1,0,0,0,0,1,1,1,0,1
1,0,0,0,1,0,1,0,1,1
1,0,1,0,0,0,1,0,1,1
1,0,1,0,1,0,0,0,1,1
1,0,1,0,1,0,1,0,0,1
1,1,0,0,0,1,0,1,0,1
1,1,0,1,0,0,0,1,0,1
1,1,0,1,0,1,0,0,0,1
1,0,0,1,0,1,0,1,0,1
1,0,0,0,0,0,1,1,1,1
1,1,1,0,0,0,0,0,1,1
1,0,1,1,1,0,0,0,0,1
1,0,0,0,1,1,1,0,0,1
1,1,0,1,1,0,0,0,0,1
1,0,0,1,0,1,1,0,0,1
1,0,0,0,0,1,0,1,1,1
1,1,1,0,0,0,0,1,0,1
1,1,0,0,0,0,1,1,0,1
1,1,0,1,0,0,0,0,1,1
1,0,1,1,0,1,0,0,0,1
1,0,0,0,1,1,0,1,0,1
1,1,0,0,1,0,0,1,0,1
1,1,0,1,0,0,1,0,0,1
1,0,0,1,0,1,0,0,1,1
1,0,1,0,0,1,0,1,0,1
1,1,1,0,1,0,0,0,0,1
1,0,0,1,1,0,1,0,0,1
1,0,0,0,0,1,1,0,1,1
1,0,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,0,1,1
1,0,1,1,0,0,0,0,1,1
1,0,1,0,1,1,0,0,0,1
1,0,0,0,1,0,1,1,0,1
1,1,1,0,0,0,1,0,0,1
1,0,0,1,1,0,0,0,1,1
1,0,1,0,0,1,1,0,0,1
1,0,0,0,1,0,0,1,1,1
1,1,0,0,1,0,0,0,1,1
1,0,1,1,0,0,1,0,0,1
1,0,0,0,1,1,0,0,1,1
1,0,1,0,0,0,1,1,0,1
1,1,1,0,0,1,0,0,0,1
1,0,0,1,1,0,0,1,0,1
1,1,0,0,0,1,1,0,0,1
1,0,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,0,1,1
1,0,1,1,0,0,0,1,0,1
1,1,0,0,1,1,0,0,0,1
1,0,0,1,0,0,1,1,0,1
1,1,0,0,1,0,1,0,0,1
1,0,0,1,0,0,1,0,1,1
1,0,1,0,0,1,0,0,1,1
1,0,1,0,1,0,0,1,0,1
1,1,1,1,1,0,0,0,0,1
1,0,0,1,1,1,1,0,0,1
1,0,0,0,0,1,1,1,1,1
1,1,1,0,0,0,0,1,1,1
1,1,0,0,0,0,1,1,1,1
1,1,1,1,0,0,0,0,1,1
1,0,1,1,1,1,0,0,0,1
1,0,0,0,1,1,1,1,0,1
1,0,1,0,1,0,1,0,1,1
1,1,0,1,0,1,0,1,0,1
1,0,1,1,0,0,0,1,1,1
1,1,1,0,1,1,0,0,0,1
1,0,0,1,1,0,1,1,0,1
1,1,0,0,0,1,1,0,1,1
1,0,1,1,0,1,0,1,0,1
1,1,0,0,1,1,0,1,0,1
1,1,0,1,0,0,1,1,0,1
1,1,0,1,0,1,0,0,1,1
1,0,0,1,0,1,0,1,1,1
1,1,1,0,0,1,0,1,0,1
1,1,0,1,1,0,0,1,0,1
1,1,0,1,0,1,1,0,0,1
1,1,1,0,1,0,0,1,0,1
1,1,0,1,1,0,1,0,0,1
1,0,0,1,0,1,1,0,1,1
1,0,1,0,0,1,0,1,1,1
1,1,0,1,0,0,1,0,1,1
1,0,1,1,0,1,0,0,1,1
1,0,1,0,1,1,0,1,0,1
1,1,0,0,1,0,1,1,0,1
1,0,1,1,1,0,0,0,1,1
1,0,1,0,1,1,1,0,0,1
1,0,0,0,1,0,1,1,1,1
1,1,1,0,0,0,1,0,1,1
1,0,1,0,0,0,1,1,1,1
1,1,1,0,1,0,0,0,1,1
1,0,1,1,1,0,1,0,0,1
1,0,0,0,1,1,1,0,1,1
1,1,0,0,1,0,0,1,1,1
1,1,1,1,0,0,1,0,0,1
1,0,0,1,1,1,0,0,1,1
1,0,1,0,0,1,1,1,0,1
1,1,1,1,0,1,0,0,0,1
1,0,0,1,1,1,0,1,0,1
1,1,0,0,0,1,1,1,0,1
1,1,0,1,0,0,0,1,1,1
1,1,0,0,0,1,0,1,1,1
1,1,1,1,0,0,0,1,0,1
1,1,0,1,1,1,0,0,0,1
1,0,0,1,0,1,1,1,0,1
1,1,0,0,1,1,1,0,0,1
1,0,0,1,0,0,1,1,1,1
1,1,1,0,0,1,0,0,1,1
1,0,1,1,1,0,0,1,0,1
1,1,0,1,1,0,0,0,1,1
1,0,1,1,0,1,1,0,0,1
1,0,0,0,1,1,0,1,1,1
1,1,1,0,0,0,1,1,0,1
1,1,1,0,1,0,1,0,0,1
1,0,0,1,1,0,1,0,1,1
1,0,1,0,0,1,1,0,1,1
1,0,1,0,1,0,0,1,1,1
1,1,0,0,1,0,1,0,1,1
1,0,1,1,0,0,1,0,1,1
1,0,1,0,1,1,0,0,1,1
1,0,1,0,1,0,1,1,0,1

# Making S4z non-reflective

1,1,1,0,0,1,1,0,0,1
1,0,0,1,1,0,0,1,1,1

1,1,1,1,1,1,1,0,0,1
1,0,0,1,1,1,1,1,1,1
1,1,1,0,0,1,1,1,1,1
1,1,1,1,1,0,0,1,1,1
1,1,0,0,1,1,1,1,1,1
1,1,1,1,0,0,1,1,1,1
1,1,1,1,1,1,0,0,1,1
1,0,1,1,1,1,1,1,0,1
1,1,0,1,1,1,1,1,0,1
1,1,0,1,0,1,1,1,1,1
1,1,1,1,0,1,0,1,1,1
1,1,1,1,1,1,0,1,0,1
1,0,1,0,1,1,1,1,1,1
1,1,1,0,1,0,1,1,1,1
1,1,1,1,1,0,1,0,1,1
1,0,1,1,1,1,1,0,1,1
1,0,1,1,1,0,1,1,1,1
1,1,1,0,1,1,1,0,1,1
1,1,1,1,1,0,1,1,0,1
1,1,0,1,1,1,1,0,1,1
1,0,1,1,0,1,1,1,1,1
1,1,1,0,1,1,0,1,1,1
1,1,0,1,1,0,1,1,1,1
1,1,1,1,0,1,1,0,1,1
1,0,1,1,1,1,0,1,1,1
1,1,1,0,1,1,1,1,0,1
1,1,0,1,1,1,0,1,1,1
1,1,1,1,0,1,1,1,0,1
1,1,0,1,1,1,1,1,1,1
1,1,1,1,0,1,1,1,1,1
1,1,1,1,1,1,0,1,1,1
1,1,1,1,1,1,1,1,0,1
1,0,1,1,1,1,1,1,1,1
1,1,1,0,1,1,1,1,1,1
1,1,1,1,1,0,1,1,1,1
1,1,1,1,1,1,1,0,1,1
1,1,1,1,1,1,1,1,1,1
1,A,B,C,D,E,F,G,H,0

Rule:Wireworld++

2023-02-18T16:34:04Z

Yoel:

@RULE Wireworld++

Rule by Vladislav Gladkikh and Alexandr Nigay

Wireworld++ is like 2 WireWorld's mashed together. There are 2 separate WireWorlds inside Wireworld++ - the 'strong' world (states 1, 2, 3) and the 'weak' world (states 4, 5, 6).

Independently, any circuit built entirely out of cells from only one world behave identicaly to regular WireWorld - since it takes 1 or 2 adjacent 'weak' heads (state 4) to turn a weak wire (state 6) into a weak head, and the same goes for the strong wire (state 3) and its heads (state 1).

The power of Wireworld++ arises when one puts the two worlds together. A strong wire will turn to a strong head when exactly two of its neighbors are weak heads, while a weak wire will turn to a weak head if exactly one of its neighbors is a strong head.

With this, it is very easy to construct very small AND and XOR gates. To make an AND gate, connect two weak wires (inputs) to one strong wire (output). To make an XOR gate, connect two strong wires to a weak wire.

Fore more information, read this article:

https://wpmedia.wolfram.com/uploads/sites/13/2018/07/27-1-2.pdf

---------------------------------------------------------
The following script was used with the standard script 'make-ruletree.py' to generate the TREE section of this file:

name = "Wireworld++"
n_states = 7
n_neighbors = 8
def transition_function(a):
nw, ne, sw, se, n, w, e, s, c = a #unpack
neigh = n, ne, e, se, s, sw, w, nw #repack

BG=0;SH=1;ST=2;SW=3;WH=4;WT=5;WW=6

shc = 0
whc = 0
for n in neigh:
if n == SH: shc += 1
if n == WH: whc += 1

if c==BG: return BG
elif c==SH: return ST
elif c==ST: return SW
elif c==WH: return WT
elif c==WT: return WW
elif c==SW:
if shc==1 or shc==2 or whc==2: return SH
else: return SW
elif c==WW:
if whc==1 or whc==2 or shc==1: return WH
else: return WW
else: raise ValueError("invalid state: " + str(c))

@TREE

num_states=7
num_neighbors=8
num_nodes=81
1 0 2 3 3 5 6 6
1 0 2 3 1 5 6 4
1 0 2 3 3 5 6 4
2 0 1 0 0 2 0 0
1 0 2 3 1 5 6 6
2 1 4 1 1 1 1 1
2 2 1 2 2 1 2 2
3 3 5 3 3 6 3 3
2 4 0 4 4 1 4 4
2 1 1 1 1 1 1 1
3 5 8 5 5 9 5 5
2 1 1 1 1 0 1 1
3 6 9 6 6 11 6 6
4 7 10 7 7 12 7 7
2 0 0 0 0 2 0 0
2 1 2 1 1 1 1 1
3 8 14 8 8 15 8 8
3 9 15 9 9 9 9 9
4 10 16 10 10 17 10 10
2 0 1 0 0 0 0 0
3 11 9 11 11 19 11 11
4 12 17 12 12 20 12 12
5 13 18 13 13 21 13 13
2 2 2 2 2 1 2 2
3 14 14 14 14 23 14 14
2 1 1 1 1 4 1 1
3 15 23 15 15 25 15 15
4 16 24 16 16 26 16 16
3 9 25 9 9 5 9 9
4 17 26 17 17 28 17 17
5 18 27 18 18 29 18 18
3 19 5 19 19 19 19 19
4 20 28 20 20 31 20 20
5 21 29 21 21 32 21 21
6 22 30 22 22 33 22 22
3 23 23 23 23 11 23 23
4 24 24 24 24 35 24 24
2 4 0 4 4 4 4 4
3 25 11 25 25 37 25 25
4 26 35 26 26 38 26 26
5 27 36 27 27 39 27 27
3 5 37 5 5 5 5 5
4 28 38 28 28 41 28 28
5 29 39 29 29 42 29 29
6 30 40 30 30 43 30 30
4 31 41 31 31 31 31 31
5 32 42 32 32 45 32 32
6 33 43 33 33 46 33 33
7 34 44 34 34 47 34 34
2 0 0 0 0 0 0 0
3 11 11 11 11 49 11 11
4 35 35 35 35 50 35 35
5 36 36 36 36 51 36 36
3 37 49 37 37 37 37 37
4 38 50 38 38 53 38 38
5 39 51 39 39 54 39 39
6 40 52 40 40 55 40 40
4 41 53 41 41 41 41 41
5 42 54 42 42 57 42 42
6 43 55 43 43 58 43 43
7 44 56 44 44 59 44 44
5 45 57 45 45 45 45 45
6 46 58 46 46 61 46 46
7 47 59 47 47 62 47 47
8 48 60 48 48 63 48 48
3 49 49 49 49 49 49 49
4 50 50 50 50 65 50 50
5 51 51 51 51 66 51 51
6 52 52 52 52 67 52 52
4 53 65 53 53 53 53 53
5 54 66 54 54 69 54 54
6 55 67 55 55 70 55 55
7 56 68 56 56 71 56 56
5 57 69 57 57 57 57 57
6 58 70 58 58 73 58 58
7 59 71 59 59 74 59 59
8 60 72 60 60 75 60 60
6 61 73 61 61 61 61 61
7 62 74 62 62 77 62 62
8 63 75 63 63 78 63 63
9 64 76 64 64 79 64 64

@COLORS

0 0 0 0
1 255 255 0
2 127 127 0
3 102 32 0
4 255 255 255
5 136 136 136
6 34 34 34

Rule:Wireworld++

2023-02-18T16:32:59Z

Yoel:

@RULE Wireworld++

# Rule by Vladislav Gladkikh and Alexandr Nigay

# Wireworld++ is like 2 WireWorld's mashed together. There are 2 separate WireWorlds inside Wireworld++ - the 'strong' world (states 1, 2, 3) and the 'weak' world (states 4, 5, 6).

# Independently, any circuit built entirely out of cells from only one world behave identicaly to regular WireWorld - since it takes 1 or 2 adjacent 'weak' heads (state 4) to turn a weak wire (state 6) into a weak head, and the same goes for the strong wire (state 3) and its heads (state 1).

# The power of Wireworld++ arises when one puts the two worlds together. A strong wire will turn to a strong head when exactly two of its neighbors are weak heads, while a weak wire will turn to a weak head if exactly one of its neighbors is a strong head.

# With this, it is very easy to construct very small AND and XOR gates. To make an AND gate, connect two weak wires (inputs) to one strong wire (output). To make an XOR gate, connect two strong wires to a weak wire.

# Fore more information, read this article:

# https://wpmedia.wolfram.com/uploads/sites/13/2018/07/27-1-2.pdf

# ---------------------------------------------------------
# The following script was used with the standard script 'make-ruletree.py' to generate the TREE section of this file:

# name = "Wireworld++"
# n_states = 7
# n_neighbors = 8
# def transition_function(a):
# nw, ne, sw, se, n, w, e, s, c = a #unpack
# neigh = n, ne, e, se, s, sw, w, nw #repack

# BG=0;SH=1;ST=2;SW=3;WH=4;WT=5;WW=6

# shc = 0
# whc = 0
# for n in neigh:
# if n == SH: shc += 1
# if n == WH: whc += 1

# if c==BG: return BG
# elif c==SH: return ST
# elif c==ST: return SW
# elif c==WH: return WT
# elif c==WT: return WW
# elif c==SW:
# if shc==1 or shc==2 or whc==2: return SH
else: return SW
elif c==WW:
if whc==1 or whc==2 or shc==1: return WH
else: return WW
else: raise ValueError("invalid state: " + str(c))

@TREE

num_states=7
num_neighbors=8
num_nodes=81
1 0 2 3 3 5 6 6
1 0 2 3 1 5 6 4
1 0 2 3 3 5 6 4
2 0 1 0 0 2 0 0
1 0 2 3 1 5 6 6
2 1 4 1 1 1 1 1
2 2 1 2 2 1 2 2
3 3 5 3 3 6 3 3
2 4 0 4 4 1 4 4
2 1 1 1 1 1 1 1
3 5 8 5 5 9 5 5
2 1 1 1 1 0 1 1
3 6 9 6 6 11 6 6
4 7 10 7 7 12 7 7
2 0 0 0 0 2 0 0
2 1 2 1 1 1 1 1
3 8 14 8 8 15 8 8
3 9 15 9 9 9 9 9
4 10 16 10 10 17 10 10
2 0 1 0 0 0 0 0
3 11 9 11 11 19 11 11
4 12 17 12 12 20 12 12
5 13 18 13 13 21 13 13
2 2 2 2 2 1 2 2
3 14 14 14 14 23 14 14
2 1 1 1 1 4 1 1
3 15 23 15 15 25 15 15
4 16 24 16 16 26 16 16
3 9 25 9 9 5 9 9
4 17 26 17 17 28 17 17
5 18 27 18 18 29 18 18
3 19 5 19 19 19 19 19
4 20 28 20 20 31 20 20
5 21 29 21 21 32 21 21
6 22 30 22 22 33 22 22
3 23 23 23 23 11 23 23
4 24 24 24 24 35 24 24
2 4 0 4 4 4 4 4
3 25 11 25 25 37 25 25
4 26 35 26 26 38 26 26
5 27 36 27 27 39 27 27
3 5 37 5 5 5 5 5
4 28 38 28 28 41 28 28
5 29 39 29 29 42 29 29
6 30 40 30 30 43 30 30
4 31 41 31 31 31 31 31
5 32 42 32 32 45 32 32
6 33 43 33 33 46 33 33
7 34 44 34 34 47 34 34
2 0 0 0 0 0 0 0
3 11 11 11 11 49 11 11
4 35 35 35 35 50 35 35
5 36 36 36 36 51 36 36
3 37 49 37 37 37 37 37
4 38 50 38 38 53 38 38
5 39 51 39 39 54 39 39
6 40 52 40 40 55 40 40
4 41 53 41 41 41 41 41
5 42 54 42 42 57 42 42
6 43 55 43 43 58 43 43
7 44 56 44 44 59 44 44
5 45 57 45 45 45 45 45
6 46 58 46 46 61 46 46
7 47 59 47 47 62 47 47
8 48 60 48 48 63 48 48
3 49 49 49 49 49 49 49
4 50 50 50 50 65 50 50
5 51 51 51 51 66 51 51
6 52 52 52 52 67 52 52
4 53 65 53 53 53 53 53
5 54 66 54 54 69 54 54
6 55 67 55 55 70 55 55
7 56 68 56 56 71 56 56
5 57 69 57 57 57 57 57
6 58 70 58 58 73 58 58
7 59 71 59 59 74 59 59
8 60 72 60 60 75 60 60
6 61 73 61 61 61 61 61
7 62 74 62 62 77 62 62
8 63 75 63 63 78 63 63
9 64 76 64 64 79 64 64

@COLORS

0 0 0 0
1 255 255 0
2 127 127 0
3 102 32 0
4 255 255 255
5 136 136 136
6 34 34 34

Rule:WireWorld++

2023-02-14T05:21:08Z

Yoel: Yoel moved page Rule:WireWorld++ to Rule:Wireworld++

#REDIRECT [[Rule:Wireworld++]]

Rule:Wireworld++

2023-02-14T05:21:08Z

Yoel: Yoel moved page Rule:WireWorld++ to Rule:Wireworld++

@RULE Wireworld++

# Rule by Vladislav Gladkikh and Alexandr Nigay

# Wireworld++ is like 2 WireWorld's mashed together. There are 2 separate WireWorlds inside Wireworld++ - the 'strong' world (states 1, 2, 3) and the 'weak' world (states 4, 5, 6).

# Independently, any circuit built entirely out of cells from only one world behave identicaly to regular WireWorld - since it takes 1 or 2 adjacent 'weak' heads (state 4) to turn a weak wire (state 6) into a weak head, and the same goes for the strong wire (state 3) and its heads (state 1).

# The power of Wireworld++ arises when one puts the two worlds together. A strong wire will turn to a strong head when exactly two of its neighbors are weak heads, while a weak wire will turn to a weak head if exactly one of its neighbors is a strong head.

# With this, it is very easy to construct very small AND and XOR gates. To make an AND gate, connect two weak wires (inputs) to one strong wire (output). To make an XOR gate, connect two strong wires to a weak wire.

# Fore more information, read this article:

# https://wpmedia.wolfram.com/uploads/sites/13/2018/07/27-1-2.pdf

# ---------------------------------------------------------
# The following script was used with the standard script 'make-ruletree.py' to generate the TREE section of this file:

# name = "Wireworld++"
# n_states = 7
# n_neighbors = 8
# def transition_function(a):
# nw, ne, sw, se, n, w, e, s, c = a #unpack
# neigh = n, ne, e, se, s, sw, w, nw #repack

# BG=0;SH=1;ST=2;SW=3;WH=4;WT=5;WW=6

# shc = 0
# whc = 0
# for n in neigh:
# if n == SH: shc += 1
# if n == WH: whc += 1

# if c==BG: return BG
# elif c==SH: return ST
# elif c==ST: return SW
# elif c==WH: return WT
# elif c==WT: return WW
# elif c==SW:
# if shc==1 or shc==2 or whc==2: return SH
# else: return SW
# elif c==WW:
# if whc==1 or whc==2 or shc==1: return WH
# else: return WW
# else: raise ValueError("invalid state: " + str(c))

@TREE

num_states=7
num_neighbors=8
num_nodes=81
1 0 2 3 3 5 6 6
1 0 2 3 1 5 6 4
1 0 2 3 3 5 6 4
2 0 1 0 0 2 0 0
1 0 2 3 1 5 6 6
2 1 4 1 1 1 1 1
2 2 1 2 2 1 2 2
3 3 5 3 3 6 3 3
2 4 0 4 4 1 4 4
2 1 1 1 1 1 1 1
3 5 8 5 5 9 5 5
2 1 1 1 1 0 1 1
3 6 9 6 6 11 6 6
4 7 10 7 7 12 7 7
2 0 0 0 0 2 0 0
2 1 2 1 1 1 1 1
3 8 14 8 8 15 8 8
3 9 15 9 9 9 9 9
4 10 16 10 10 17 10 10
2 0 1 0 0 0 0 0
3 11 9 11 11 19 11 11
4 12 17 12 12 20 12 12
5 13 18 13 13 21 13 13
2 2 2 2 2 1 2 2
3 14 14 14 14 23 14 14
2 1 1 1 1 4 1 1
3 15 23 15 15 25 15 15
4 16 24 16 16 26 16 16
3 9 25 9 9 5 9 9
4 17 26 17 17 28 17 17
5 18 27 18 18 29 18 18
3 19 5 19 19 19 19 19
4 20 28 20 20 31 20 20
5 21 29 21 21 32 21 21
6 22 30 22 22 33 22 22
3 23 23 23 23 11 23 23
4 24 24 24 24 35 24 24
2 4 0 4 4 4 4 4
3 25 11 25 25 37 25 25
4 26 35 26 26 38 26 26
5 27 36 27 27 39 27 27
3 5 37 5 5 5 5 5
4 28 38 28 28 41 28 28
5 29 39 29 29 42 29 29
6 30 40 30 30 43 30 30
4 31 41 31 31 31 31 31
5 32 42 32 32 45 32 32
6 33 43 33 33 46 33 33
7 34 44 34 34 47 34 34
2 0 0 0 0 0 0 0
3 11 11 11 11 49 11 11
4 35 35 35 35 50 35 35
5 36 36 36 36 51 36 36
3 37 49 37 37 37 37 37
4 38 50 38 38 53 38 38
5 39 51 39 39 54 39 39
6 40 52 40 40 55 40 40
4 41 53 41 41 41 41 41
5 42 54 42 42 57 42 42
6 43 55 43 43 58 43 43
7 44 56 44 44 59 44 44
5 45 57 45 45 45 45 45
6 46 58 46 46 61 46 46
7 47 59 47 47 62 47 47
8 48 60 48 48 63 48 48
3 49 49 49 49 49 49 49
4 50 50 50 50 65 50 50
5 51 51 51 51 66 51 51
6 52 52 52 52 67 52 52
4 53 65 53 53 53 53 53
5 54 66 54 54 69 54 54
6 55 67 55 55 70 55 55
7 56 68 56 56 71 56 56
5 57 69 57 57 57 57 57
6 58 70 58 58 73 58 58
7 59 71 59 59 74 59 59
8 60 72 60 60 75 60 60
6 61 73 61 61 61 61 61
7 62 74 62 62 77 62 62
8 63 75 63 63 78 63 63
9 64 76 64 64 79 64 64

@COLORS

0 0 0 0
1 255 255 0
2 127 127 0
3 102 32 0
4 255 255 255
5 136 136 136
6 34 34 34

Rule:Wireworld++

2023-02-14T05:19:39Z

Yoel:

@RULE Wireworld++

# Rule by Vladislav Gladkikh and Alexandr Nigay

# Wireworld++ is like 2 WireWorld's mashed together. There are 2 separate WireWorlds inside Wireworld++ - the 'strong' world (states 1, 2, 3) and the 'weak' world (states 4, 5, 6).

# Independently, any circuit built entirely out of cells from only one world behave identicaly to regular WireWorld - since it takes 1 or 2 adjacent 'weak' heads (state 4) to turn a weak wire (state 6) into a weak head, and the same goes for the strong wire (state 3) and its heads (state 1).

# The power of Wireworld++ arises when one puts the two worlds together. A strong wire will turn to a strong head when exactly two of its neighbors are weak heads, while a weak wire will turn to a weak head if exactly one of its neighbors is a strong head.

# With this, it is very easy to construct very small AND and XOR gates. To make an AND gate, connect two weak wires (inputs) to one strong wire (output). To make an XOR gate, connect two strong wires to a weak wire.

# Fore more information, read this article:

# https://wpmedia.wolfram.com/uploads/sites/13/2018/07/27-1-2.pdf

# ---------------------------------------------------------
# The following script was used with the standard script 'make-ruletree.py' to generate the TREE section of this file:

# name = "Wireworld++"
# n_states = 7
# n_neighbors = 8
# def transition_function(a):
# nw, ne, sw, se, n, w, e, s, c = a #unpack
# neigh = n, ne, e, se, s, sw, w, nw #repack

# BG=0;SH=1;ST=2;SW=3;WH=4;WT=5;WW=6

# shc = 0
# whc = 0
# for n in neigh:
# if n == SH: shc += 1
# if n == WH: whc += 1

# if c==BG: return BG
# elif c==SH: return ST
# elif c==ST: return SW
# elif c==WH: return WT
# elif c==WT: return WW
# elif c==SW:
# if shc==1 or shc==2 or whc==2: return SH
# else: return SW
# elif c==WW:
# if whc==1 or whc==2 or shc==1: return WH
# else: return WW
# else: raise ValueError("invalid state: " + str(c))

@TREE

num_states=7
num_neighbors=8
num_nodes=81
1 0 2 3 3 5 6 6
1 0 2 3 1 5 6 4
1 0 2 3 3 5 6 4
2 0 1 0 0 2 0 0
1 0 2 3 1 5 6 6
2 1 4 1 1 1 1 1
2 2 1 2 2 1 2 2
3 3 5 3 3 6 3 3
2 4 0 4 4 1 4 4
2 1 1 1 1 1 1 1
3 5 8 5 5 9 5 5
2 1 1 1 1 0 1 1
3 6 9 6 6 11 6 6
4 7 10 7 7 12 7 7
2 0 0 0 0 2 0 0
2 1 2 1 1 1 1 1
3 8 14 8 8 15 8 8
3 9 15 9 9 9 9 9
4 10 16 10 10 17 10 10
2 0 1 0 0 0 0 0
3 11 9 11 11 19 11 11
4 12 17 12 12 20 12 12
5 13 18 13 13 21 13 13
2 2 2 2 2 1 2 2
3 14 14 14 14 23 14 14
2 1 1 1 1 4 1 1
3 15 23 15 15 25 15 15
4 16 24 16 16 26 16 16
3 9 25 9 9 5 9 9
4 17 26 17 17 28 17 17
5 18 27 18 18 29 18 18
3 19 5 19 19 19 19 19
4 20 28 20 20 31 20 20
5 21 29 21 21 32 21 21
6 22 30 22 22 33 22 22
3 23 23 23 23 11 23 23
4 24 24 24 24 35 24 24
2 4 0 4 4 4 4 4
3 25 11 25 25 37 25 25
4 26 35 26 26 38 26 26
5 27 36 27 27 39 27 27
3 5 37 5 5 5 5 5
4 28 38 28 28 41 28 28
5 29 39 29 29 42 29 29
6 30 40 30 30 43 30 30
4 31 41 31 31 31 31 31
5 32 42 32 32 45 32 32
6 33 43 33 33 46 33 33
7 34 44 34 34 47 34 34
2 0 0 0 0 0 0 0
3 11 11 11 11 49 11 11
4 35 35 35 35 50 35 35
5 36 36 36 36 51 36 36
3 37 49 37 37 37 37 37
4 38 50 38 38 53 38 38
5 39 51 39 39 54 39 39
6 40 52 40 40 55 40 40
4 41 53 41 41 41 41 41
5 42 54 42 42 57 42 42
6 43 55 43 43 58 43 43
7 44 56 44 44 59 44 44
5 45 57 45 45 45 45 45
6 46 58 46 46 61 46 46
7 47 59 47 47 62 47 47
8 48 60 48 48 63 48 48
3 49 49 49 49 49 49 49
4 50 50 50 50 65 50 50
5 51 51 51 51 66 51 51
6 52 52 52 52 67 52 52
4 53 65 53 53 53 53 53
5 54 66 54 54 69 54 54
6 55 67 55 55 70 55 55
7 56 68 56 56 71 56 56
5 57 69 57 57 57 57 57
6 58 70 58 58 73 58 58
7 59 71 59 59 74 59 59
8 60 72 60 60 75 60 60
6 61 73 61 61 61 61 61
7 62 74 62 62 77 62 62
8 63 75 63 63 78 63 63
9 64 76 64 64 79 64 64

@COLORS

0 0 0 0
1 255 255 0
2 127 127 0
3 102 32 0
4 255 255 255
5 136 136 136
6 34 34 34

Rule:Wireworld++

2023-02-14T05:17:25Z

Yoel: Created page with "@RULE Wireworld++ Rule by Vladislav Gladkikh and Alexandr Nigay Wireworld++ is like 2 WireWorld's mashed together. There are 2 separate WireWorlds inside Wireworld++ - the 'strong' world (states 1, 2, 3) and the 'weak' world (states 4, 5, 6). Independently, any circuit built entirely out of cells from only one world behave identicaly to regular WireWorld - since it takes 1 or 2 adjacent 'weak' heads (state 4) to turn a weak wire (state 6) into a weak head, and the sam..."

@RULE Wireworld++

Rule by Vladislav Gladkikh and Alexandr Nigay

Wireworld++ is like 2 WireWorld's mashed together. There are 2 separate WireWorlds inside Wireworld++ - the 'strong' world (states 1, 2, 3) and the 'weak' world (states 4, 5, 6).

Independently, any circuit built entirely out of cells from only one world behave identicaly to regular WireWorld - since it takes 1 or 2 adjacent 'weak' heads (state 4) to turn a weak wire (state 6) into a weak head, and the same goes for the strong wire (state 3) and its heads (state 1).

The power of Wireworld++ arises when one puts the two worlds together. A strong wire will turn to a strong head when exactly two of its neighbors are weak heads, while a weak wire will turn to a weak head if exactly one of its neighbors is a strong head.

With this, it is very easy to construct very small AND and XOR gates. To make an AND gate, connect two weak wires (inputs) to one strong wire (output). To make an XOR gate, connect two strong wires to a weak wire.

Fore more information, read this article:
https://wpmedia.wolfram.com/uploads/sites/13/2018/07/27-1-2.pdf

---------------------------------------------------------
The following script was used with the standard script 'make-ruletree.py' to generate the TREE section of this file:

name = "Wireworld++"
n_states = 7
n_neighbors = 8
def transition_function(a):
nw, ne, sw, se, n, w, e, s, c = a #unpack
neigh = n, ne, e, se, s, sw, w, nw #repack

BG=0;SH=1;ST=2;SW=3;WH=4;WT=5;WW=6

shc = 0
whc = 0
for n in neigh:
if n == SH: shc += 1
if n == WH: whc += 1

if c==BG: return BG
elif c==SH: return ST
elif c==ST: return SW
elif c==WH: return WT
elif c==WT: return WW
elif c==SW:
if shc==1 or shc==2 or whc==2: return SH
else: return SW
elif c==WW:
if whc==1 or whc==2 or shc==1: return WH
else: return WW
else: raise ValueError("invalid state: " + str(c))

@TREE

num_states=7
num_neighbors=8
num_nodes=81
1 0 2 3 3 5 6 6
1 0 2 3 1 5 6 4
1 0 2 3 3 5 6 4
2 0 1 0 0 2 0 0
1 0 2 3 1 5 6 6
2 1 4 1 1 1 1 1
2 2 1 2 2 1 2 2
3 3 5 3 3 6 3 3
2 4 0 4 4 1 4 4
2 1 1 1 1 1 1 1
3 5 8 5 5 9 5 5
2 1 1 1 1 0 1 1
3 6 9 6 6 11 6 6
4 7 10 7 7 12 7 7
2 0 0 0 0 2 0 0
2 1 2 1 1 1 1 1
3 8 14 8 8 15 8 8
3 9 15 9 9 9 9 9
4 10 16 10 10 17 10 10
2 0 1 0 0 0 0 0
3 11 9 11 11 19 11 11
4 12 17 12 12 20 12 12
5 13 18 13 13 21 13 13
2 2 2 2 2 1 2 2
3 14 14 14 14 23 14 14
2 1 1 1 1 4 1 1
3 15 23 15 15 25 15 15
4 16 24 16 16 26 16 16
3 9 25 9 9 5 9 9
4 17 26 17 17 28 17 17
5 18 27 18 18 29 18 18
3 19 5 19 19 19 19 19
4 20 28 20 20 31 20 20
5 21 29 21 21 32 21 21
6 22 30 22 22 33 22 22
3 23 23 23 23 11 23 23
4 24 24 24 24 35 24 24
2 4 0 4 4 4 4 4
3 25 11 25 25 37 25 25
4 26 35 26 26 38 26 26
5 27 36 27 27 39 27 27
3 5 37 5 5 5 5 5
4 28 38 28 28 41 28 28
5 29 39 29 29 42 29 29
6 30 40 30 30 43 30 30
4 31 41 31 31 31 31 31
5 32 42 32 32 45 32 32
6 33 43 33 33 46 33 33
7 34 44 34 34 47 34 34
2 0 0 0 0 0 0 0
3 11 11 11 11 49 11 11
4 35 35 35 35 50 35 35
5 36 36 36 36 51 36 36
3 37 49 37 37 37 37 37
4 38 50 38 38 53 38 38
5 39 51 39 39 54 39 39
6 40 52 40 40 55 40 40
4 41 53 41 41 41 41 41
5 42 54 42 42 57 42 42
6 43 55 43 43 58 43 43
7 44 56 44 44 59 44 44
5 45 57 45 45 45 45 45
6 46 58 46 46 61 46 46
7 47 59 47 47 62 47 47
8 48 60 48 48 63 48 48
3 49 49 49 49 49 49 49
4 50 50 50 50 65 50 50
5 51 51 51 51 66 51 51
6 52 52 52 52 67 52 52
4 53 65 53 53 53 53 53
5 54 66 54 54 69 54 54
6 55 67 55 55 70 55 55
7 56 68 56 56 71 56 56
5 57 69 57 57 57 57 57
6 58 70 58 58 73 58 58
7 59 71 59 59 74 59 59
8 60 72 60 60 75 60 60
6 61 73 61 61 61 61 61
7 62 74 62 62 77 62 62
8 63 75 63 63 78 63 63
9 64 76 64 64 79 64 64

@COLORS

0 0 0 0
1 255 255 0
2 127 127 0
3 102 32 0
4 255 255 255
5 136 136 136
6 34 34 34

OCA:Bosco's Rule

2023-02-13T07:59:31Z

Yoel:

{{stub}}
{{Rule
|name = Bugs
|imgname = Bugs_rule
|r = 5
|b = 34-45
|s = 33-57
|c = 2
|n = M
|char = Chaotic
}}
:''For the range-1 outer-totalistic rule, see [[OCA:Bugs (Life-like cellular automaton)]].''

'''Bugs''' (also known as '''Bosco's Rule''') is a [[Larger than Life]] cellular automaton, and perhaps one of the most studied such rules. The rule was devised by [[Kellie Evans]]. The alternative name "Bosco's Rule" is derived from a sparky period-166 oscillator called "Bosco" (see [[#Oscillators|Oscillators]]).

== Patterns ==

=== Still lifes ===
The most common still life is the block, similar to [[Block|its Life equivalent]] but as a 6×6 square as opposed to a 2×2.

[[File:bugsblock.png|thumb|center|150px|The 6×6 block. {{LinkCatagolue|code=xs36_vvvvvvz111111|rule=r5b34t45s34t58|style=brief}}]]

Other larger still lifes exist, often resembling thick hollow polygons.

=== Oscillators ===
Some p2, p3, p4, p5, p7 oscillators are known in Bugs.

One particularly notable oscillator is a [[Reflectorless rotating oscillator|reflectorless flipping oscillator]] known as ''Bosco'', oscillating at a period of 166. Its period can be increased by passing it near 6x6 blocks, with the period increasing to 284, 404, 520 and then by 118 for each extra pair of blocks. It is possible to construct oscillators with any multiples of these periods with loops of gun-based signal logic.

{{EmbedViewer
|rle = x = 12, y = 11, rule = R5,C0,S33-57,B34-45,NM
6bo$4b5o$2b5ob2o$b5o3b2o$b4o5bo$4o5b3o$b4o3b3o$b5ob4o$2b8o$3b7o$4b5o!
|position = center
|caption = Bosco
|apgcode = xp166_gsuvvvuuoz7ffvggpc7/r5b34t45s34t58
}}
[[File:bosco2blocks.png|thumb|center|250px|Bosco with two blocks, period 284]]

=== Spaceships ===

Bugs is rich with many spaceships of various velocities, periods and directions. The most common are the orthogonal 5c/6, 8c/12, 4c/5, and the diagonal 8c/16, 23c/42. Other naturally occurring spaceships include orthogonal c/1 (many kinds), 2c/2, 6c/6, 7c/13; diagonal c/2, 2c/3, 5c/8, 6c/10; [[knightship]]s (2,1)c/3, (1,2)c/4.

=== Infinite growth ===

Multiple bug guns have been constructed using Boscos, with an example shown below. Periods other than 166 are possible to achieve by using boscos modified by pairs of blocks used as reflectors, splitters and eaters. It is possible to produce various kinds of spaceships by reacting another spaceship with each other or with boscos. Spaceships streams of smaller periods, e.g. 83 or 142, can be constructed by stacking two of more guns in a sequence.

[[File:buggun.png|frame|center|150px|A gun]]

The simplest known gun, discovered by [[Yoel Matveyev]] in 2002, is made from two reacting boscos<ref name="post132465" />.

=== Signal logic ===

[[Reflector]]s, [[duplicator]]s, [[eater]]s, period doublers, flip-flops, as well as various phase, location and type shifters of spaceships, have been constructed in Bugs<ref name="post134695" />.

=== Turing completeness ===

A so-called "rosary", finite version of [[Rule 110]] was constructed by [[FWKnightship]] in February 2023, thus providing a somewhat weak proof of this rule's Turing completeness <ref name="post157100" />.

FWKnightship's design involves complex circuitry that relies on a mix of orthogonal 5c/6 and diagonal 8c/16 spaceships.

In less than a week later [[Yoel Matveyev]] independently posted his infinitely extending Rule 110 [[unit cell|unit cells]], which serve as a more rigorous proof.

Matveyev's design is conceptually similar to his Rule 110 tiles for [[OCA:FireWorld|FireWorld]] and [[OCA:Brian's Brain|Brian's Brain]]. It consists of AND-NOT gates, flip-flips and synchronization circuitry. The current state of each tile is stored in its one-bit memory (a toggle flip-flop). <ref name="post157414" />.

== Generalization ==

[[Higher-range outer-totalistic]] notation allows to define rules very similar to Bugs, but augmented with many additional still lifes, which can be used for easy construction of guns and oscillators of arbitrary periods, stable eaters, reflectors and duplicators, logic gates etc.<ref name="post134695" />

Bugs can be generalised to other ranges, such as the range-10 "Bugsmovie", the range-7 "Soldier Bugs" rule containing a p552 [[reflectorless rotating oscillator]], and a range-6 rule containing a quadratic [[replicator]].

Similarly shaped spaceships are also known in other ranges, starting from range-2 "Mini Bugs".

<gallery>
File:Deanhickersons p552 RRO.png|Dean Hickerson's period-552 reflectorless rotating oscillator. {{LinkCatagolue|code=xp552_0gsuvvvvvuszevvv33133vvvezw377777733|rule=r7b65t95s65t114|style=brief}}
File:Deanhickersons p552 RRO 12fold p46.png|Dave Greene's 12-fold, period-46 version
</gallery>

==References==
<references>
<ref name="post132465">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 132465
|author = Yoel Matveyev
|date = June 22, 2021
}}</ref>
<references>
<ref name="post134695">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 134695
|author = Yoel Matveyev
|date = August 8, 2021
}}</ref>
<ref name="post157100">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157100
|author = FWKnightship
|date = February 7, 2023
}}</ref>
<ref name="post157414">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157414
|author = Yoel Matveyev
|date = February 12, 2023
}}</ref>
</references>

== External links ==
* {{LinkMirek|rullex_lgtl.html#Bugs|title=MCell built-in Larger than Life rules: Bugs}}
* {{LinkCatagolueRule|r5b34t45s34t58}}

Yoel Matveyev

2023-02-13T07:58:59Z

Yoel:

{{Person
|name = Yoel Matveyev
|nat = Russian
}}

'''Yoel Matveyev''' is a Russian science fiction writer, poet, software developer, and cellular automata enthusiast.

In 2021 he released the largest known cellular automation computer called [[Izhora]] based on his own 4-state rule [[OCA:FireWorld|FireWorld]].

Matveyev also proved [[Turing completeness]] of [[OCA:Brian's Brain|Brian's Brain]] in 2020<ref name="post110762" /> and investigated multistate cyclical rules, which can be viewed as generalizing the notion of [[Self-complementary|self-complementarity]]. In multistate cyclic rules every pattern behaves exactly the same, if the states of all live cells are cyclically changed to one another, e.g. 1→2,2→3,3→1<ref name="post101012" />.

In 2023 Matveyev posted Rule 110 [[unit cell|unit cells]] for [[OCA:Bosco's Rule]] <ref name="post157414" />.

==References==
<references>
<ref name="post110762">{{LinkForumThread
|p = 110762
|format = ref
|title = Re: Turing - complete Generations rules
|author = Yoel Matveyev
|date = November 15, 2020
}}</ref>
<ref name="post101012">{{LinkForumThread
|format = ref
|title = Re: Gluonic
|p = 101012
|author = Yoel Matveyev
|date = July 24, 2020
}}</ref>
<ref name="post157414">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157414
|author = Yoel Matveyev
|date = February 12, 2023
}}</ref>
</references>

==External links==
{{LinkWikipedia|Yoel_Matveyev}}

Unit cell

2023-02-12T19:44:56Z

Yoel:

{{Glossary}}
A '''unit cell''' (or '''metacell''') is a subset (usually rectangular or square) of the Life plane that tiles over the plane, along with a fixed number of distinct patterns, with each tile assuming one of the patterns, such that it simulates a [[cellular automaton]], possibly itself. A '''unit Life cell''' is a unit cell that simulates the [[Conway's Game of Life|Game of Life]]. To avoid single [[cell]]s themselves being considered unit cells, the size of a unit cell must be greater than {{times|1|1}}. It is also a restriction that only finite sized patterns are accepted as unit cells excluding infinite one-cell thick bars in [[HighLife]] for example, which simulates [[Rule 54]]; many [[amphichiral]] 1D elementary automata can be embedded in other rules via this method.

== Simulating a 2D cellular automaton ==
The [[p5760 unit Life cell|first unit Life cell]] was constructed by [[David Bell]] in {{year|1996}}.<ref>{{LinkCallahan|patterns/unitcell/ucdesc.html|patternname=The Unit Life Cell}}</ref> It employs standard glider logic to determine whether or not a [[glider]] should be present. The two states differ by a single glider. In 2004, [[Jared James Prince]] modified David Bell's unit Life cell to support two (and therefore multiple) layers of Life universes, coined "[[deep cell]]".<ref>{{cite web|url=http://www.physicsforums.com/showthread.php?t=45061|title=Game of Life Deep Cell|author=Jared Prince|date=September 27, 2004}}</ref>

Around 2005, the [[OTCA metapixel]] was constructed, which can simulate any [[Life-like cellular automaton]].<ref>{{cite web|url=http://otcametapixel.blogspot.com/2006/05/how-does-it-work.html/|title=How Does It Work?|work=OTCAmetapixel|author=Brice Due|date=May 28, 2006|accessdate=March 26, 2009}}</ref> Designed to run quickly in [[HashLife]], it has the advantage of having two states that are clearly distinct when zoomed out.

The [[p1 megacell]], designed in 2008, has clearly visible states like the OTCA metapixel. It is capable of simulating any rule, including non-totalistic and asymmetric rules, that uses the standard eight-cell neighborhood. It also has unusual positioning, being a square with diagonal edges. This allows much of its information to be transmitted with gliders.

The [[0E0P metacell]] is currently the largest unit cell. Unlike other unit cells, it can function without any form of support circuitry, allowing it to produce the first examples of exotic patterns such as parity-rule [[replicator]]s and [[reflectorless rotating oscillator]]s in Life when programmed correctly. Rather than having an "on" state or an "off" state, it deconstructs itself when it turns off and is built by its neighbors when it is turned on.

== Simulating a 1D cellular automaton ==

=== Natural occurrences ===
Most replicators can be described as simulating a one-dimensional cellular automaton. For example, the [[replicator]] in [[HighLife]] can be described as simulating Rule 6 on a range-1/2 one-dimensional neighbourhood. If considered as being period 24 rather than period 12, it could be considered as following Rule 90, to which the replicator's habit is commonly, if erroneously, simplified to.

Certain basic infinite-growth patterns could arguably be considered replicators that simulate rules such as Rule 50<ref>{{LinkForumThread|f=11|t=2238|p=50033|title=Re: Thread for basic non-CGOL questions|format=ref}}</ref> and Rule 254<ref>{{LinkForumThread|f=11|t=2238|p=50392|title=Re: Thread for basic non-CGOL questions|format=ref}}</ref>.

Interestingly, the U-pentomino is a period-8 natural replicator that emulates [[Rule 110]] in rules between B2ei3aci4aei5kqr7e/S01c2-kn3ijry4citwy5aeiq and B2ein3acikq4-jrty5-ceiy6-ck78/S01c2-k3-acen4-a5-jny6-c78. {{POTY|name=This pattern was found by [[iNoMed]]<ref name="post116434" /> and|year=2020|type=oca|rank=2|behind=a collection of [[Day and Night]] [[knightship]]s}} In the 1st of January 2021, [[AforAmpere]] found<ref name="post117657" /> a faster one, the T-tetromino with period 2 in rules supporting rules from B2ai3aeir4r5ei/S3e5e6i to B2-c34-i56-i78/S2-ai3-i4-e5678.

So far, the following 1D rules are known:
* Rule 0<ref name="thebigone"/>
* Rule 2<ref name="thebigone"/>
* Rule 4<ref name="thebigone"/>
* Rule 16<ref name="thebigone"/>
* Rule 22<ref name="thebigone"/>
* Rule 32<ref name="thebigone"/>
* Rule 50<ref name="thebigone"/>
* Rule 90<ref name="thebigone"/>
* Rule 110<ref name="post116434" /><ref name="post117657" />
* Rule 128<ref name="thebigone"/>
* Rule 150<ref name="thebigone"/>
* Rule 254<ref name="thebigone"/>

Rules of larger ranges are also known:
* Rule W1208925819614629174771760<ref name="thebigone"/>

=== Constructions ===
Complex one-dimensional cellular automata usually can be simulated via constructed unit cells. Purpose of this is basically the containing automaton inherits some useful properties of the embedded, which is usually not trivial to prove. Such properties are logic universality, [[Turing-completeness]], etc. It is known that many examples are constructed in order to simulate [[Rule 110]] and allegedly [[Rule 30]] in one case. One is constructed in CGoL by [[Jason Summers]]<ref>{{LinkGoLNews|2005/12/rule_110_unit_cell.html|title="Rule 110" Unit Cell|date=December 21, 2005|author=Heinrich Koenig}}</ref> and later it was trivially shown using [[Golly]] that it is a [[polyglot]] (works in [[EightLife]], too).

==== Selection of Life-like rules with constructed W110 unit cells ====
* B3[8]/S23[8] polyglot: works in [[Life]], {{rl|EightLife}}, {{rl|Pedestrian Life}} and {{rl|HoneyLife}}<ref name="post53026" />
* {{rl|Banks-I}}: proves logic universality using [[Matthew Cook]]'s results,<ref>[https://en.wikipedia.org/wiki/Rule_110 Wikipedia:Rule 110]</ref> simplifying [[Roger Banks]]' proofs from 1971<ref name="post52584" />
* {{rl|B35/S236}}<ref name="post52043" />
* {{rl|DryLife}} and 3 more<ref name="post58579" />
* {{rl|2×2}}<ref name="post121769" />
* {{rl|Move}}<ref name="post102550" />
* B36[8]/S236[8] polyglot: {{rl|HighLife}}, {{rl|LowDeath}}, and others<ref name="post62217" />
* {{rl|Life without death}}<ref name="post106546" />
* {{rl|Live Free or Die}}<ref name="post107139" />
* {{rl|Day & Night}}<ref name="post102258" />
* {{rl|Seeds}}<ref name="post108522" />
* {{rl|DotLife}} using a two-dimensional emulator<ref name="post117425" />
* {{rl|Brian's Brain}}<ref name="post110762" />
* {{rl|Logarithmic replicator rule}}<ref name="post102490" />
* {{rl|Star Wars}} using a cyclical emulator<ref name="post111232" />
* {{rl|Bosco's Rule}}<ref name="post157414" />

==References==
<references>
<ref name="post53026">{{LinkForumThread
|format = ref
|title = FWSS-less MWSS-track-only Rule-110 Unit Cell
|p = 53026
|author = Peter Naszvadi
|date = November 21, 2017
}}</ref>
<ref name="post52584">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 52584
|author = Peter Naszvadi
|date = November 1, 2017
}}</ref>
<ref name="post52043">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 52043
|author = Peter Naszvadi
|date = October 14, 2017
}}</ref>
<ref name="post58579">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 58579
|author = Peter Naszvadi
|date = March 29, 2018
}}</ref>
<ref name="post116434">{{LinkForumThread
|format = ref
|title = Re: Rules with interesting replicators
|p = 116434
|author = toroidalet
|date = December 19, 2020
}}</ref>
<ref name="post117657">{{LinkForumThread
|format = ref
|title = Re: Rules with interesting replicators
|p = 117657
|author = AforAmpere
|date = January 1, 2021
}}</ref>
<ref name="thebigone">{{LinkForumThread
|format = ref
|title = Replicators and other patterns that simulate even 1D rules
|p = 61459
|author = Connor Steppie
|date = June 29, 2018
}}</ref>
<ref name="post121769">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 121769
|author = FWKnightship
|date = February 4, 2021
}}</ref>
<ref name="post102550">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 102550
|author = Layz Boi
|date = August 20, 2020
}}</ref>
<ref name="post62217">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 62217
|author = Peter Naszvadi
|date = July 29, 2018
}}</ref>
<ref name="post106546">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 106546
|author = Peter Naszvadi
|date = October 13, 2020
}}</ref>
<ref name="post107139">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 107139
|author = FWKnightship
|date = October 20, 2020
}}</ref>
<ref name="post102258">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 102258
|author = Peter Naszvadi
|date = August 14, 2020
}}</ref>
<ref name="post108522">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 108522
|author = Peter Naszvadi
|date = October 30, 2020
}}</ref>
<ref name="post117425">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 117425
|author = FWKnightship
|date = December 30, 2020
}}</ref>
<ref name="post110762">{{LinkForumThread
|p = 110762
|format = ref
|title = Re: Turing - complete Generations rules
|author = Yoel Matveyev
|date = November 15, 2020
}}</ref>
<ref name="post102490">{{LinkForumThread
|format = ref
|title = Re: List of the Turing-complete totalistic life-like CA
|p = 102490
|author = Peter Naszvadi
|date = August 19, 2020
}}</ref>
<ref name="post111232">{{LinkForumThread
|p = 111232
|format = ref
|title = Re: Star Wars Rule
|author = FWKnightship
|date = November 18, 2020
}}</ref>
<ref name="post157414">{{LinkForumThread
|p = 157414
|format = ref
|title = Re: Larger than Life
|author = Yoel Matveyev
|date = February 12, 2023
}}</ref>
</references>

==External links==
* {{LinkLexicon|lex_u.htm#unitlifecell}}
* {{LinkLexicon|filename=lex_m.htm#metacell|patternname=Metacell}}

OCA:Bosco's Rule

2023-02-12T19:29:15Z

Yoel:

{{stub}}
{{Rule
|name = Bugs
|imgname = Bugs_rule
|r = 5
|b = 34-45
|s = 33-57
|c = 2
|n = M
|char = Chaotic
}}
:''For the range-1 outer-totalistic rule, see [[OCA:Bugs (Life-like cellular automaton)]].''

'''Bugs''' (also known as '''Bosco's Rule''') is a [[Larger than Life]] cellular automaton, and perhaps one of the most studied such rules. The rule was devised by [[Kellie Evans]]. The alternative name "Bosco's Rule" is derived from a sparky period-166 oscillator called "Bosco" (see [[#Oscillators|Oscillators]]).

== Patterns ==

=== Still lifes ===
The most common still life is the block, similar to [[Block|its Life equivalent]] but as a 6×6 square as opposed to a 2×2.

[[File:bugsblock.png|thumb|center|150px|The 6×6 block. {{LinkCatagolue|code=xs36_vvvvvvz111111|rule=r5b34t45s34t58|style=brief}}]]

Other larger still lifes exist, often resembling thick hollow polygons.

=== Oscillators ===
Some p2, p3, p4, p5, p7 oscillators are known in Bugs.

One particularly notable oscillator is a [[Reflectorless rotating oscillator|reflectorless flipping oscillator]] known as ''Bosco'', oscillating at a period of 166. Its period can be increased by passing it near 6x6 blocks, with the period increasing to 284, 404, 520 and then by 118 for each extra pair of blocks. It is possible to construct oscillators with any multiples of these periods with loops of gun-based signal logic.

{{EmbedViewer
|rle = x = 12, y = 11, rule = R5,C0,S33-57,B34-45,NM
6bo$4b5o$2b5ob2o$b5o3b2o$b4o5bo$4o5b3o$b4o3b3o$b5ob4o$2b8o$3b7o$4b5o!
|position = center
|caption = Bosco
|apgcode = xp166_gsuvvvuuoz7ffvggpc7/r5b34t45s34t58
}}
[[File:bosco2blocks.png|thumb|center|250px|Bosco with two blocks, period 284]]

=== Spaceships ===

Bugs is rich with many spaceships of various velocities, periods and directions. The most common are the orthogonal 5c/6, 8c/12, 4c/5, and the diagonal 8c/16, 23c/42. Other naturally occurring spaceships include orthogonal c/1 (many kinds), 2c/2, 6c/6, 7c/13; diagonal c/2, 2c/3, 5c/8, 6c/10; [[knightship]]s (2,1)c/3, (1,2)c/4.

=== Infinite growth ===

Multiple bug guns have been constructed using Boscos, with an example shown below. Periods other than 166 are possible to achieve by using boscos modified by pairs of blocks used as reflectors, splitters and eaters. It is possible to produce various kinds of spaceships by reacting another spaceship with each other or with boscos. Spaceships streams of smaller periods, e.g. 83 or 142, can be constructed by stacking two of more guns in a sequence.

[[File:buggun.png|frame|center|150px|A gun]]

The simplest known gun, discovered by [[Yoel Matveyev]] in 2002, is made from two reacting boscos<ref name="post132465" />.

=== Signal logic ===

[[Reflector]]s, [[duplicator]]s, [[eater]]s, period doublers, flip-flops, as well as various phase, location and type shifters of spaceships, have been constructed in Bugs<ref name="post134695" />.

=== Turing completeness ===

A so-called "rosary", finite version of [[Rule 110]] was constructed by [[FWKnightship]] in February 2023, thus providing a somewhat weak proof of this rule's Turing completeness <ref name="post157100" />.

FWKnightship's design involves complex circuitry that relies on a mix of orthogonal 5c/6 and diagonal 8c/16 spaceships.

In less than a week later [[Yoel Matveyev]] independently posted his infinitely extending Rule 110 [[unit cell|unit cells]], which serve as a more rigorous proof.

Matveyev's design is conceptually similar to his Rule 110 tiles for [[OCA:FireWorld|FireWorld]] and [[OCA:Brian's Brain|Brian's Brain]]. It consists of AND-NOT gates, flip-flips and synchronization circuitry. The current state of each tile is stored in its one-bit memory (a toggle flip-flop). <ref name="post157414" />.

== Generalization ==

[[Higher-range outer-totalistic]] notation allows to define rules very similar to Bugs, but augmented with many additional still lifes, which can be used for easy construction of guns and oscillators of arbitrary periods, stable eaters, reflectors and duplicators, logic gates etc.<ref name="post134695" />

Bugs can be generalised to other ranges, such as the range-10 "Bugsmovie", the range-7 "Soldier Bugs" rule containing a p552 [[reflectorless rotating oscillator]], and a range-6 rule containing a quadratic [[replicator]].

Similarly shaped spaceships are also known in other ranges, starting from range-2 "Mini Bugs".

<gallery>
File:Deanhickersons p552 RRO.png|Dean Hickerson's period-552 reflectorless rotating oscillator. {{LinkCatagolue|code=xp552_0gsuvvvvvuszevvv33133vvvezw377777733|rule=r7b65t95s65t114|style=brief}}
File:Deanhickersons p552 RRO 12fold p46.png|Dave Greene's 12-fold, period-46 version
</gallery>

==References==
<references>
<ref name="post132465">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 132465
|author = Yoel
|date = June 22, 2021
}}</ref>
<references>
<ref name="post134695">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 134695
|author = Yoel
|date = August 8, 2021
}}</ref>
<ref name="post157100">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157100
|author = FWKnightship
|date = February 7, 2023
}}</ref>
<ref name="post157414">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157414
|author = Yoel
|date = February 12, 2023
}}</ref>
</references>

== External links ==
* {{LinkMirek|rullex_lgtl.html#Bugs|title=MCell built-in Larger than Life rules: Bugs}}
* {{LinkCatagolueRule|r5b34t45s34t58}}

OCA:Bosco's Rule

2023-02-12T19:28:39Z

Yoel:

{{stub}}
{{Rule
|name = Bugs
|imgname = Bugs_rule
|r = 5
|b = 34-45
|s = 33-57
|c = 2
|n = M
|char = Chaotic
}}
:''For the range-1 outer-totalistic rule, see [[OCA:Bugs (Life-like cellular automaton)]].''

'''Bugs''' (also known as '''Bosco's Rule''') is a [[Larger than Life]] cellular automaton, and perhaps one of the most studied such rules. The rule was devised by [[Kellie Evans]]. The alternative name "Bosco's Rule" is derived from a sparky period-166 oscillator called "Bosco" (see [[#Oscillators|Oscillators]]).

== Patterns ==

=== Still lifes ===
The most common still life is the block, similar to [[Block|its Life equivalent]] but as a 6×6 square as opposed to a 2×2.

[[File:bugsblock.png|thumb|center|150px|The 6×6 block. {{LinkCatagolue|code=xs36_vvvvvvz111111|rule=r5b34t45s34t58|style=brief}}]]

Other larger still lifes exist, often resembling thick hollow polygons.

=== Oscillators ===
Some p2, p3, p4, p5, p7 oscillators are known in Bugs.

One particularly notable oscillator is a [[Reflectorless rotating oscillator|reflectorless flipping oscillator]] known as ''Bosco'', oscillating at a period of 166. Its period can be increased by passing it near 6x6 blocks, with the period increasing to 284, 404, 520 and then by 118 for each extra pair of blocks. It is possible to construct oscillators with any multiples of these periods with loops of gun-based signal logic.

{{EmbedViewer
|rle = x = 12, y = 11, rule = R5,C0,S33-57,B34-45,NM
6bo$4b5o$2b5ob2o$b5o3b2o$b4o5bo$4o5b3o$b4o3b3o$b5ob4o$2b8o$3b7o$4b5o!
|position = center
|caption = Bosco
|apgcode = xp166_gsuvvvuuoz7ffvggpc7/r5b34t45s34t58
}}
[[File:bosco2blocks.png|thumb|center|250px|Bosco with two blocks, period 284]]

=== Spaceships ===

Bugs is rich with many spaceships of various velocities, periods and directions. The most common are the orthogonal 5c/6, 8c/12, 4c/5, and the diagonal 8c/16, 23c/42. Other naturally occurring spaceships include orthogonal c/1 (many kinds), 2c/2, 6c/6, 7c/13; diagonal c/2, 2c/3, 5c/8, 6c/10; [[knightship]]s (2,1)c/3, (1,2)c/4.

=== Infinite growth ===

Multiple bug guns have been constructed using Boscos, with an example shown below. Periods other than 166 are possible to achieve by using boscos modified by pairs of blocks used as reflectors, splitters and eaters. It is possible to produce various kinds of spaceships by reacting another spaceship with each other or with boscos. Spaceships streams of smaller periods, e.g. 83 or 142, can be constructed by stacking two of more guns in a sequence.

[[File:buggun.png|frame|center|150px|A gun]]

The simplest known gun, discovered by [[Yoel Matveyev]] in 2002, is made from two reacting boscos<ref name="post132465" />.

=== Signal logic ===

[[Reflector]]s, [[duplicator]]s, [[eater]]s, period doublers, flip-flops, as well as various phase, location and type shifters of spaceships, have been constructed in Bugs<ref name="post134695" />.

=== Turing completeness ===

A so-called "rosary", finite version of [[Rule 110]] was constructed by [[FWKnightship]] in February 2023, thus providing a somewhat weak proof of this rule's Turing completeness <ref name="post157100" />.

FWKnightship's design involves complex circuitry that relies on a mix of orthogonal 5c/6 and diagonal 8c/16 spaceships.

In less than a week later [[Yoel Matveyev]] independently posted his infinitely extending Rule 110 [[unit cell|unit cells]], which serve a more rigorous proof.

Matveyev's design is conceptually similar to his Rule 110 tiles for [[OCA:FireWorld|FireWorld]] and [[OCA:Brian's Brain|Brian's Brain]]. It consists of AND-NOT gates, flip-flips and synchronization circuitry. The current state of each tile is stored in its one-bit memory (a toggle flip-flop). <ref name="post157414" />.

== Generalization ==

[[Higher-range outer-totalistic]] notation allows to define rules very similar to Bugs, but augmented with many additional still lifes, which can be used for easy construction of guns and oscillators of arbitrary periods, stable eaters, reflectors and duplicators, logic gates etc.<ref name="post134695" />

Bugs can be generalised to other ranges, such as the range-10 "Bugsmovie", the range-7 "Soldier Bugs" rule containing a p552 [[reflectorless rotating oscillator]], and a range-6 rule containing a quadratic [[replicator]].

Similarly shaped spaceships are also known in other ranges, starting from range-2 "Mini Bugs".

<gallery>
File:Deanhickersons p552 RRO.png|Dean Hickerson's period-552 reflectorless rotating oscillator. {{LinkCatagolue|code=xp552_0gsuvvvvvuszevvv33133vvvezw377777733|rule=r7b65t95s65t114|style=brief}}
File:Deanhickersons p552 RRO 12fold p46.png|Dave Greene's 12-fold, period-46 version
</gallery>

==References==
<references>
<ref name="post132465">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 132465
|author = Yoel
|date = June 22, 2021
}}</ref>
<references>
<ref name="post134695">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 134695
|author = Yoel
|date = August 8, 2021
}}</ref>
<ref name="post157100">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157100
|author = FWKnightship
|date = February 7, 2023
}}</ref>
<ref name="post157414">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157414
|author = Yoel
|date = February 12, 2023
}}</ref>
</references>

== External links ==
* {{LinkMirek|rullex_lgtl.html#Bugs|title=MCell built-in Larger than Life rules: Bugs}}
* {{LinkCatagolueRule|r5b34t45s34t58}}

OCA:Bosco's Rule

2023-02-12T19:28:02Z

Yoel:

{{stub}}
{{Rule
|name = Bugs
|imgname = Bugs_rule
|r = 5
|b = 34-45
|s = 33-57
|c = 2
|n = M
|char = Chaotic
}}
:''For the range-1 outer-totalistic rule, see [[OCA:Bugs (Life-like cellular automaton)]].''

'''Bugs''' (also known as '''Bosco's Rule''') is a [[Larger than Life]] cellular automaton, and perhaps one of the most studied such rules. The rule was devised by [[Kellie Evans]]. The alternative name "Bosco's Rule" is derived from a sparky period-166 oscillator called "Bosco" (see [[#Oscillators|Oscillators]]).

== Patterns ==

=== Still lifes ===
The most common still life is the block, similar to [[Block|its Life equivalent]] but as a 6×6 square as opposed to a 2×2.

[[File:bugsblock.png|thumb|center|150px|The 6×6 block. {{LinkCatagolue|code=xs36_vvvvvvz111111|rule=r5b34t45s34t58|style=brief}}]]

Other larger still lifes exist, often resembling thick hollow polygons.

=== Oscillators ===
Some p2, p3, p4, p5, p7 oscillators are known in Bugs.

One particularly notable oscillator is a [[Reflectorless rotating oscillator|reflectorless flipping oscillator]] known as ''Bosco'', oscillating at a period of 166. Its period can be increased by passing it near 6x6 blocks, with the period increasing to 284, 404, 520 and then by 118 for each extra pair of blocks. It is possible to construct oscillators with any multiples of these periods with loops of gun-based signal logic.

{{EmbedViewer
|rle = x = 12, y = 11, rule = R5,C0,S33-57,B34-45,NM
6bo$4b5o$2b5ob2o$b5o3b2o$b4o5bo$4o5b3o$b4o3b3o$b5ob4o$2b8o$3b7o$4b5o!
|position = center
|caption = Bosco
|apgcode = xp166_gsuvvvuuoz7ffvggpc7/r5b34t45s34t58
}}
[[File:bosco2blocks.png|thumb|center|250px|Bosco with two blocks, period 284]]

=== Spaceships ===

Bugs is rich with many spaceships of various velocities, periods and directions. The most common are the orthogonal 5c/6, 8c/12, 4c/5, and the diagonal 8c/16, 23c/42. Other naturally occurring spaceships include orthogonal c/1 (many kinds), 2c/2, 6c/6, 7c/13; diagonal c/2, 2c/3, 5c/8, 6c/10; [[knightship]]s (2,1)c/3, (1,2)c/4.

=== Infinite growth ===

Multiple bug guns have been constructed using Boscos, with an example shown below. Periods other than 166 are possible to achieve by using boscos modified by pairs of blocks used as reflectors, splitters and eaters. It is possible to produce various kinds of spaceships by reacting another spaceship with each other or with boscos. Spaceships streams of smaller periods, e.g. 83 or 142, can be constructed by stacking two of more guns in a sequence.

[[File:buggun.png|frame|center|150px|A gun]]

The simplest known gun, discovered by [[Yoel Matveyev]] in 2002, is made from two reacting boscos<ref name="post132465" />.

=== Signal logic ===

[[Reflector]]s, [[duplicator]]s, [[eater]]s, period doublers, flip-flops, as well as various phase, location and type shifters of spaceships, have been constructed in Bugs<ref name="post134695" />.

=== Turing completeness ===

A so-called "rosary", finite version of [[Rule 110]] was constructed by [[FWKnightship]] in February 2023, thus providing a somewhat weak proof of this rule's Turing completeness <ref name="post157100" />.

FWKnightship's design involves complex circuitry that relies on a mix of orthogonal 5c/6 and diagonal 8c/16 spaceships.

In less than a week later [[Yoel Matveyev]] posted his infinitely extending Rule 110 [[unit cell|unit cells]], which serve a more rigorous proof.

Matveyev's design is conceptually similar to his Rule 110 tiles for [[OCA:FireWorld|FireWorld]] and [[OCA:Brian's Brain|Brian's Brain]]. It consists of AND-NOT gates, flip-flips and synchronization circuitry. The current state of each tile is stored in its one-bit memory (a toggle flip-flop). <ref name="post157414" />.

== Generalization ==

[[Higher-range outer-totalistic]] notation allows to define rules very similar to Bugs, but augmented with many additional still lifes, which can be used for easy construction of guns and oscillators of arbitrary periods, stable eaters, reflectors and duplicators, logic gates etc.<ref name="post134695" />

Bugs can be generalised to other ranges, such as the range-10 "Bugsmovie", the range-7 "Soldier Bugs" rule containing a p552 [[reflectorless rotating oscillator]], and a range-6 rule containing a quadratic [[replicator]].

Similarly shaped spaceships are also known in other ranges, starting from range-2 "Mini Bugs".

<gallery>
File:Deanhickersons p552 RRO.png|Dean Hickerson's period-552 reflectorless rotating oscillator. {{LinkCatagolue|code=xp552_0gsuvvvvvuszevvv33133vvvezw377777733|rule=r7b65t95s65t114|style=brief}}
File:Deanhickersons p552 RRO 12fold p46.png|Dave Greene's 12-fold, period-46 version
</gallery>

==References==
<references>
<ref name="post132465">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 132465
|author = Yoel
|date = June 22, 2021
}}</ref>
<references>
<ref name="post134695">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 134695
|author = Yoel
|date = August 8, 2021
}}</ref>
<ref name="post157100">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157100
|author = FWKnightship
|date = February 7, 2023
}}</ref>
<ref name="post157414">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157414
|author = Yoel
|date = February 12, 2023
}}</ref>
</references>

== External links ==
* {{LinkMirek|rullex_lgtl.html#Bugs|title=MCell built-in Larger than Life rules: Bugs}}
* {{LinkCatagolueRule|r5b34t45s34t58}}

OCA:Bosco's Rule

2023-02-12T10:15:29Z

Yoel:

{{stub}}
{{Rule
|name = Bugs
|imgname = Bugs_rule
|r = 5
|b = 34-45
|s = 33-57
|c = 2
|n = M
|char = Chaotic
}}
:''For the range-1 outer-totalistic rule, see [[OCA:Bugs (Life-like cellular automaton)]].''

'''Bugs''' (also known as '''Bosco's Rule''') is a [[Larger than Life]] cellular automaton, and perhaps one of the most studied such rules. The rule was devised by [[Kellie Evans]]. The alternative name "Bosco's Rule" is derived from a sparky period-166 oscillator called "Bosco" (see [[#Oscillators|Oscillators]]).

== Patterns ==

=== Still lifes ===
The most common still life is the block, similar to [[Block|its Life equivalent]] but as a 6×6 square as opposed to a 2×2.

[[File:bugsblock.png|thumb|center|150px|The 6×6 block. {{LinkCatagolue|code=xs36_vvvvvvz111111|rule=r5b34t45s34t58|style=brief}}]]

Other larger still lifes exist, often resembling thick hollow polygons.

=== Oscillators ===
Some p2, p3, p4, p5, p7 oscillators are known in Bugs.

One particularly notable oscillator is a [[Reflectorless rotating oscillator|reflectorless flipping oscillator]] known as ''Bosco'', oscillating at a period of 166. Its period can be increased by passing it near 6x6 blocks, with the period increasing to 284, 404, 520 and then by 118 for each extra pair of blocks. It is possible to construct oscillators with any multiples of these periods with loops of gun-based signal logic.

{{EmbedViewer
|rle = x = 12, y = 11, rule = R5,C0,S33-57,B34-45,NM
6bo$4b5o$2b5ob2o$b5o3b2o$b4o5bo$4o5b3o$b4o3b3o$b5ob4o$2b8o$3b7o$4b5o!
|position = center
|caption = Bosco
|apgcode = xp166_gsuvvvuuoz7ffvggpc7/r5b34t45s34t58
}}
[[File:bosco2blocks.png|thumb|center|250px|Bosco with two blocks, period 284]]

=== Spaceships ===

Bugs is rich with many spaceships of various velocities, periods and directions. The most common are the orthogonal 5c/6, 8c/12, 4c/5, and the diagonal 8c/16, 23c/42. Other naturally occurring spaceships include orthogonal c/1 (many kinds), 2c/2, 6c/6, 7c/13; diagonal c/2, 2c/3, 5c/8, 6c/10; [[knightship]]s (2,1)c/3, (1,2)c/4.

=== Infinite growth ===

Multiple bug guns have been constructed using Boscos, with an example shown below. Periods other than 166 are possible to achieve by using boscos modified by pairs of blocks used as reflectors, splitters and eaters. It is possible to produce various kinds of spaceships by reacting another spaceship with each other or with boscos. Spaceships streams of smaller periods, e.g. 83 or 142, can be constructed by stacking two of more guns in a sequence.

[[File:buggun.png|frame|center|150px|A gun]]

The simplest known gun, discovered by [[Yoel Matveyev]] in 2002, is made from two reacting boscos<ref name="post132465" />.

=== Signal logic ===

[[Reflector]]s, [[duplicator]]s, [[eater]]s, period doublers, flip-flops, as well as various phase, location and type shifters of spaceships, have been constructed in Bugs<ref name="post134695" />.

=== Turing completeness ===

Tiling emulating [[Rule 110]] was constructed by [[Yoel Matveyev]] in February 2023, thus proving Turing completeness of this rule.

The design is conceptually similar to Matveyev's Rule 110 tiles for [[OCA:FireWorld|FireWorld]] and [[OCA:Brian's Brain|Brian's Brain]]. It consists of AND-NOT gates, flip-flips and synchronization circuitry. The current state of each tile is stored in its one-bit memory (a toggle flip-flop). <ref name="post157414" />.

== Generalization ==

[[Higher-range outer-totalistic]] notation allows to define rules very similar to Bugs, but augmented with many additional still lifes, which can be used for easy construction of guns and oscillators of arbitrary periods, stable eaters, reflectors and duplicators, logic gates etc.<ref name="post134695" />

Bugs can be generalised to other ranges, such as the range-10 "Bugsmovie", the range-7 "Soldier Bugs" rule containing a p552 [[reflectorless rotating oscillator]], and a range-6 rule containing a quadratic [[replicator]].

Similarly shaped spaceships are also known in other ranges, starting from range-2 "Mini Bugs".

<gallery>
File:Deanhickersons p552 RRO.png|Dean Hickerson's period-552 reflectorless rotating oscillator. {{LinkCatagolue|code=xp552_0gsuvvvvvuszevvv33133vvvezw377777733|rule=r7b65t95s65t114|style=brief}}
File:Deanhickersons p552 RRO 12fold p46.png|Dave Greene's 12-fold, period-46 version
</gallery>

==References==
<references>
<ref name="post132465">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 132465
|author = Yoel
|date = June 22, 2021
}}</ref>
<references>
<ref name="post134695">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 134695
|author = Yoel
|date = August 8, 2021
}}</ref>
<ref name="post157414">{{LinkForumThread
|format = ref
|title = Re: Larger than Life
|p = 157414
|author = Yoel
|date = February 12, 2023
}}</ref>
</references>

== External links ==
* {{LinkMirek|rullex_lgtl.html#Bugs|title=MCell built-in Larger than Life rules: Bugs}}
* {{LinkCatagolueRule|r5b34t45s34t58}}

Rule:ChainedLife0

2022-12-18T15:28:16Z

Yoel: Created page with "@RULE ChainedLife0 @COLORS 0 0 0 0 1 255 255 255 2 255 0 0 3 0 255 0 4 255 255 0 @TABLE # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 n_states:5 neighborhood:Moore symmetries:rotate4reflect var i={0,4} var j=i var k=i var l=i var m=i var n=i var o=i var p=i var I={1,2,3} var J=I var K=I var L=I var M=I var N=I var O=I var P=I var a={0,1,2,3} var b=a var c=a var d=a var e=a var f=a var g=a var h=a var A={0,1,2,3,4} var B=A var C=A var D..."

@RULE ChainedLife0

@COLORS

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

@TABLE

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

n_states:5
neighborhood:Moore
symmetries:rotate4reflect

var i={0,4}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var I={1,2,3}
var J=I
var K=I
var L=I
var M=I
var N=I
var O=I
var P=I

var a={0,1,2,3}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var A={0,1,2,3,4}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A
var X=A

# Life

0,I,j,K,l,M,n,o,p,1
0,i,J,k,l,m,N,o,P,1
0,I,j,k,L,m,N,o,p,1
0,i,J,K,L,m,n,o,p,1
0,I,J,K,l,m,n,o,p,1
0,I,j,K,l,m,n,o,P,1
0,I,j,k,L,m,n,O,p,1
0,I,j,k,L,M,n,o,p,1
0,I,J,k,L,m,n,o,p,1
0,I,j,k,L,m,n,o,P,1

1,I,j,K,l,M,n,o,p,1
1,i,J,k,l,m,N,o,P,1
1,I,j,k,L,m,N,o,p,1
1,i,J,K,L,m,n,o,p,1
1,I,J,K,l,m,n,o,p,1
1,I,j,K,l,m,n,o,P,1
1,I,j,k,L,m,n,O,p,1
1,I,j,k,L,M,n,o,p,1
1,I,J,k,L,m,n,o,p,1
1,I,j,k,L,m,n,o,P,1

1,I,j,K,l,m,n,o,p,1
1,i,J,k,L,m,n,o,p,1
1,I,j,k,L,m,n,o,p,1
1,I,J,k,l,m,n,o,p,1
1,i,J,k,l,m,N,o,p,1
1,I,j,k,l,M,n,o,p,1

# Photon

0,2,b,c,d,e,f,g,h,2

# Diaphoton

0,0,3,0,0,0,0,0,0,3
0,3,B,C,D,E,F,G,H,4

# Diaphoton birth

0,2,C,2,D,E,F,G,H,3

# Clean up

2,A,B,C,D,E,F,G,H,4
3,A,B,C,D,E,F,G,H,4
4,A,B,C,D,E,F,G,H,0
X,A,B,C,D,E,F,G,H,0

OCA:FireWorld

2022-11-12T17:30:06Z

Yoel:

{{Rule
|name = FireWorld
|char = Chaotic
|b = 2ak
|s = 03ajkr
|g = 3
}}
{{stub}}
'''FireWorld''' is a [[rule]] created in 2020 by [[Yoel Matveyev]].<ref name="post117140" /> Fireworld operates in the [[Moore neighborhood]]. Cells may have 4 states: empty, alive, dead and wire.

It's based on the older rule, which Matveyev discovered and started researching in 2001 and which he later nicknamed, somewhat confusingly, Fireworld with the small "w"<ref name="post99901" />. Its rulestring is "'''03ajkr/2ak/3'''". That means the following:

*An empty cell becomes alive only if it is surrounded by one live cell horizontally or vertically adjacent to it, while one other cell is adjacent to it diagonally.
*A live cell survives either if there are no other live cells in its neighborhood or there are exactly three live cells adjacent to it in a particular way: two adjacent orthogonally (horizontally or vertically), while the third one is adjacent diagonally.
*Dead cells count as empty and do not interfere with birth or survival if they are present in the neighborhood. However, they do prevent a cell being born in their place, as usual in the "Generations" rules.
*A dead cell becomes empty in the next generation.

Due to a simple reaction that allows to use single dots as stable data bits and [[photon|photons]] as data carriers, this rule allows relatively easy logic circuitry construction and was proven by Matveyev in 2020 to be Turing-complete <ref name="post109135" />.

For more concise and faster logic circuitry, Matveyev invented a backward compatible superset of the original rule called FireWorld with the capital "W". It has the fourth state of immutable wires. Unlike the well known [[WireWorld]], signals in FireWorld can be carried on the wires' surface, according to the following additional definition:

*A live cell is born, if surrounded by 1 live cell or two live cells in either "2a" or "2k" position, and 2 or 3 wire cells. Dead cells are allowed in the neighborhood.

That means that in in order for 2 live cells to give birth next to 2 or 3 wire cells, one live cell must be in an orthogonal and the another one in a diagonal position. That matches the original pattern of "03ajkr/2ak/3".

Unlike [[WireWorld]], which can only use unstable logic, FireWorld can use dots as stable data, which turned out to be very useful for registers and data manipulation, largely eliminating synchronization issues and thus allowing scalable modular "hardware" architecture. Within a year after inventing the rule, Yoel Matveyev had built a large computer in it, called Izhora <ref name="post136309" />.

==See also==
*[[Izhora]]

==References==
<references>
<ref name="post99901">
{{LinkForumThread
|format=ref
|title=Fireworld (old historical rule)
|author=Yoel Matveyev
|p=99901
|date=July 1, 2020
}}
</ref>
<ref name="post117140">
{{LinkForumThread
|format=ref
|title=FireWorld
|author=Yoel Matveyev
|p=117140
|date=December 28th, 2020
}}
</ref>
<ref name="post109135">
{{LinkForumThread
|format=ref
|title=Re: Fireworld/Positronic
|author=Yoel Matveyev
|p=109135
|date=November 3rd, 2020
}}
</ref>
<ref name="post136309">
{{LinkForumThread
|format=ref
|title=Izhora (FireWorld/Fireworld2 computer)
|author=Yoel Matveyev
|p=136309
|date=October 5th, 2021
}}
</ref>

</references>
[[Category:Cellular automaton rules]]

OCA:FireWorld

2022-11-12T17:28:40Z

Yoel:

{{Rule
|name = FireWorld
|char = Chaotic
|b = 2ak
|s = 03ajkr
|g = 3
}}
{{stub}}
'''FireWorld''' is a [[rule]] created in 2020 by [[Yoel Matveyev]].<ref name="post117140" /> Fireworld operates in the [[Moore neighborhood]]. Cells may have 4 states: empty, alive, dead and wire.

It's based on the older rule, which Matveyev discovered and started researching in 2001 and which he later nicknamed, somewhat confusingly, Fireworld with the small "w"<ref name="post99901" />. Its rule string is "'''03ajkr/2ak/3'''". That means the following:

*An empty cell becomes alive only if it is surrounded by one live cell horizontally or vertically adjacent to it, while one other cell is adjacent to it diagonally.
*A live cell survives either if there are no other live cells in its neighborhood or there are exactly three live cells adjacent to it in a particular way: two adjacent orthogonally (horizontally or vertically), while the third one is adjacent diagonally.
*Dead cells count as empty and do not interfere with birth or survival if they are present in the neighborhood. However, they do prevent a cell being born in their place, as usual in the "Generations" rules.
*A dead cell becomes empty in the next generation.

Due to a simple reaction that allows to use single dots as stable data bits and [[photon|photons]] as data carriers, this rule allows relatively easy logic circuitry construction and was proven by Matveyev in 2020 to be Turing-complete <ref name="post109135" />.

For more concise and faster logic circuitry, Matveyev invented a backward compatible superset of the original rule called FireWorld with the capital "W". It has the fourth state of immutable wires. Unlike the well known [[WireWorld]], signals in FireWorld can be carried on the wires' surface, according to the following additional definition:

*A live cell is born, if surrounded by 1 live cell or two live cells in either "2a" or "2k" position, and 2 or 3 wire cells. Dead cells are allowed in the neighborhood.

That means that in in order for 2 live cells to give birth next to 2 or 3 wire cells, one live cell must be in an orthogonal and the another one in a diagonal position. That matches the original pattern of "03ajkr/2ak/3".

Unlike [[WireWorld]], which can only use unstable logic, FireWorld can use dots as stable data, which turned out to be very useful for registers and data manipulation, largely eliminating synchronization issues and thus allowing scalable modular "hardware" architecture. Within a year after inventing the rule, Yoel Matveyev had built a large computer in it, called Izhora <ref name="post136309" />.

==See also==
*[[Izhora]]

==References==
<references>
<ref name="post99901">
{{LinkForumThread
|format=ref
|title=Fireworld (old historical rule)
|author=Yoel Matveyev
|p=99901
|date=July 1, 2020
}}
</ref>
<ref name="post117140">
{{LinkForumThread
|format=ref
|title=FireWorld
|author=Yoel Matveyev
|p=117140
|date=December 28th, 2020
}}
</ref>
<ref name="post109135">
{{LinkForumThread
|format=ref
|title=Re: Fireworld/Positronic
|author=Yoel Matveyev
|p=109135
|date=November 3rd, 2020
}}
</ref>
<ref name="post136309">
{{LinkForumThread
|format=ref
|title=Izhora (FireWorld/Fireworld2 computer)
|author=Yoel Matveyev
|p=136309
|date=October 5th, 2021
}}
</ref>

</references>
[[Category:Cellular automaton rules]]

Rule:ChainedLife5

2022-11-12T15:06:46Z

Yoel: Created page with "@RULE ChainedLife5 @COLORS 0 0 0 0 1 255 255 255 2 255 0 0 3 0 255 0 4 255 255 0 5 0 0 255 @TABLE # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 n_states:6 neighborhood:Moore symmetries:rotate4reflect var i={0,4} var j=i var k=i var l=i var m=i var n=i var o=i var p=i var I={1,2,3,5} var J=I var K=I var L=I var M=I var N=I var O=I var P=I var R={1,5} var a={0,1,2,3,5} var b=a var c=a var d=a var e=a var f=a var g=a var h=a var A={0,1,..."

@RULE ChainedLife5

@COLORS

0 0 0 0
1 255 255 255
2 255 0 0
3 0 255 0
4 255 255 0
5 0 0 255

@TABLE

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

n_states:6
neighborhood:Moore
symmetries:rotate4reflect

var i={0,4}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var I={1,2,3,5}
var J=I
var K=I
var L=I
var M=I
var N=I
var O=I
var P=I

var R={1,5}

var a={0,1,2,3,5}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

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 X=A

# Life

0,I,j,K,l,M,n,o,p,1
0,i,J,k,l,m,N,o,P,1
0,I,j,k,L,m,N,o,p,1
0,i,J,K,L,m,n,o,p,5
0,I,J,K,l,m,n,o,p,1
0,I,j,K,l,m,n,o,P,1
0,I,j,k,L,m,n,O,p,1
0,I,j,k,L,M,n,o,p,1
0,I,J,k,L,m,n,o,p,1
0,I,j,k,L,m,n,o,P,1

R,I,j,K,l,M,n,o,p,1
R,i,J,k,l,m,N,o,P,1
R,I,j,k,L,m,N,o,p,1
R,i,J,K,L,m,n,o,p,1
R,I,J,K,l,m,n,o,p,1
R,I,j,K,l,m,n,o,P,1
R,I,j,k,L,m,n,O,p,1
R,I,j,k,L,M,n,o,p,1
R,I,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,P,1

R,I,j,K,l,m,n,o,p,1
R,i,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,p,1
R,I,J,k,l,m,n,o,p,1
R,i,J,k,l,m,N,o,p,1
R,I,j,k,l,M,n,o,p,1

# Photon

0,2,b,c,d,e,f,g,h,2

# Diaphoton

0,0,3,0,0,0,0,0,0,3
0,3,B,C,D,E,F,G,H,4

# Photon birth

0,5,j,k,1,1,1,o,p,2

# Diaphoton birth

0,2,C,2,D,E,F,G,H,3

# Clean up

2,A,B,C,D,E,F,G,H,4
3,A,B,C,D,E,F,G,H,4
4,A,B,C,D,E,F,G,H,0
X,A,B,C,D,E,F,G,H,0

Rule:ChainedLife4

2022-11-12T15:06:16Z

Yoel: Created page with "@RULE ChainedLife4 @COLORS 0 0 0 0 1 255 255 255 2 255 0 0 3 0 255 0 4 255 255 0 5 0 0 255 @TABLE # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 n_states:6 neighborhood:Moore symmetries:rotate4reflect var i={0,4} var j=i var k=i var l=i var m=i var n=i var o=i var p=i var I={1,2,3,5} var J=I var K=I var L=I var M=I var N=I var O=I var P=I var R={1,5} var a={0,1,2,3,5} var b=a var c=a var d=a var e=a var f=a var g=a var h=a var A={0,1,..."

@RULE ChainedLife4

@COLORS

0 0 0 0
1 255 255 255
2 255 0 0
3 0 255 0
4 255 255 0
5 0 0 255

@TABLE

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

n_states:6
neighborhood:Moore
symmetries:rotate4reflect

var i={0,4}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var I={1,2,3,5}
var J=I
var K=I
var L=I
var M=I
var N=I
var O=I
var P=I

var R={1,5}

var a={0,1,2,3,5}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

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 X=A

# Photon birth

0,5,j,k,1,m,1,o,p,2

# Life

0,I,j,K,l,M,n,o,p,1
0,i,J,k,l,m,N,o,P,1
0,I,j,k,L,m,N,o,p,5
0,i,J,K,L,m,n,o,p,1
0,I,J,K,l,m,n,o,p,1
0,I,j,K,l,m,n,o,P,1
0,I,j,k,L,m,n,O,p,1
0,I,j,k,L,M,n,o,p,1
0,I,J,k,L,m,n,o,p,1
0,I,j,k,L,m,n,o,P,1

R,I,j,K,l,M,n,o,p,1
R,i,J,k,l,m,N,o,P,1
R,I,j,k,L,m,N,o,p,1
R,i,J,K,L,m,n,o,p,1
R,I,J,K,l,m,n,o,p,1
R,I,j,K,l,m,n,o,P,1
R,I,j,k,L,m,n,O,p,1
R,I,j,k,L,M,n,o,p,1
R,I,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,P,1

R,I,j,K,l,m,n,o,p,1
R,i,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,p,1
R,I,J,k,l,m,n,o,p,1
R,i,J,k,l,m,N,o,p,1
R,I,j,k,l,M,n,o,p,1

# Photon

0,2,b,c,d,e,f,g,h,2

# Diaphoton

0,0,3,0,0,0,0,0,0,3
0,3,B,C,D,E,F,G,H,4

# Diaphoton birth

0,2,C,2,D,E,F,G,H,3

# Clean up

2,A,B,C,D,E,F,G,H,4
3,A,B,C,D,E,F,G,H,4
4,A,B,C,D,E,F,G,H,0
X,A,B,C,D,E,F,G,H,0

Rule:ChainedLife3

2022-11-12T15:05:42Z

Yoel: Created page with "@RULE ChainedLife3 @COLORS 0 0 0 0 1 255 255 255 2 255 0 0 3 0 255 0 4 255 255 0 5 0 0 255 @TABLE # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 n_states:6 neighborhood:Moore symmetries:rotate4reflect var i={0,4} var j=i var k=i var l=i var m=i var n=i var o=i var p=i var I={1,2,3,5} var J=I var K=I var L=I var M=I var N=I var O=I var P=I var R={1,5} var a={0,1,2,3,5} var b=a var c=a var d=a var e=a var f=a var g=a var h=a var A={0,1,..."

@RULE ChainedLife3

@COLORS

0 0 0 0
1 255 255 255
2 255 0 0
3 0 255 0
4 255 255 0
5 0 0 255

@TABLE

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

n_states:6
neighborhood:Moore
symmetries:rotate4reflect

var i={0,4}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var I={1,2,3,5}
var J=I
var K=I
var L=I
var M=I
var N=I
var O=I
var P=I

var R={1,5}

var a={0,1,2,3,5}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

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 X=A

# Photon birth

0,5,j,1,l,m,n,1,p,2

# Life

0,I,j,K,l,M,n,o,p,5
0,i,J,k,l,m,N,o,P,1
0,I,j,k,L,m,N,o,p,1
0,i,J,K,L,m,n,o,p,1
0,I,J,K,l,m,n,o,p,1
0,I,j,K,l,m,n,o,P,1
0,I,j,k,L,m,n,O,p,1
0,I,j,k,L,M,n,o,p,1
0,I,J,k,L,m,n,o,p,1
0,I,j,k,L,m,n,o,P,1

R,I,j,K,l,M,n,o,p,1
R,i,J,k,l,m,N,o,P,1
R,I,j,k,L,m,N,o,p,1
R,i,J,K,L,m,n,o,p,1
R,I,J,K,l,m,n,o,p,1
R,I,j,K,l,m,n,o,P,1
R,I,j,k,L,m,n,O,p,1
R,I,j,k,L,M,n,o,p,1
R,I,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,P,1

R,I,j,K,l,m,n,o,p,1
R,i,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,p,1
R,I,J,k,l,m,n,o,p,1
R,i,J,k,l,m,N,o,p,1
R,I,j,k,l,M,n,o,p,1

# Photon

0,2,b,c,d,e,f,g,h,2

# Diaphoton

0,0,3,0,0,0,0,0,0,3
0,3,B,C,D,E,F,G,H,4

# Diaphoton birth

0,2,C,2,D,E,F,G,H,3

# Clean up

2,A,B,C,D,E,F,G,H,4
3,A,B,C,D,E,F,G,H,4
4,A,B,C,D,E,F,G,H,0
X,A,B,C,D,E,F,G,H,0

Rule:ChainedLife2

2022-11-12T15:05:09Z

Yoel: Created page with "@RULE ChainedLife2 @COLORS 0 0 0 0 1 255 255 255 2 255 0 0 3 0 255 0 4 255 255 0 5 0 0 255 @TABLE # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 n_states:6 neighborhood:Moore symmetries:rotate4reflect var i={0,4} var j=i var k=i var l=i var m=i var n=i var o=i var p=i var I={1,2,3,5} var J=I var K=I var L=I var M=I var N=I var O=I var P=I var R={1,5} var a={0,1,2,3,5} var b=a var c=a var d=a var e=a var f=a var g=a var h=a var A={0,1,..."

@RULE ChainedLife2

@COLORS

0 0 0 0
1 255 255 255
2 255 0 0
3 0 255 0
4 255 255 0
5 0 0 255

@TABLE

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

n_states:6
neighborhood:Moore
symmetries:rotate4reflect

var i={0,4}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var I={1,2,3,5}
var J=I
var K=I
var L=I
var M=I
var N=I
var O=I
var P=I

var R={1,5}

var a={0,1,2,3,5}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

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 X=A

# Photon birth

0,i,5,k,l,1,n,1,p,2

# Life

0,I,j,K,l,M,n,o,p,1
0,i,J,k,l,m,N,o,P,1
0,I,j,k,L,m,N,o,p,1
0,i,J,K,L,m,n,o,p,1
0,I,J,K,l,m,n,o,p,1
0,I,j,K,l,m,n,o,P,1
0,I,j,k,L,m,n,O,p,5
0,I,j,k,L,M,n,o,p,1
0,I,J,k,L,m,n,o,p,1
0,I,j,k,L,m,n,o,P,1

R,I,j,K,l,M,n,o,p,1
R,i,J,k,l,m,N,o,P,1
R,I,j,k,L,m,N,o,p,1
R,i,J,K,L,m,n,o,p,1
R,I,J,K,l,m,n,o,p,1
R,I,j,K,l,m,n,o,P,1
R,I,j,k,L,m,n,O,p,1
R,I,j,k,L,M,n,o,p,1
R,I,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,P,1

R,I,j,K,l,m,n,o,p,1
R,i,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,p,1
R,I,J,k,l,m,n,o,p,1
R,i,J,k,l,m,N,o,p,1
R,I,j,k,l,M,n,o,p,1

# Photon

0,2,b,c,d,e,f,g,h,2

# Diaphoton

0,0,3,0,0,0,0,0,0,3
0,3,B,C,D,E,F,G,H,4

# Diaphoton birth

0,2,C,2,D,E,F,G,H,3

# Clean up

2,A,B,C,D,E,F,G,H,4
3,A,B,C,D,E,F,G,H,4
4,A,B,C,D,E,F,G,H,0
X,A,B,C,D,E,F,G,H,0

Rule:ChainedLife1

2022-11-12T15:04:37Z

Yoel: Created page with "@RULE ChainedLife1 @COLORS 0 0 0 0 1 255 255 255 2 255 0 0 3 0 255 0 4 255 255 0 5 0 0 255 @TABLE # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 n_states:6 neighborhood:Moore symmetries:rotate4reflect var i={0,4} var j=i var k=i var l=i var m=i var n=i var o=i var p=i var I={1,2,3,5} var J=I var K=I var L=I var M=I var N=I var O=I var P=I var R={1,5} var a={0,1,2,3,5} var b=a var c=a var d=a var e=a var f=a var g=a var h=a var A={0,1,..."

@RULE ChainedLife1

@COLORS

0 0 0 0
1 255 255 255
2 255 0 0
3 0 255 0
4 255 255 0
5 0 0 255

@TABLE

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

n_states:6
neighborhood:Moore
symmetries:rotate4reflect

var i={0,4}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var I={1,2,3,5}
var J=I
var K=I
var L=I
var M=I
var N=I
var O=I
var P=I

var R={1,5}

var a={0,1,2,3,5}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

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 X=A

# Life

0,I,j,K,l,M,n,o,p,1
0,i,J,k,l,m,N,o,P,1
0,I,j,k,L,m,N,o,p,1
0,i,J,K,L,m,n,o,p,1
0,I,J,K,l,m,n,o,p,1
0,I,j,K,l,m,n,o,P,1
0,I,j,k,L,m,n,O,p,5
0,I,j,k,L,M,n,o,p,1
0,I,J,k,L,m,n,o,p,1
0,I,j,k,L,m,n,o,P,1

R,I,j,K,l,M,n,o,p,1
R,i,J,k,l,m,N,o,P,1
R,I,j,k,L,m,N,o,p,1
R,i,J,K,L,m,n,o,p,1
R,I,J,K,l,m,n,o,p,1
R,I,j,K,l,m,n,o,P,1
R,I,j,k,L,m,n,O,p,1
R,I,j,k,L,M,n,o,p,1
R,I,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,P,1

R,I,j,K,l,m,n,o,p,1
R,i,J,k,L,m,n,o,p,1
R,I,j,k,L,m,n,o,p,1
R,I,J,k,l,m,n,o,p,1
R,i,J,k,l,m,N,o,p,1
R,I,j,k,l,M,n,o,p,1

# Photon

0,2,b,c,d,e,f,g,h,2

# Diaphoton

0,0,3,0,0,0,0,0,0,3
0,3,B,C,D,E,F,G,H,4

# Photon birth

0,i,5,k,l,1,1,1,p,2

# Diaphoton birth

0,2,C,2,D,E,F,G,H,3

# Clean up

2,A,B,C,D,E,F,G,H,4
3,A,B,C,D,E,F,G,H,4
4,A,B,C,D,E,F,G,H,0
X,A,B,C,D,E,F,G,H,0

Rule:Esoteric Puffer

2022-11-06T06:28:09Z

Yoel: Created page with "@RULE Esoteric_Puffer @COLORS 0 0 0 0 1 255 255 255 2 255 0 0 3 0 255 0 4 255 255 0 @TABLE # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 n_states:5 neighborhood:Moore symmetries:rotate4reflect var i={0,4} var j=i var k=i var l=i var m=i var n=i var o=i var p=i var I={1} var J=I var K=I var L=I var M=I var N=I var O=I var P=I var a={0,1,2,3} var b=a var c=a var d=a var e=a var f=a var g=a var h=a var A={0,1,2,3,4} var B=A var C=A var D=..."

@RULE Esoteric_Puffer

@COLORS

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

@TABLE

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

n_states:5
neighborhood:Moore
symmetries:rotate4reflect

var i={0,4}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var I={1}
var J=I
var K=I
var L=I
var M=I
var N=I
var O=I
var P=I

var a={0,1,2,3}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var A={0,1,2,3,4}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A
var X=A

# Life

0,I,j,K,l,M,n,o,p,1
0,i,J,k,l,m,N,o,P,1
0,I,j,k,L,m,N,o,p,1
0,i,J,K,L,m,n,o,p,1
0,I,J,K,l,m,n,o,p,1
0,I,j,K,l,m,n,o,P,1
0,I,j,k,L,m,n,O,p,1
0,I,j,k,L,M,n,o,p,1
0,I,J,k,L,m,n,o,p,1
0,I,j,k,L,m,n,o,P,1

1,I,j,K,l,M,n,o,p,1
1,i,J,k,l,m,N,o,P,1
1,I,j,k,L,m,N,o,p,1
1,i,J,K,L,m,n,o,p,1
1,I,J,K,l,m,n,o,p,1
1,I,j,K,l,m,n,o,P,1
1,I,j,k,L,m,n,O,p,1
1,I,j,k,L,M,n,o,p,1
1,I,J,k,L,m,n,o,p,1
1,I,j,k,L,m,n,o,P,1

1,I,j,K,l,m,n,o,p,1
1,i,J,k,L,m,n,o,p,1
1,I,j,k,L,m,n,o,p,1
1,I,J,k,l,m,n,o,p,1
1,i,J,k,l,m,N,o,p,1
1,I,j,k,l,M,n,o,p,1

# Photon

0,2,b,c,d,e,f,g,h,2

# Diaphoton

0,0,3,0,0,0,0,0,0,3
0,3,B,C,D,E,F,G,H,4

# Photon birth

0,i,1,k,1,m,1,o,1,2

# Diaphoton birth

0,2,C,2,D,E,F,G,H,3

2,A,B,C,D,E,F,G,H,4
3,A,B,C,D,E,F,G,H,4
4,A,B,C,D,E,F,G,H,0
X,A,B,C,D,E,F,G,H,0

Rule:FireWorld+

2022-10-14T02:59:38Z

Yoel:

@RULE FireWorld+

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

# This rule is a combination of two rules: FireWorld and a variety of Diaphotons.
# The idea to combine these rules was partially inspired by Brian Prentice's rule Mites.

# FireWorld is the redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# FireWorld is a hybrid rule combining 03ajkr/2ak/3 and a wiring system, in which "electrons" run
# on the wires' surface. It is fully backward compatible with the old Fireworld.

# Being fully backward compatible with Fireworld, FireWorld adds two additional states:
# Diaphpotons (green) and diaphoton triggers (white).

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the "speed of light":
# A diaphoton cell never survives and is only born if it has exactly 1 diaphoton neighbor in diagonal;
# Cells horizontally adjacent to this diaphoton neighbor must be empty or diaphoton triggers.
# Two horizontally adjacent green cells become yellow.
# An empty cell with exactly 1 horizontal diaphoton becomes yellow.

# A red cell is born, if surrounded by 2 red of 2 green cells in either "a" or "k" position.
# If dying, both red and green cells become yellow (generation 2).

# As in FireWorld, wires are implemented as the fourth, immutable state 3. The wiring rule is as follows:

# A red (electron) cell is born, if surrounded by 2 or 3 wire cells and by 2 red or 2 green cells;
# These 2 cells must be in either "a" or "k" position, to match the "2ak" behavior of Fireworld.

# A green cell is born, if an empty cell is surrounded by exactly 1 photon cell and 1 diaphoton trigger cell.

# Yellow (dying) or white (diaphoton trigger) cells count for birth or survival as empty.

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 255 255 255

@TABLE

n_states:6
neighborhood:Moore
symmetries:rotate4reflect
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 i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var L={1,4}

var x={0,5}
var y=x

# Modified original 2001 Fireworld

0,L,L,k,l,m,n,o,p,1
0,L,j,k,L,m,n,o,p,1

1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1

# Diaphotons

0,x,4,y,l,m,n,o,p,4
0,4,j,k,l,m,n,o,p,2
4,4,j,k,l,m,n,o,p,2

# A computer-generated list of all possible living cell and wire cell positions

0,i,j,L,l,m,3,o,3,1
0,i,j,3,3,m,n,L,p,1
0,i,j,3,l,L,n,3,p,1
0,i,j,3,l,L,n,o,3,1
0,i,j,3,l,3,n,L,p,1
0,i,j,3,l,3,n,o,L,1
0,i,j,3,l,m,3,o,L,1
0,i,j,3,l,m,n,L,3,1
0,i,j,3,l,m,n,3,L,1
0,i,j,k,3,3,n,o,L,1
0,i,j,k,3,m,L,o,3,1
0,i,j,k,3,m,3,o,L,1
0,i,j,k,3,m,n,L,3,1
0,i,j,k,3,m,n,3,L,1
0,i,j,k,l,L,3,o,3,1
0,i,j,k,l,L,n,3,3,1
0,i,j,k,l,3,L,3,p,1
0,i,j,k,l,3,L,o,3,1
0,i,j,k,l,3,3,L,p,1
0,i,j,k,l,3,3,o,L,1
0,i,j,k,l,3,n,L,3,1
0,i,j,k,l,3,n,3,L,1
0,i,j,k,l,m,3,L,3,1
0,i,j,k,l,m,3,3,L,1

0,3,j,3,l,3,n,L,p,1
0,i,3,k,3,m,3,o,L,1
0,i,j,L,3,m,3,o,3,1
0,i,j,L,l,3,3,o,3,1
0,i,j,L,l,3,n,3,3,1
0,i,j,L,l,m,3,3,3,1
0,i,j,3,L,3,n,o,3,1
0,i,j,3,L,m,3,o,3,1
0,i,j,3,3,L,n,o,3,1
0,i,j,3,3,3,n,L,p,1
0,i,j,3,3,3,n,o,L,1
0,i,j,3,3,m,L,3,p,1
0,i,j,3,3,m,L,o,3,1
0,i,j,3,3,m,3,L,p,1
0,i,j,3,3,m,3,o,L,1
0,i,j,3,3,m,n,L,3,1
0,i,j,3,3,m,n,3,L,1
0,i,j,3,l,L,3,3,p,1
0,i,j,3,l,L,3,o,3,1
0,i,j,3,l,L,n,3,3,1
0,i,j,3,l,3,L,3,p,1
0,i,j,3,l,3,L,o,3,1
0,i,j,3,l,3,3,L,p,1
0,i,j,3,l,3,3,o,L,1
0,i,j,3,l,3,n,L,3,1
0,i,j,3,l,3,n,3,L,1
0,i,j,3,l,m,3,L,3,1
0,i,j,3,l,m,3,3,L,1
0,i,j,k,3,3,3,o,L,1
0,i,j,k,3,3,n,L,3,1
0,i,j,k,3,3,n,3,L,1
0,i,j,k,3,m,L,3,3,1
0,i,j,k,3,m,3,L,3,1
0,i,j,k,3,m,3,3,L,1
0,i,j,k,l,L,3,3,3,1
0,i,j,k,l,3,L,3,3,1
0,i,j,k,l,3,3,L,3,1
0,i,j,k,l,3,3,3,L,1

0,i,j,L,3,m,L,o,3,1
0,i,j,L,3,m,3,o,L,1
0,i,j,L,l,3,n,3,L,1
0,i,j,L,l,3,L,o,3,1
0,i,j,L,l,3,3,o,L,1
0,i,j,L,l,m,3,3,L,1
0,i,j,L,L,m,3,o,3,1
0,i,j,3,l,L,3,o,L,1
0,i,j,3,l,L,n,3,L,1
0,i,j,3,l,L,L,o,3,1
0,i,j,3,l,3,n,L,L,1
0,i,j,3,l,3,L,L,p,1
0,i,j,3,l,m,3,L,L,1
0,i,j,3,L,3,n,L,p,1
0,i,j,3,L,m,3,L,p,1
0,i,j,3,L,m,n,L,3,1
0,i,j,3,L,L,n,3,p,1
0,i,j,3,L,L,n,o,3,1
0,i,j,3,3,m,L,L,p,1
0,i,j,3,3,m,n,L,L,1
0,i,j,3,3,L,n,o,L,1
0,i,j,k,3,m,3,L,L,1
0,i,j,k,3,L,3,o,L,1
0,i,j,k,3,L,n,3,L,1
0,i,j,k,3,L,L,o,3,1
0,i,j,k,3,3,n,L,L,1
0,i,j,k,l,L,3,3,L,1
0,i,j,k,l,L,L,3,3,1
0,i,j,k,l,3,L,L,3,1
0,i,j,k,l,3,3,L,L,1

0,3,L,3,l,3,n,L,p,1
0,3,L,L,l,3,n,3,p,1
0,i,3,L,3,m,3,o,L,1
0,i,3,L,l,3,n,3,L,1
0,i,3,L,l,3,L,o,3,1
0,i,3,L,L,m,3,o,3,1
0,i,3,3,l,L,3,o,L,1
0,i,3,3,l,L,n,3,L,1
0,i,3,3,l,L,L,o,3,1
0,i,3,3,l,3,n,L,L,1
0,i,j,L,3,m,L,3,3,1
0,i,j,L,3,m,3,3,L,1
0,i,j,L,3,3,n,3,L,1
0,i,j,L,3,3,L,o,3,1
0,i,j,L,3,3,3,o,L,1
0,i,j,L,l,3,L,3,3,1
0,i,j,L,l,3,3,3,L,1
0,i,j,L,L,3,n,3,3,1
0,i,j,L,L,3,3,o,3,1
0,i,j,L,L,m,3,3,3,1
0,i,j,3,l,L,3,3,L,1
0,i,j,3,l,L,L,3,3,1
0,i,j,3,l,3,L,L,3,1
0,i,j,3,l,3,3,L,L,1
0,i,j,3,L,3,n,L,3,1
0,i,j,3,L,3,3,L,p,1
0,i,j,3,L,m,3,L,3,1
0,i,j,3,L,L,3,o,3,1
0,i,j,3,L,L,n,3,3,1
0,i,j,3,3,m,L,L,3,1
0,i,j,3,3,m,3,L,L,1
0,i,j,3,3,L,3,o,L,1
0,i,j,3,3,L,n,3,L,1
0,i,j,3,3,L,L,3,p,1
0,i,j,3,3,L,L,o,3,1
0,i,j,3,3,3,n,L,L,1
0,i,j,3,3,3,L,L,p,1
0,i,j,k,3,L,3,3,L,1
0,i,j,k,3,3,L,L,3,1
0,i,j,k,3,3,3,L,L,1

# One red cell and a diaphoton trigger cell give birth to a diaphoton.

0,5,1,k,l,m,n,o,p,4
0,1,5,k,l,m,n,o,p,4
0,5,j,1,l,m,n,o,p,4
0,i,1,k,5,m,n,o,p,4
0,1,j,k,5,m,n,o,p,4
0,5,j,k,1,m,n,o,p,4
0,5,j,k,l,1,n,o,p,4
0,i,5,k,l,m,1,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld+

2022-09-25T08:56:08Z

Yoel:

@RULE FireWorld+

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

# This rule is a combination of two rules: FireWorld and a variety of Diaphotons.
# The idea to combine these rules was partially inspired by Brian Prentice's rule Mites.

# FireWorld is the redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# FireWorld is a hybrid rule combining 03ajkr/2ak/3 and a wiring system, in which "electrons" run
# on the wires' surface. It is fully backward compatible with the old Fireworld.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the "speed of light":
# A diaphoton cell never survives and is only born if it has exactly 1 diaphoton neighbor in diagonal;
# Cells horizontally adjacent to this diaphoton neighbor must be empty or diaphoton triggers.
# Two horizontally adjacent green cells become yellow.
# An empty cell with exactly 1 horizontal diaphoton becomes yellow.

# Being fully backward compatible with Fireworld, FireWorld adds two additional states:
# Diaphpotons (green) and diaphoton triggers (white).

# A red cells is born, if surrounded by 2 red of green cells in any combination in either "a" or "k" position.
# This generalized the original 2ak behavior. If dying, both red and green cells become yellow (generation 2).

# As in FireWorld, wires are implemented as the fourth, immutable state 3. The wiring rule is as follows:

# A red (electron) cell is born, if surrounded by 2 or 3 wire cells and by 1 or 2 live (red or green) cells;
# 2 live cells must be in either "a" or "k" position, to match the "2ak" behavior of Fireworld.

# A green cell is born, if an empty cell is surrounded by exactly 1 photon cell and 1 diaphoton trigger cell.

# Yellow (dying) or white (diaphoton trigger) cells count for birth or survival as empty.

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 255 255 255

@TABLE

n_states:6
neighborhood:Moore
symmetries:rotate4reflect
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 i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var L={1,4}
var L2=L

var x={0,5}
var y=x

# Modified original 2001 Fireworld

0,L,L2,k,l,m,n,o,p,1
0,L,j,k,L2,m,n,o,p,1

1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1

# Diaphotons

0,x,4,y,l,m,n,o,p,4
0,4,j,k,l,m,n,o,p,2
4,4,j,k,l,m,n,o,p,2

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,L,l,m,3,o,3,1
0,i,j,3,3,m,n,L,p,1
0,i,j,3,l,L,n,3,p,1
0,i,j,3,l,L,n,o,3,1
0,i,j,3,l,3,n,L,p,1
0,i,j,3,l,3,n,o,L,1
0,i,j,3,l,m,3,o,L,1
0,i,j,3,l,m,n,L,3,1
0,i,j,3,l,m,n,3,L,1
0,i,j,k,3,3,n,o,L,1
0,i,j,k,3,m,L,o,3,1
0,i,j,k,3,m,3,o,L,1
0,i,j,k,3,m,n,L,3,1
0,i,j,k,3,m,n,3,L,1
0,i,j,k,l,L,3,o,3,1
0,i,j,k,l,L,n,3,3,1
0,i,j,k,l,3,L,3,p,1
0,i,j,k,l,3,L,o,3,1
0,i,j,k,l,3,3,L,p,1
0,i,j,k,l,3,3,o,L,1
0,i,j,k,l,3,n,L,3,1
0,i,j,k,l,3,n,3,L,1
0,i,j,k,l,m,3,L,3,1
0,i,j,k,l,m,3,3,L,1

0,3,j,3,l,3,n,L,p,1
0,i,3,k,3,m,3,o,L,1
0,i,j,L,3,m,3,o,3,1
0,i,j,L,l,3,3,o,3,1
0,i,j,L,l,3,n,3,3,1
0,i,j,L,l,m,3,3,3,1
0,i,j,3,L,3,n,o,3,1
0,i,j,3,L,m,3,o,3,1
0,i,j,3,3,L,n,o,3,1
0,i,j,3,3,3,n,L,p,1
0,i,j,3,3,3,n,o,L,1
0,i,j,3,3,m,L,3,p,1
0,i,j,3,3,m,L,o,3,1
0,i,j,3,3,m,3,L,p,1
0,i,j,3,3,m,3,o,L,1
0,i,j,3,3,m,n,L,3,1
0,i,j,3,3,m,n,3,L,1
0,i,j,3,l,L,3,3,p,1
0,i,j,3,l,L,3,o,3,1
0,i,j,3,l,L,n,3,3,1
0,i,j,3,l,3,L,3,p,1
0,i,j,3,l,3,L,o,3,1
0,i,j,3,l,3,3,L,p,1
0,i,j,3,l,3,3,o,L,1
0,i,j,3,l,3,n,L,3,1
0,i,j,3,l,3,n,3,L,1
0,i,j,3,l,m,3,L,3,1
0,i,j,3,l,m,3,3,L,1
0,i,j,k,3,3,3,o,L,1
0,i,j,k,3,3,n,L,3,1
0,i,j,k,3,3,n,3,L,1
0,i,j,k,3,m,L,3,3,1
0,i,j,k,3,m,3,L,3,1
0,i,j,k,3,m,3,3,L,1
0,i,j,k,l,L,3,3,3,1
0,i,j,k,l,3,L,3,3,1
0,i,j,k,l,3,3,L,3,1
0,i,j,k,l,3,3,3,L,1

0,i,j,L,3,m,L,o,3,1
0,i,j,L,3,m,3,o,L,1
0,i,j,L,l,3,n,3,L,1
0,i,j,L,l,3,L,o,3,1
0,i,j,L,l,3,3,o,L,1
0,i,j,L,l,m,3,3,L,1
0,i,j,L,L,m,3,o,3,1
0,i,j,3,l,L,3,o,L,1
0,i,j,3,l,L,n,3,L,1
0,i,j,3,l,L,L,o,3,1
0,i,j,3,l,3,n,L,L,1
0,i,j,3,l,3,L,L,p,1
0,i,j,3,l,m,3,L,L,1
0,i,j,3,L,3,n,L,p,1
0,i,j,3,L,m,3,L,p,1
0,i,j,3,L,m,n,L,3,1
0,i,j,3,L,L,n,3,p,1
0,i,j,3,L,L,n,o,3,1
0,i,j,3,3,m,L,L,p,1
0,i,j,3,3,m,n,L,L,1
0,i,j,3,3,L,n,o,L,1
0,i,j,k,3,m,3,L,L,1
0,i,j,k,3,L,3,o,L,1
0,i,j,k,3,L,n,3,L,1
0,i,j,k,3,L,L,o,3,1
0,i,j,k,3,3,n,L,L,1
0,i,j,k,l,L,3,3,L,1
0,i,j,k,l,L,L,3,3,1
0,i,j,k,l,3,L,L,3,1
0,i,j,k,l,3,3,L,L,1

0,3,L,3,l,3,n,L,p,1
0,3,L,L,l,3,n,3,p,1
0,i,3,L,3,m,3,o,L,1
0,i,3,L,l,3,n,3,L,1
0,i,3,L,l,3,L,o,3,1
0,i,3,L,L,m,3,o,3,1
0,i,3,3,l,L,3,o,L,1
0,i,3,3,l,L,n,3,L,1
0,i,3,3,l,L,L,o,3,1
0,i,3,3,l,3,n,L,L,1
0,i,j,L,3,m,L,3,3,1
0,i,j,L,3,m,3,3,L,1
0,i,j,L,3,3,n,3,L,1
0,i,j,L,3,3,L,o,3,1
0,i,j,L,3,3,3,o,L,1
0,i,j,L,l,3,L,3,3,1
0,i,j,L,l,3,3,3,L,1
0,i,j,L,L,3,n,3,3,1
0,i,j,L,L,3,3,o,3,1
0,i,j,L,L,m,3,3,3,1
0,i,j,3,l,L,3,3,L,1
0,i,j,3,l,L,L,3,3,1
0,i,j,3,l,3,L,L,3,1
0,i,j,3,l,3,3,L,L,1
0,i,j,3,L,3,n,L,3,1
0,i,j,3,L,3,3,L,p,1
0,i,j,3,L,m,3,L,3,1
0,i,j,3,L,L,3,o,3,1
0,i,j,3,L,L,n,3,3,1
0,i,j,3,3,m,L,L,3,1
0,i,j,3,3,m,3,L,L,1
0,i,j,3,3,L,3,o,L,1
0,i,j,3,3,L,n,3,L,1
0,i,j,3,3,L,L,3,p,1
0,i,j,3,3,L,L,o,3,1
0,i,j,3,3,3,n,L,L,1
0,i,j,3,3,3,L,L,p,1
0,i,j,k,3,L,3,3,L,1
0,i,j,k,3,3,L,L,3,1
0,i,j,k,3,3,3,L,L,1

# One red cell and a diaphoton trigger cell give birth to a diaphoton.

0,5,1,k,l,m,n,o,p,4
0,1,5,k,l,m,n,o,p,4
0,5,j,1,l,m,n,o,p,4
0,i,1,k,5,m,n,o,p,4
0,1,j,k,5,m,n,o,p,4
0,5,j,k,1,m,n,o,p,4
0,5,j,k,l,1,n,o,p,4
0,i,5,k,l,m,1,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld+

2022-09-25T08:39:54Z

Yoel:

@RULE FireWorld+

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

# This rule is a combination of two rules: FireWorld and a variety of Diaphotons.
# The idea to combine these rules was partially inspired by Brian Prentice's rule Mites.

# FireWorld is the redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# FireWorld is a hybrid rule combining 03ajkr/2ak/3 and a wiring system, in which "electrons" run
# on the wires' surface. It is fully backward compatible with the old Fireworld.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the "speed of light":
# A diaphoton cell never survives and is only born if it has exactly 1 diaphoton neighbor in diagonal;
# Cells horizontally adjacent to this diaphoton neighbor must be empty or diaphoton triggers.
# Two horizontally adjacent green cells become yellow.
# An empty cell with exactly 1 horizontal diaphoton becomes yellow.

# Being fully backward compatible with Fireworld, FireWorld adds two additional states:
# Diaphpotons (green) and diaphoton triggers (white).

# A red cells is born, if surrounded by 2 red of green cells in any combination in either "a" or "k" position.
# This generalized the original 2ak behavior. If dying, both red and green cells become yellow (generation 2).

# As in FireWorld, wires are implemented as the fourth, immutable state 3. The wiring rule is as follows:

# A red (electron) cell is born, if surrounded by 2 or 3 wire cells and by 1 or 2 live (red or green) cells;
# 2 live cells must be in either "a" or "k" position, to match the "2ak" behavior of Fireworld.

# A green cell is born, if an empty cell is surrounded by exactly 1 photon cell and 1 diaphoton trigger cell.

# Yellow (dying) or white (diaphoton trigger) cells count for birth or survival as empty.

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 255 255 255

@TABLE

n_states:6
neighborhood:Moore
symmetries:rotate4reflect
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 i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

var L={1,4}
var L2=L

var x={0,5}
var y=x

# Modified original 2001 Fireworld

0,L,L2,k,l,m,n,o,p,1
0,L,j,k,L2,m,n,o,p,1

1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1

# Diaphtons

0,x,4,y,l,m,n,o,p,4
0,4,j,k,l,m,n,o,p,2
4,4,j,k,l,m,n,o,p,2

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,L,l,m,3,o,3,1
0,i,j,3,3,m,n,L,p,1
0,i,j,3,l,L,n,3,p,1
0,i,j,3,l,L,n,o,3,1
0,i,j,3,l,3,n,L,p,1
0,i,j,3,l,3,n,o,L,1
0,i,j,3,l,m,3,o,L,1
0,i,j,3,l,m,n,L,3,1
0,i,j,3,l,m,n,3,L,1
0,i,j,k,3,3,n,o,L,1
0,i,j,k,3,m,L,o,3,1
0,i,j,k,3,m,3,o,L,1
0,i,j,k,3,m,n,L,3,1
0,i,j,k,3,m,n,3,L,1
0,i,j,k,l,L,3,o,3,1
0,i,j,k,l,L,n,3,3,1
0,i,j,k,l,3,L,3,p,1
0,i,j,k,l,3,L,o,3,1
0,i,j,k,l,3,3,L,p,1
0,i,j,k,l,3,3,o,L,1
0,i,j,k,l,3,n,L,3,1
0,i,j,k,l,3,n,3,L,1
0,i,j,k,l,m,3,L,3,1
0,i,j,k,l,m,3,3,L,1

0,3,j,3,l,3,n,L,p,1
0,i,3,k,3,m,3,o,L,1
0,i,j,L,3,m,3,o,3,1
0,i,j,L,l,3,3,o,3,1
0,i,j,L,l,3,n,3,3,1
0,i,j,L,l,m,3,3,3,1
0,i,j,3,L,3,n,o,3,1
0,i,j,3,L,m,3,o,3,1
0,i,j,3,3,L,n,o,3,1
0,i,j,3,3,3,n,L,p,1
0,i,j,3,3,3,n,o,L,1
0,i,j,3,3,m,L,3,p,1
0,i,j,3,3,m,L,o,3,1
0,i,j,3,3,m,3,L,p,1
0,i,j,3,3,m,3,o,L,1
0,i,j,3,3,m,n,L,3,1
0,i,j,3,3,m,n,3,L,1
0,i,j,3,l,L,3,3,p,1
0,i,j,3,l,L,3,o,3,1
0,i,j,3,l,L,n,3,3,1
0,i,j,3,l,3,L,3,p,1
0,i,j,3,l,3,L,o,3,1
0,i,j,3,l,3,3,L,p,1
0,i,j,3,l,3,3,o,L,1
0,i,j,3,l,3,n,L,3,1
0,i,j,3,l,3,n,3,L,1
0,i,j,3,l,m,3,L,3,1
0,i,j,3,l,m,3,3,L,1
0,i,j,k,3,3,3,o,L,1
0,i,j,k,3,3,n,L,3,1
0,i,j,k,3,3,n,3,L,1
0,i,j,k,3,m,L,3,3,1
0,i,j,k,3,m,3,L,3,1
0,i,j,k,3,m,3,3,L,1
0,i,j,k,l,L,3,3,3,1
0,i,j,k,l,3,L,3,3,1
0,i,j,k,l,3,3,L,3,1
0,i,j,k,l,3,3,3,L,1

0,i,j,L,3,m,L,o,3,1
0,i,j,L,3,m,3,o,L,1
0,i,j,L,l,3,n,3,L,1
0,i,j,L,l,3,L,o,3,1
0,i,j,L,l,3,3,o,L,1
0,i,j,L,l,m,3,3,L,1
0,i,j,L,L,m,3,o,3,1
0,i,j,3,l,L,3,o,L,1
0,i,j,3,l,L,n,3,L,1
0,i,j,3,l,L,L,o,3,1
0,i,j,3,l,3,n,L,L,1
0,i,j,3,l,3,L,L,p,1
0,i,j,3,l,m,3,L,L,1
0,i,j,3,L,3,n,L,p,1
0,i,j,3,L,m,3,L,p,1
0,i,j,3,L,m,n,L,3,1
0,i,j,3,L,L,n,3,p,1
0,i,j,3,L,L,n,o,3,1
0,i,j,3,3,m,L,L,p,1
0,i,j,3,3,m,n,L,L,1
0,i,j,3,3,L,n,o,L,1
0,i,j,k,3,m,3,L,L,1
0,i,j,k,3,L,3,o,L,1
0,i,j,k,3,L,n,3,L,1
0,i,j,k,3,L,L,o,3,1
0,i,j,k,3,3,n,L,L,1
0,i,j,k,l,L,3,3,L,1
0,i,j,k,l,L,L,3,3,1
0,i,j,k,l,3,L,L,3,1
0,i,j,k,l,3,3,L,L,1

0,3,L,3,l,3,n,L,p,1
0,3,L,L,l,3,n,3,p,1
0,i,3,L,3,m,3,o,L,1
0,i,3,L,l,3,n,3,L,1
0,i,3,L,l,3,L,o,3,1
0,i,3,L,L,m,3,o,3,1
0,i,3,3,l,L,3,o,L,1
0,i,3,3,l,L,n,3,L,1
0,i,3,3,l,L,L,o,3,1
0,i,3,3,l,3,n,L,L,1
0,i,j,L,3,m,L,3,3,1
0,i,j,L,3,m,3,3,L,1
0,i,j,L,3,3,n,3,L,1
0,i,j,L,3,3,L,o,3,1
0,i,j,L,3,3,3,o,L,1
0,i,j,L,l,3,L,3,3,1
0,i,j,L,l,3,3,3,L,1
0,i,j,L,L,3,n,3,3,1
0,i,j,L,L,3,3,o,3,1
0,i,j,L,L,m,3,3,3,1
0,i,j,3,l,L,3,3,L,1
0,i,j,3,l,L,L,3,3,1
0,i,j,3,l,3,L,L,3,1
0,i,j,3,l,3,3,L,L,1
0,i,j,3,L,3,n,L,3,1
0,i,j,3,L,3,3,L,p,1
0,i,j,3,L,m,3,L,3,1
0,i,j,3,L,L,3,o,3,1
0,i,j,3,L,L,n,3,3,1
0,i,j,3,3,m,L,L,3,1
0,i,j,3,3,m,3,L,L,1
0,i,j,3,3,L,3,o,L,1
0,i,j,3,3,L,n,3,L,1
0,i,j,3,3,L,L,3,p,1
0,i,j,3,3,L,L,o,3,1
0,i,j,3,3,3,n,L,L,1
0,i,j,3,3,3,L,L,p,1
0,i,j,k,3,L,3,3,L,1
0,i,j,k,3,3,L,L,3,1
0,i,j,k,3,3,3,L,L,1

# One red cell and a diaphoton trigger cell give birth to a diaphoton.

0,5,1,k,l,m,n,o,p,4
0,1,5,k,l,m,n,o,p,4
0,5,j,1,l,m,n,o,p,4
0,i,1,k,5,m,n,o,p,4
0,1,j,k,5,m,n,o,p,4
0,5,j,k,1,m,n,o,p,4
0,5,j,k,l,1,n,o,p,4
0,i,5,k,l,m,1,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld+old

2022-09-25T07:48:42Z

Yoel:

@RULE FireWorld+old

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

# This rule is a combination of two rules: FireWorld and a variety of Diaphotons.
# The idea to combine these rules was partially inspired by Brian Prentice's rule Mites.

# FireWorld is the redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# The new FireWorld is a hybrid rule combining 03ajkr/2ak/3 and a Wireworld-like
# wiring system. It is fully backward compatible with the old Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule matches the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the maximum "speed of light".
# This variety enables conversion of diagonal photons in certain positions into orthogonal ones.

# The resulting combination rule allows to convert diaphotons to photons and electrons and vice versa.
# Diaphotons have their own 2 states. Another extra state converts photons to diaphotons.
# It also enables a diagonal diode and the OR gate. Interactions between diophotons enable the AND gate.

# As long as these 3 extra states are not used, the rule is 100% backward compatible with FireWorld.

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 0 255 255
6 255 255 255

@TABLE

n_states:7
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3,4,5,6}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld rule from 2001

0,1,1,k,l,m,n,o,p,1
0,1,j,k,1,m,n,o,p,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1

var a2={0,2,6}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

# Diaphtons

0,a2,4,c2,d2,e2,f2,g2,h2,4
0,4,b2,c2,d2,e2,f2,g2,h2,5
0,4,5,c2,d2,e2,f2,g2,h2,5

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# When touching a wire, a diagonal photons becomes an electron

0,i,j,4,l,m,3,o,3,1
0,i,j,3,3,m,n,4,p,1
0,i,j,3,l,4,n,3,p,1
0,i,j,3,l,4,n,o,3,1
0,i,j,3,l,3,n,4,p,1
0,i,j,3,l,3,n,o,4,1
0,i,j,3,l,m,3,o,4,1
0,i,j,3,l,m,n,4,3,1
0,i,j,3,l,m,n,3,4,1
0,i,j,k,3,3,n,o,4,1
0,i,j,k,3,m,4,o,3,1
0,i,j,k,3,m,3,o,4,1
0,i,j,k,3,m,n,4,3,1
0,i,j,k,3,m,n,3,4,1
0,i,j,k,l,4,3,o,3,1
0,i,j,k,l,4,n,3,3,1
0,i,j,k,l,3,4,3,p,1
0,i,j,k,l,3,4,o,3,1
0,i,j,k,l,3,3,4,p,1
0,i,j,k,l,3,3,o,4,1
0,i,j,k,l,3,n,4,3,1
0,i,j,k,l,3,n,3,4,1
0,i,j,k,l,m,3,4,3,1
0,i,j,k,l,m,3,3,4,1

0,3,j,3,l,3,n,4,p,1
0,i,3,k,3,m,3,o,4,1
0,i,j,4,3,m,3,o,3,1
0,i,j,4,l,3,3,o,3,1
0,i,j,4,l,3,n,3,3,1
0,i,j,4,l,m,3,3,3,1
0,i,j,3,4,3,n,o,3,1
0,i,j,3,4,m,3,o,3,1
0,i,j,3,3,4,n,o,3,1
0,i,j,3,3,3,n,4,p,1
0,i,j,3,3,3,n,o,4,1
0,i,j,3,3,m,4,3,p,1
0,i,j,3,3,m,4,o,3,1
0,i,j,3,3,m,3,4,p,1
0,i,j,3,3,m,3,o,4,1
0,i,j,3,3,m,n,4,3,1
0,i,j,3,3,m,n,3,4,1
0,i,j,3,l,4,3,3,p,1
0,i,j,3,l,4,3,o,3,1
0,i,j,3,l,4,n,3,3,1
0,i,j,3,l,3,4,3,p,1
0,i,j,3,l,3,4,o,3,1
0,i,j,3,l,3,3,4,p,1
0,i,j,3,l,3,3,o,4,1
0,i,j,3,l,3,n,4,3,1
0,i,j,3,l,3,n,3,4,1
0,i,j,3,l,m,3,4,3,1
0,i,j,3,l,m,3,3,4,1
0,i,j,k,3,3,3,o,4,1
0,i,j,k,3,3,n,4,3,1
0,i,j,k,3,3,n,3,4,1
0,i,j,k,3,m,4,3,3,1
0,i,j,k,3,m,3,4,3,1
0,i,j,k,3,m,3,3,4,1
0,i,j,k,l,4,3,3,3,1
0,i,j,k,l,3,4,3,3,1
0,i,j,k,l,3,3,4,3,1
0,i,j,k,l,3,3,3,4,1

# A red cell becomes green upon touching a trigger cell

0,6,1,k,l,m,n,o,p,4
0,1,6,k,l,m,n,o,p,4
0,6,j,1,l,m,n,o,p,4
0,i,1,k,6,m,n,o,p,4
0,1,j,k,6,m,n,o,p,4
0,6,j,k,1,m,n,o,p,4
0,6,j,k,l,1,n,o,p,4
0,i,6,k,l,m,1,o,p,4

# Two orthogonally adjacent green cells become red, enabling an AND gate

0,4,4,k,l,m,n,o,p,1
4,4,j,k,l,m,n,o,p,2
0,i,4,k,l,m,5,o,p,4

# Two green cells react with two white cells, enabling an OR gate

0,6,b2,c2,d2,6,4,g2,4,4
0,4,6,k,6,4,n,o,p,5

# Enabling a diagonal diode

0,6,6,3,l,m,n,o,4,4
0,3,4,k,l,m,n,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld+old

2022-09-25T07:45:47Z

Yoel: The old baroque variety of FireWorld with 3 additional states for diagonal photons.

@RULE FireWorld+

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

# This rule is a combination of two rules: FireWorld and a variety of Diaphotons.
# The idea to combine these rules was partially inspired by Brian Prentice's rule Mites.

# FireWorld is the redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# The new FireWorld is a hybrid rule combining 03ajkr/2ak/3 and a Wireworld-like
# wiring system. It is fully backward compatible with the old Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule matches the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the maximum "speed of light".
# This variety enables conversion of diagonal photons in certain positions into orthogonal ones.

# The resulting combination rule allows to convert diaphotons to photons and electrons and vice versa.
# Diaphotons have their own 2 states. Another extra state converts photons to diaphotons.
# It also enables a diagonal diode and the OR gate. Interactions between diophotons enable the AND gate.

# As long as these 3 extra states are not used, the rule is 100% backward compatible with FireWorld.

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 0 255 255
6 255 255 255

@TABLE

n_states:7
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3,4,5,6}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld rule from 2001

0,1,1,k,l,m,n,o,p,1
0,1,j,k,1,m,n,o,p,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1

var a2={0,2,6}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

# Diaphtons

0,a2,4,c2,d2,e2,f2,g2,h2,4
0,4,b2,c2,d2,e2,f2,g2,h2,5
0,4,5,c2,d2,e2,f2,g2,h2,5

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# When touching a wire, a diagonal photons becomes an electron

0,i,j,4,l,m,3,o,3,1
0,i,j,3,3,m,n,4,p,1
0,i,j,3,l,4,n,3,p,1
0,i,j,3,l,4,n,o,3,1
0,i,j,3,l,3,n,4,p,1
0,i,j,3,l,3,n,o,4,1
0,i,j,3,l,m,3,o,4,1
0,i,j,3,l,m,n,4,3,1
0,i,j,3,l,m,n,3,4,1
0,i,j,k,3,3,n,o,4,1
0,i,j,k,3,m,4,o,3,1
0,i,j,k,3,m,3,o,4,1
0,i,j,k,3,m,n,4,3,1
0,i,j,k,3,m,n,3,4,1
0,i,j,k,l,4,3,o,3,1
0,i,j,k,l,4,n,3,3,1
0,i,j,k,l,3,4,3,p,1
0,i,j,k,l,3,4,o,3,1
0,i,j,k,l,3,3,4,p,1
0,i,j,k,l,3,3,o,4,1
0,i,j,k,l,3,n,4,3,1
0,i,j,k,l,3,n,3,4,1
0,i,j,k,l,m,3,4,3,1
0,i,j,k,l,m,3,3,4,1

0,3,j,3,l,3,n,4,p,1
0,i,3,k,3,m,3,o,4,1
0,i,j,4,3,m,3,o,3,1
0,i,j,4,l,3,3,o,3,1
0,i,j,4,l,3,n,3,3,1
0,i,j,4,l,m,3,3,3,1
0,i,j,3,4,3,n,o,3,1
0,i,j,3,4,m,3,o,3,1
0,i,j,3,3,4,n,o,3,1
0,i,j,3,3,3,n,4,p,1
0,i,j,3,3,3,n,o,4,1
0,i,j,3,3,m,4,3,p,1
0,i,j,3,3,m,4,o,3,1
0,i,j,3,3,m,3,4,p,1
0,i,j,3,3,m,3,o,4,1
0,i,j,3,3,m,n,4,3,1
0,i,j,3,3,m,n,3,4,1
0,i,j,3,l,4,3,3,p,1
0,i,j,3,l,4,3,o,3,1
0,i,j,3,l,4,n,3,3,1
0,i,j,3,l,3,4,3,p,1
0,i,j,3,l,3,4,o,3,1
0,i,j,3,l,3,3,4,p,1
0,i,j,3,l,3,3,o,4,1
0,i,j,3,l,3,n,4,3,1
0,i,j,3,l,3,n,3,4,1
0,i,j,3,l,m,3,4,3,1
0,i,j,3,l,m,3,3,4,1
0,i,j,k,3,3,3,o,4,1
0,i,j,k,3,3,n,4,3,1
0,i,j,k,3,3,n,3,4,1
0,i,j,k,3,m,4,3,3,1
0,i,j,k,3,m,3,4,3,1
0,i,j,k,3,m,3,3,4,1
0,i,j,k,l,4,3,3,3,1
0,i,j,k,l,3,4,3,3,1
0,i,j,k,l,3,3,4,3,1
0,i,j,k,l,3,3,3,4,1

# A red cell becomes green upon touching a trigger cell

0,6,1,k,l,m,n,o,p,4
0,1,6,k,l,m,n,o,p,4
0,6,j,1,l,m,n,o,p,4
0,i,1,k,6,m,n,o,p,4
0,1,j,k,6,m,n,o,p,4
0,6,j,k,1,m,n,o,p,4
0,6,j,k,l,1,n,o,p,4
0,i,6,k,l,m,1,o,p,4

# Two orthogonally adjacent green cells become red, enabling an AND gate

0,4,4,k,l,m,n,o,p,1
4,4,j,k,l,m,n,o,p,2
0,i,4,k,l,m,5,o,p,4

# Two green cells react with two white cells, enabling an OR gate

0,6,b2,c2,d2,6,4,g2,4,4
0,4,6,k,6,4,n,o,p,5

# Enabling a diagonal diode

0,6,6,3,l,m,n,o,4,4
0,3,4,k,l,m,n,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld

2022-07-23T02:34:24Z

Yoel:

@RULE FireWorld

# Copyright by Yoel Matveyev, 2001-2022
# The GNU General Public License v3.0

# Redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# The new FireWorld is a hybrid rule combining 03ajkr/2ak/3 and a Wireworld-like
# wiring system. It is fully backward compatible with the old Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule matches the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

@COLORS

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

@TABLE

n_states:4
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld rule from 2001

0,1,1,k,l,m,n,o,p,1
0,1,j,k,1,m,n,o,p,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# Cleaning up, making sure the wires are immutable

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

Universal computer

2022-05-26T09:57:31Z

Yoel:

{{Glossary}}
A '''universal computer''' in a [[cellular automaton]] is a system that can compute anything that a [http://en.wikipedia.org/wiki/Turing_machine Turing machine] can compute (another term for this is '''Turing-complete'''). A cellular automaton in which such a system exists is called '''universal'''. A universal computer may be either infinite or finite, but when combined with a [[universal constructor]], it is assumed to be finite.

==Universal computers in Life==
In 1982, [[John Conway]] proved in ''[[Winning Ways]]'' that the [[Game of Life]] has a (finite) universal computer, as well as a universal constructor. Proving the universality of a cellular automaton with simple rules was in fact Conway's aim in Life right from the start. The universal computer uses [[glider]] logic and a [[sliding block memory]], and the proof of its existence is also outlined in [[The Recursive Universe]].

In April 2000, [[Paul Rendell]] constructed a direct implementation of a [[Turing machine]].<ref>{{cite web|url=http://rendell-attic.org/gol/tm.htm|title=A Turing Machine in Conway's Game of Life|author=Paul Rendell|date=April 2, 2000}}</ref> This computer is infinite, as it requires an infinite length of tape for the Turing Machine.

In 2002, using [[Dean Hickerson]]'s [[sliding block memory]], [[Paul Chapman]] constructed an implementation of a Minsky Register Machine (a machine of the same capability as a Turing Machine), which he extended to a Universal Register Machine, a finite universal computer.<ref>{{cite web|url=http://www.igblan.free-online.co.uk/igblan/ca/|title=Life Universal Computer|author=Paul Chapman|date=November 11, 2002}}</ref>

In 2009, [[Adam P. Goucher]] built a [[Spartan universal computer-constructor]], which has three infinite binary memory tapes (program tape, data tape and marker tape). This allows data to be stored in linear space, rather than the exponential space that a Register Machine uses.

In 2010, Paul Rendell completed a [[universal Turing machine|universal version]] of his Turing machine pattern, followed in 2011 by a [[fully universal Turing machine|fully universal]] version, removing the previous requirement (needed for true universality) that the initial Life pattern must have unbounded size and infinite population.

In 2016, [[Nicolas Loizeau]] created an [[8-bit programmable computer]] pattern, using only four basic parts: a [[twogun|period-60 glider gun]], a [[buckaroo|90° glider reflector]], a p30 [[glider duplicator]], and a [[eater1|glider eater]]. Later an improved scalable version was announced in 2021.

==Universal computers in other cellular automata==
David Eppstein and Dean Hickerson proved that the [[totalistic Life-like cellular automaton]] B35/S236 has a universal computer and universal constructor, using the same method of proof that Conway used to prove that Life is universal.<ref>{{cite web|url=http://www.ics.uci.edu/~eppstein/ca/b35s236/|title=B35/S236|author=D. Eppstein}}</ref>

Tim Hutton has implemented Codd's design for a universal computer in Codd's 8-state cellular automaton.<ref>{{cite web|url=https://github.com/GollyGang/ruletablerepository/wiki/CoddsDesign|title=Rule Table Repository|author=Tim Hutton}}</ref>

The well-known rule {{rl|WireWorld}} allow to construct very small and robust logic gates, triggers, memory banks etc. In September 2004 David Moore and Mark Owen released a Wireworld computer, in which the results of calculations are shown in seven-segment displays by running "electrons". The computer's instruction set is a highly orthogonal RISC architecture. The program, CPU status and data are stored in a bank of 64 16-bit registers. According to the authors, the computer was designed, with the help of many others, between 1990 and 1992. The version of it included in [[Golly]] is preprogrammed to compute and display the sequence of prime numbers. Likely this was the first computer in a cellular automaton that looks like a computer from human perspective.

In 2021 [[Yoel Matveyev]] released the largest known cellular automation computer called Izhora based on his own 4-state rule FireWorld.<ref name="post136309" /> It has 256 kilobytes of memory, a 256x128 memory-mapped pixel display and a keyboard driven by a [[Golly]] script. Its 32-bit CPU uses a single operation, subtract and branch if zero or negative (SUBLEQ), from which all other operations can be synthesized. Examples include 256-bit factorials, primes and Fibonacci numbers. Tools such as an assembler and emulator are provided for programming it.

Other examples of cellular automation computers include a partial emulation of a real-world Picoblaze microcontroller and a custom multicore CPU.

==References==
<references>
<ref name="post136309">{{LinkForumThread
|p = 136309
|format = ref
|title = Izhora (Fireworld2 computer)
|author = Yoel Matveyev
|date = October 5, 2021
}}</ref>
</references>

==External links==
{{LinkWikipedia|Turing_completeness|name=Turing completeness}}
{{LinkLexicon|lex_u.htm#universalcomputer}}
{{LinkForumThread|f=11|t=3362|title=Resources pertaining to computation in cellular automata}}

Rule:FireWorld+

2022-05-25T23:27:48Z

Yoel:

@RULE FireWorld+

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

# This rule is a combination of two rules: FireWorld and a variety of Diaphotons.
# The idea to combine these rules was partially inspired by Brian Prentice's rule Mites.

# FireWorld is the redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# The new FireWorld is a hybrid rule combining 03ajkr/2ak/3 and a Wireworld-like
# wiring system. It is fully backward compatible with the old Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule matches the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the maximum "speed of light".
# This variety enables conversion of diagonal photons in certain positions into orthogonal ones.

# The resulting combination rule allows to convert diaphotons to photons and electrons and vice versa.
# Diaphotons have their own 2 states. Another extra state converts photons to diaphotons.
# It also enables a diagonal diode and the OR gate. Interactions between diophotons enable the AND gate.

# As long as these 3 extra states are not used, the rule is 100% backward compatible with FireWorld.

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 0 255 255
6 255 255 255

@TABLE

n_states:7
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3,4,5,6}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld rule from 2001

0,1,1,k,l,m,n,o,p,1
0,1,j,k,1,m,n,o,p,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1

var a2={0,2,6}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

# Diaphtons

0,a2,4,c2,d2,e2,f2,g2,h2,4
0,4,b2,c2,d2,e2,f2,g2,h2,5
0,4,5,c2,d2,e2,f2,g2,h2,5

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# When touching a wire, a diagonal photons becomes an electron

0,i,j,4,l,m,3,o,3,1
0,i,j,3,3,m,n,4,p,1
0,i,j,3,l,4,n,3,p,1
0,i,j,3,l,4,n,o,3,1
0,i,j,3,l,3,n,4,p,1
0,i,j,3,l,3,n,o,4,1
0,i,j,3,l,m,3,o,4,1
0,i,j,3,l,m,n,4,3,1
0,i,j,3,l,m,n,3,4,1
0,i,j,k,3,3,n,o,4,1
0,i,j,k,3,m,4,o,3,1
0,i,j,k,3,m,3,o,4,1
0,i,j,k,3,m,n,4,3,1
0,i,j,k,3,m,n,3,4,1
0,i,j,k,l,4,3,o,3,1
0,i,j,k,l,4,n,3,3,1
0,i,j,k,l,3,4,3,p,1
0,i,j,k,l,3,4,o,3,1
0,i,j,k,l,3,3,4,p,1
0,i,j,k,l,3,3,o,4,1
0,i,j,k,l,3,n,4,3,1
0,i,j,k,l,3,n,3,4,1
0,i,j,k,l,m,3,4,3,1
0,i,j,k,l,m,3,3,4,1

0,3,j,3,l,3,n,4,p,1
0,i,3,k,3,m,3,o,4,1
0,i,j,4,3,m,3,o,3,1
0,i,j,4,l,3,3,o,3,1
0,i,j,4,l,3,n,3,3,1
0,i,j,4,l,m,3,3,3,1
0,i,j,3,4,3,n,o,3,1
0,i,j,3,4,m,3,o,3,1
0,i,j,3,3,4,n,o,3,1
0,i,j,3,3,3,n,4,p,1
0,i,j,3,3,3,n,o,4,1
0,i,j,3,3,m,4,3,p,1
0,i,j,3,3,m,4,o,3,1
0,i,j,3,3,m,3,4,p,1
0,i,j,3,3,m,3,o,4,1
0,i,j,3,3,m,n,4,3,1
0,i,j,3,3,m,n,3,4,1
0,i,j,3,l,4,3,3,p,1
0,i,j,3,l,4,3,o,3,1
0,i,j,3,l,4,n,3,3,1
0,i,j,3,l,3,4,3,p,1
0,i,j,3,l,3,4,o,3,1
0,i,j,3,l,3,3,4,p,1
0,i,j,3,l,3,3,o,4,1
0,i,j,3,l,3,n,4,3,1
0,i,j,3,l,3,n,3,4,1
0,i,j,3,l,m,3,4,3,1
0,i,j,3,l,m,3,3,4,1
0,i,j,k,3,3,3,o,4,1
0,i,j,k,3,3,n,4,3,1
0,i,j,k,3,3,n,3,4,1
0,i,j,k,3,m,4,3,3,1
0,i,j,k,3,m,3,4,3,1
0,i,j,k,3,m,3,3,4,1
0,i,j,k,l,4,3,3,3,1
0,i,j,k,l,3,4,3,3,1
0,i,j,k,l,3,3,4,3,1
0,i,j,k,l,3,3,3,4,1

# A red cell becomes green upon touching a trigger cell

0,6,1,k,l,m,n,o,p,4
0,1,6,k,l,m,n,o,p,4
0,6,j,1,l,m,n,o,p,4
0,i,1,k,6,m,n,o,p,4
0,1,j,k,6,m,n,o,p,4
0,6,j,k,1,m,n,o,p,4
0,6,j,k,l,1,n,o,p,4
0,i,6,k,l,m,1,o,p,4

# Two orthogonally adjacent green cells become red, enabling an AND gate

0,4,4,k,l,m,n,o,p,1
4,4,j,k,l,m,n,o,p,2
0,i,4,k,l,m,5,o,p,4

# Two green cells react with two white cells, enabling an OR gate

0,6,b2,c2,d2,6,4,g2,4,4
0,4,6,k,6,4,n,o,p,5

# Enabling a diagonal diode

0,6,6,3,l,m,n,o,4,4
0,3,4,k,l,m,n,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld7+

2022-05-25T23:27:01Z

Yoel:

@RULE FireWorld7+

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

# This rule is a combination of two rules: FireWorld7 and a variety of Diaphotons.
# The idea to combine these rules was partially inspired by Brian Prentice's rule Mites.

# FireWorld is the next generation of Fireworld (03ajkr/2ak/3), proven to be
# capable in itself of universal computation and suitable for constructing complex logic circuits.

# This variety is based on a slightly different substrate rule, 03ajkr7/2ak/3,
# where 2x2 blocks turn into period 3 guns.

# It is a hybrid rule combining 03ajkr7/2ak/3 and a Wireworld-like
# wiring system. It's fully backward compatible with 03ajkr7/2ak/3
# and almost always backward compatible with the original old Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule mirrors the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the maximum "speed of light".

# The resulting combination rule allows to convert diaphotons to photons and electrons and vice versa.
# Diaphotons have their own 2 states. Another extra state converts photons to diaphtons.
# It also enables a diagonal diode and the OR gate. Interaction between diophotons enables the AND gate.

# As long as these extra states are not used, the rule is 100% backward compatible with FireWorld.

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 0 255 255
6 255 255 255

@TABLE

n_states:7
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3,4,5,6}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The substrate variety of the old Fireworld from 2001: 03ajkr7/2ak/3

0,1,1,k,l,m,n,o,p,1
0,1,j,k,1,m,n,o,p,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1
1,1,1,1,1,1,1,1,p,1
1,1,1,1,1,1,1,o,1,1

var a2={0,2,6}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

# Diaphtons

0,a2,4,c2,d2,e2,f2,g2,h2,4
0,4,b2,c2,d2,e2,f2,g2,h2,5
0,4,5,c2,d2,e2,f2,g2,h2,5

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# When touching a wire, a diagonal photons becomes an electron

0,i,j,4,l,m,3,o,3,1
0,i,j,3,3,m,n,4,p,1
0,i,j,3,l,4,n,3,p,1
0,i,j,3,l,4,n,o,3,1
0,i,j,3,l,3,n,4,p,1
0,i,j,3,l,3,n,o,4,1
0,i,j,3,l,m,3,o,4,1
0,i,j,3,l,m,n,4,3,1
0,i,j,3,l,m,n,3,4,1
0,i,j,k,3,3,n,o,4,1
0,i,j,k,3,m,4,o,3,1
0,i,j,k,3,m,3,o,4,1
0,i,j,k,3,m,n,4,3,1
0,i,j,k,3,m,n,3,4,1
0,i,j,k,l,4,3,o,3,1
0,i,j,k,l,4,n,3,3,1
0,i,j,k,l,3,4,3,p,1
0,i,j,k,l,3,4,o,3,1
0,i,j,k,l,3,3,4,p,1
0,i,j,k,l,3,3,o,4,1
0,i,j,k,l,3,n,4,3,1
0,i,j,k,l,3,n,3,4,1
0,i,j,k,l,m,3,4,3,1
0,i,j,k,l,m,3,3,4,1

0,3,j,3,l,3,n,4,p,1
0,i,3,k,3,m,3,o,4,1
0,i,j,4,3,m,3,o,3,1
0,i,j,4,l,3,3,o,3,1
0,i,j,4,l,3,n,3,3,1
0,i,j,4,l,m,3,3,3,1
0,i,j,3,4,3,n,o,3,1
0,i,j,3,4,m,3,o,3,1
0,i,j,3,3,4,n,o,3,1
0,i,j,3,3,3,n,4,p,1
0,i,j,3,3,3,n,o,4,1
0,i,j,3,3,m,4,3,p,1
0,i,j,3,3,m,4,o,3,1
0,i,j,3,3,m,3,4,p,1
0,i,j,3,3,m,3,o,4,1
0,i,j,3,3,m,n,4,3,1
0,i,j,3,3,m,n,3,4,1
0,i,j,3,l,4,3,3,p,1
0,i,j,3,l,4,3,o,3,1
0,i,j,3,l,4,n,3,3,1
0,i,j,3,l,3,4,3,p,1
0,i,j,3,l,3,4,o,3,1
0,i,j,3,l,3,3,4,p,1
0,i,j,3,l,3,3,o,4,1
0,i,j,3,l,3,n,4,3,1
0,i,j,3,l,3,n,3,4,1
0,i,j,3,l,m,3,4,3,1
0,i,j,3,l,m,3,3,4,1
0,i,j,k,3,3,3,o,4,1
0,i,j,k,3,3,n,4,3,1
0,i,j,k,3,3,n,3,4,1
0,i,j,k,3,m,4,3,3,1
0,i,j,k,3,m,3,4,3,1
0,i,j,k,3,m,3,3,4,1
0,i,j,k,l,4,3,3,3,1
0,i,j,k,l,3,4,3,3,1
0,i,j,k,l,3,3,4,3,1
0,i,j,k,l,3,3,3,4,1

# A red cell becomes green upon touching a trigger cell

0,6,1,k,l,m,n,o,p,4
0,1,6,k,l,m,n,o,p,4
0,6,j,1,l,m,n,o,p,4
0,i,1,k,6,m,n,o,p,4
0,1,j,k,6,m,n,o,p,4
0,6,j,k,1,m,n,o,p,4
0,6,j,k,l,1,n,o,p,4
0,i,6,k,l,m,1,o,p,4

# Two orthogonally adjacent green cells become red, enabling an AND gate

0,4,4,k,l,m,n,o,p,1
4,4,j,k,l,m,n,o,p,2
0,i,4,k,l,m,5,o,p,4

# Two green cells react with two white cells, enabling an OR gate

0,6,b2,c2,d2,6,4,g2,4,4
0,4,6,k,6,4,n,o,p,5

# Enabling a diagonal diode

0,6,6,3,l,m,n,o,4,4
0,3,4,k,l,m,n,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld7+

2022-05-25T23:24:48Z

Yoel: Created page with "@RULE FireWorld7+ # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 # This rule is a combination of two rules: FireWorld7 and a variety of Diaphotons. # The idea to combine these rules was partially inspired by Brian Prentice's rule Mites. # FireWorld is the next generation of Fireworld (03ajkr/2ak/3), proven to be # capable in itself of universal computation and suitable for constructing complex logic circuits. # This variety is based on a sli..."

@RULE FireWorld7+

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

# This rule is a combination of two rules: FireWorld7 and a variety of Diaphotons.
# The idea to combine these rules was partially inspired by Brian Prentice's rule Mites.

# FireWorld is the next generation of Fireworld (03ajkr/2ak/3), proven to be
# capable in itself of universal computation and suitable for constructing complex logic circuits.

# This variety is based on a slightly different substrate rule, 03ajkr7/2ak/3,
# where 2x2 blocks turn into period 3 guns.

# It is a hybrid rule combining 03ajkr7/2ak/3 and a Wireworld-like
# wiring system. It's fully backward compatible with 03ajkr7/2ak/3
# and almost always backward compatible with the original old Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule mirrors the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the maximum "speed of light".

# The resulting combination rule allows to convert diaphotons to photons and electrons and vice versa.
# Diaphotons have their own 2 states. Another extra state converts photons to diaphtons.
# It also enables a diagonal diode and the OR gate. Interaction between diophotons enables the AND gate.

# As long as these extra states are not used, the rule is 100% backward compatible with FireWorld.

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 0 255 255
6 255 255 255

@TABLE

n_states:7
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3,4,5,6}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The substrate variety of the old Fireworld from 2001: 03ajkr7/2ak/3

0,1,1,k,l,m,n,o,p,1
0,1,j,k,1,m,n,o,p,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1
1,1,1,1,1,1,1,1,p,1
1,1,1,1,1,1,1,o,1,1

var a2={0,2,6}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

# Diaphtons

0,a2,4,c2,d2,e2,f2,g2,h2,4
0,4,b2,c2,d2,e2,f2,g2,h2,5
0,4,5,c2,d2,e2,f2,g2,h2,5

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# When touching a wire, a diagonal photons becomes an electron

0,i,j,4,l,m,3,o,3,1
0,i,j,3,3,m,n,4,p,1
0,i,j,3,l,4,n,3,p,1
0,i,j,3,l,4,n,o,3,1
0,i,j,3,l,3,n,4,p,1
0,i,j,3,l,3,n,o,4,1
0,i,j,3,l,m,3,o,4,1
0,i,j,3,l,m,n,4,3,1
0,i,j,3,l,m,n,3,4,1
0,i,j,k,3,3,n,o,4,1
0,i,j,k,3,m,4,o,3,1
0,i,j,k,3,m,3,o,4,1
0,i,j,k,3,m,n,4,3,1
0,i,j,k,3,m,n,3,4,1
0,i,j,k,l,4,3,o,3,1
0,i,j,k,l,4,n,3,3,1
0,i,j,k,l,3,4,3,p,1
0,i,j,k,l,3,4,o,3,1
0,i,j,k,l,3,3,4,p,1
0,i,j,k,l,3,3,o,4,1
0,i,j,k,l,3,n,4,3,1
0,i,j,k,l,3,n,3,4,1
0,i,j,k,l,m,3,4,3,1
0,i,j,k,l,m,3,3,4,1

0,3,j,3,l,3,n,4,p,1
0,i,3,k,3,m,3,o,4,1
0,i,j,4,3,m,3,o,3,1
0,i,j,4,l,3,3,o,3,1
0,i,j,4,l,3,n,3,3,1
0,i,j,4,l,m,3,3,3,1
0,i,j,3,4,3,n,o,3,1
0,i,j,3,4,m,3,o,3,1
0,i,j,3,3,4,n,o,3,1
0,i,j,3,3,3,n,4,p,1
0,i,j,3,3,3,n,o,4,1
0,i,j,3,3,m,4,3,p,1
0,i,j,3,3,m,4,o,3,1
0,i,j,3,3,m,3,4,p,1
0,i,j,3,3,m,3,o,4,1
0,i,j,3,3,m,n,4,3,1
0,i,j,3,3,m,n,3,4,1
0,i,j,3,l,4,3,3,p,1
0,i,j,3,l,4,3,o,3,1
0,i,j,3,l,4,n,3,3,1
0,i,j,3,l,3,4,3,p,1
0,i,j,3,l,3,4,o,3,1
0,i,j,3,l,3,3,4,p,1
0,i,j,3,l,3,3,o,4,1
0,i,j,3,l,3,n,4,3,1
0,i,j,3,l,3,n,3,4,1
0,i,j,3,l,m,3,4,3,1
0,i,j,3,l,m,3,3,4,1
0,i,j,k,3,3,3,o,4,1
0,i,j,k,3,3,n,4,3,1
0,i,j,k,3,3,n,3,4,1
0,i,j,k,3,m,4,3,3,1
0,i,j,k,3,m,3,4,3,1
0,i,j,k,3,m,3,3,4,1
0,i,j,k,l,4,3,3,3,1
0,i,j,k,l,3,4,3,3,1
0,i,j,k,l,3,3,4,3,1
0,i,j,k,l,3,3,3,4,1

# A red cell becomes green upon touching a trigger cell

0,6,1,k,l,m,n,o,p,4
0,1,6,k,l,m,n,o,p,4
0,6,j,1,l,m,n,o,p,4
0,i,1,k,6,m,n,o,p,4
0,1,j,k,6,m,n,o,p,4
0,6,j,k,1,m,n,o,p,4
0,6,j,k,l,1,n,o,p,4
0,i,6,k,l,m,1,o,p,4

# Two orthogonally ajacent green cells become red, enabling an AND gate

0,4,4,k,l,m,n,o,p,1
4,4,j,k,l,m,n,o,p,2
0,i,4,k,l,m,5,o,p,4

# Two greens cells react with two white cells, enabling an OR gate

0,6,b2,c2,d2,6,4,g2,4,4
0,4,6,k,6,4,n,o,p,5

# Enabling a diagonal diode

0,6,6,3,l,m,n,o,4,4
0,3,4,k,l,m,n,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld+

2022-05-25T23:23:59Z

Yoel:

@RULE FireWorld+

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

# This rule is a combination of two rules: FireWorld and a variety of Diaphotons.
# The idea to combine these rules was partially inspired by Brian Prentice's rule Mites.

# FireWorld is the redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# The new FireWorld is a hybrid rule combining 03ajkr/2ak/3 and a Wireworld-like
# wiring system. It is fully backward compatible with the old Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule matches the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the maximum "speed of light".
# This variety enables conversion of diagonal photons in certain positions into orthogonal ones.

# The resulting combination rule allows to convert diaphotons to photons and electrons and vice versa.
# Diaphotons have their own 2 states. Another extra state converts photons to diaphotons.
# It also enables a diagonal diode and the OR gate. Interactions between diophotons enable the AND gate.

# As long as these 3 extra states are not used, the rule is 100% backward compatible with FireWorld.

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 0 255 255
6 255 255 255

@TABLE

n_states:7
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3,4,5,6}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld rule from 2001

0,1,1,k,l,m,n,o,p,1
0,1,j,k,1,m,n,o,p,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1

var a2={0,2,6}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

# Diaphtons

0,a2,4,c2,d2,e2,f2,g2,h2,4
0,4,b2,c2,d2,e2,f2,g2,h2,5
0,4,5,c2,d2,e2,f2,g2,h2,5

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# When touching a wire, a diagonal photons becomes an electron

0,i,j,4,l,m,3,o,3,1
0,i,j,3,3,m,n,4,p,1
0,i,j,3,l,4,n,3,p,1
0,i,j,3,l,4,n,o,3,1
0,i,j,3,l,3,n,4,p,1
0,i,j,3,l,3,n,o,4,1
0,i,j,3,l,m,3,o,4,1
0,i,j,3,l,m,n,4,3,1
0,i,j,3,l,m,n,3,4,1
0,i,j,k,3,3,n,o,4,1
0,i,j,k,3,m,4,o,3,1
0,i,j,k,3,m,3,o,4,1
0,i,j,k,3,m,n,4,3,1
0,i,j,k,3,m,n,3,4,1
0,i,j,k,l,4,3,o,3,1
0,i,j,k,l,4,n,3,3,1
0,i,j,k,l,3,4,3,p,1
0,i,j,k,l,3,4,o,3,1
0,i,j,k,l,3,3,4,p,1
0,i,j,k,l,3,3,o,4,1
0,i,j,k,l,3,n,4,3,1
0,i,j,k,l,3,n,3,4,1
0,i,j,k,l,m,3,4,3,1
0,i,j,k,l,m,3,3,4,1

0,3,j,3,l,3,n,4,p,1
0,i,3,k,3,m,3,o,4,1
0,i,j,4,3,m,3,o,3,1
0,i,j,4,l,3,3,o,3,1
0,i,j,4,l,3,n,3,3,1
0,i,j,4,l,m,3,3,3,1
0,i,j,3,4,3,n,o,3,1
0,i,j,3,4,m,3,o,3,1
0,i,j,3,3,4,n,o,3,1
0,i,j,3,3,3,n,4,p,1
0,i,j,3,3,3,n,o,4,1
0,i,j,3,3,m,4,3,p,1
0,i,j,3,3,m,4,o,3,1
0,i,j,3,3,m,3,4,p,1
0,i,j,3,3,m,3,o,4,1
0,i,j,3,3,m,n,4,3,1
0,i,j,3,3,m,n,3,4,1
0,i,j,3,l,4,3,3,p,1
0,i,j,3,l,4,3,o,3,1
0,i,j,3,l,4,n,3,3,1
0,i,j,3,l,3,4,3,p,1
0,i,j,3,l,3,4,o,3,1
0,i,j,3,l,3,3,4,p,1
0,i,j,3,l,3,3,o,4,1
0,i,j,3,l,3,n,4,3,1
0,i,j,3,l,3,n,3,4,1
0,i,j,3,l,m,3,4,3,1
0,i,j,3,l,m,3,3,4,1
0,i,j,k,3,3,3,o,4,1
0,i,j,k,3,3,n,4,3,1
0,i,j,k,3,3,n,3,4,1
0,i,j,k,3,m,4,3,3,1
0,i,j,k,3,m,3,4,3,1
0,i,j,k,3,m,3,3,4,1
0,i,j,k,l,4,3,3,3,1
0,i,j,k,l,3,4,3,3,1
0,i,j,k,l,3,3,4,3,1
0,i,j,k,l,3,3,3,4,1

# A red cell becomes green upon touching a trigger cell

0,6,1,k,l,m,n,o,p,4
0,1,6,k,l,m,n,o,p,4
0,6,j,1,l,m,n,o,p,4
0,i,1,k,6,m,n,o,p,4
0,1,j,k,6,m,n,o,p,4
0,6,j,k,1,m,n,o,p,4
0,6,j,k,l,1,n,o,p,4
0,i,6,k,l,m,1,o,p,4

# Two orthogonally ajacent green cells become red, enabling an AND gate

0,4,4,k,l,m,n,o,p,1
4,4,j,k,l,m,n,o,p,2
0,i,4,k,l,m,5,o,p,4

# Two greens cells react with two white cells, enabling an OR gate

0,6,b2,c2,d2,6,4,g2,4,4
0,4,6,k,6,4,n,o,p,5

# Enabling a diagonal diode

0,6,6,3,l,m,n,o,4,4
0,3,4,k,l,m,n,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:Fireworld2

2022-05-25T23:23:02Z

Yoel:

@RULE Fireworld2

# The next generation of Fireworld (03ajkr/2ak/3), proven to be capable
# in itself of universal computation and suitable for constructing logic circuits.

# This new generation of Fireworld is a hybrid rule combining the original Fireworld and
# a Wireworld-like wiring system. It is fully backward compatible with Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by a living (state 1) cell and 2 or 3 wire cells.
# 2. A cell is born, if surrounded by two horizontally adjacent living cells and 2 or 3 wire cells.
# The second rule ensures that Fireworld's photons easily "ignite" electrons on wires.

# Copyright by Yoel Matveyev, 2020
# The GNU General Public License v3.0

@COLORS

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

@TABLE

n_states:4
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld

0,1,1,i,j,k,l,m,n,1
0,1,i,j,1,k,l,m,n,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,i,j,k,l,m,1
1,1,i,1,1,j,k,l,m,1
1,1,1,i,j,1,k,l,m,1
1,1,i,1,j,k,1,l,m,1
1,1,i,1,j,k,l,m,1,1

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1
0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1
0,1,1,3,3,m,n,o,p,1
0,1,1,3,l,3,n,o,p,1
0,1,1,3,l,m,3,o,p,1
0,1,1,3,l,m,n,3,p,1
0,1,1,3,l,m,n,o,3,1
0,1,1,k,3,3,n,o,p,1
0,1,1,k,3,m,3,o,p,1
0,1,1,k,3,m,n,3,p,1
0,1,1,k,3,m,n,o,3,1
0,1,1,k,l,3,3,o,p,1
0,1,1,k,l,3,n,3,p,1
0,1,1,k,l,3,n,o,3,1
0,1,1,k,l,m,3,3,p,1
0,1,1,k,l,m,3,o,3,1
0,1,1,k,l,m,n,3,3,1
0,1,1,3,3,3,n,o,p,1
0,1,1,3,3,m,3,o,p,1
0,1,1,3,3,m,n,3,p,1
0,1,1,3,3,m,n,o,3,1
0,1,1,3,l,3,3,o,p,1
0,1,1,3,l,3,n,3,p,1
0,1,1,3,l,3,n,o,3,1
0,1,1,3,l,m,3,3,p,1
0,1,1,3,l,m,3,o,3,1
0,1,1,3,l,m,n,3,3,1
0,1,1,k,3,3,3,o,p,1
0,1,1,k,3,3,n,3,p,1
0,1,1,k,3,3,n,o,3,1
0,1,1,k,3,m,3,3,p,1
0,1,1,k,3,m,3,o,3,1
0,1,1,k,3,m,n,3,3,1
0,1,1,k,l,3,3,3,p,1
0,1,1,k,l,3,3,o,3,1
0,1,1,k,l,3,n,3,3,1
0,1,1,k,l,m,3,3,3,1

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld7

2022-05-25T23:21:52Z

Yoel: A slightly modified variety of FireWorld with S7 that turns blocks into p3 guns

@RULE FireWorld7

# Copyright by Yoel Matveyev, 2001-2022
# The GNU General Public License v3.0

# Redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# This variety is based on a slightly different substrate rule, 03ajkr7/2ak/3,
# where 2x2 blocks turn into period 3 guns.

# It is a hybrid rule combining 03ajkr7/2ak/3 and a Wireworld-like
# wiring system. It's fully backward compatible with 03ajkr7/2ak/3
# and almost always backward compatible with the original old Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule matches the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# All FireWorld circuits, including computers, should work in this rule identically,
# because 7 neighboring living cells are very unlikely to meet by natural evolution.

@COLORS

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

@TABLE

n_states:4
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The substrate variety of the old Fireworld from 2001: 03ajkr7/2ak/3

0,1,1,k,l,m,n,o,p,1
0,1,j,k,1,m,n,o,p,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1
1,1,1,1,1,1,1,1,p,1
1,1,1,1,1,1,1,o,1,1

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld

2022-05-25T23:20:23Z

Yoel:

RULE FireWorld

# Copyright by Yoel Matveyev, 2001-2022
# The GNU General Public License v3.0

# Redefinition of the old Fireworld (03ajkr/2ak/3), proven in itself to be capable
# of universal computation and to be suitable for constructing complex logic circuits.

# The new FireWorld is a hybrid rule combining 03ajkr/2ak/3 and a Wireworld-like
# wiring system. It is fully backward compatible with the old Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule matches the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

@COLORS

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

@TABLE

n_states:4
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld rule from 2001

0,1,1,k,l,m,n,o,p,1
0,1,j,k,1,m,n,o,p,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,l,m,n,o,p,1
1,1,j,1,1,m,n,o,p,1
1,1,1,k,l,1,n,o,p,1
1,1,j,1,l,m,1,o,p,1

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld+

2022-05-16T13:53:22Z

Yoel:

@RULE FireWorld+

# A fancy combination of FireWorld rule with the Diaphotons rule

# FireWorld is the next generation of Fireworld (03ajkr/2ak/3), proven to be
# capable in itself of universal computation and suitable for constructing logic circuits.

# This new generation of Fireworld is a hybrid rule combining 03ajkr7/2ak/3 and
# a Wireworld-like wiring system. It is fully backward compatible with Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule mirrors the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the maximum "speed of light".

# The resulting combination rule allows to convert diaphotons to photons and electrons and vice versa.
# Diaphotons have their own 2 states. Another extra state converts photons to diaphtons.
# It also enables a diagonal diode and the OR gate. Interaction between diophotons enables the AND gate.

# As long as these extra states are not used, the rule is 100% backward compatible with FireWorld.

# Partially inspired by Brian Prentice's rule Mites

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 0 255 255
6 255 255 255

@TABLE

n_states:7
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3,4,5,6}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld augmented with S7

0,1,1,i,j,k,l,m,n,1
0,1,i,j,1,k,l,m,n,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,i,j,k,l,m,1
1,1,i,1,1,j,k,l,m,1
1,1,1,i,j,1,k,l,m,1
1,1,i,1,j,k,1,l,m,1
1,1,i,1,j,k,l,m,1,1
1,1,1,1,1,1,1,1,i,1
1,1,1,1,1,1,1,i,1,1

var a2={0,2,6}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

# Diaphtons

0,a2,4,c2,d2,e2,f2,g2,h2,4
0,4,b2,c2,d2,e2,f2,g2,h2,5
0,4,5,c2,d2,e2,f2,g2,h2,5

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# When touching a wire, a diagonal photons becomes an electron

0,i,j,4,l,m,3,o,3,1
0,i,j,3,3,m,n,4,p,1
0,i,j,3,l,4,n,3,p,1
0,i,j,3,l,4,n,o,3,1
0,i,j,3,l,3,n,4,p,1
0,i,j,3,l,3,n,o,4,1
0,i,j,3,l,m,3,o,4,1
0,i,j,3,l,m,n,4,3,1
0,i,j,3,l,m,n,3,4,1
0,i,j,k,3,3,n,o,4,1
0,i,j,k,3,m,4,o,3,1
0,i,j,k,3,m,3,o,4,1
0,i,j,k,3,m,n,4,3,1
0,i,j,k,3,m,n,3,4,1
0,i,j,k,l,4,3,o,3,1
0,i,j,k,l,4,n,3,3,1
0,i,j,k,l,3,4,3,p,1
0,i,j,k,l,3,4,o,3,1
0,i,j,k,l,3,3,4,p,1
0,i,j,k,l,3,3,o,4,1
0,i,j,k,l,3,n,4,3,1
0,i,j,k,l,3,n,3,4,1
0,i,j,k,l,m,3,4,3,1
0,i,j,k,l,m,3,3,4,1

0,3,j,3,l,3,n,4,p,1
0,i,3,k,3,m,3,o,4,1
0,i,j,4,3,m,3,o,3,1
0,i,j,4,l,3,3,o,3,1
0,i,j,4,l,3,n,3,3,1
0,i,j,4,l,m,3,3,3,1
0,i,j,3,4,3,n,o,3,1
0,i,j,3,4,m,3,o,3,1
0,i,j,3,3,4,n,o,3,1
0,i,j,3,3,3,n,4,p,1
0,i,j,3,3,3,n,o,4,1
0,i,j,3,3,m,4,3,p,1
0,i,j,3,3,m,4,o,3,1
0,i,j,3,3,m,3,4,p,1
0,i,j,3,3,m,3,o,4,1
0,i,j,3,3,m,n,4,3,1
0,i,j,3,3,m,n,3,4,1
0,i,j,3,l,4,3,3,p,1
0,i,j,3,l,4,3,o,3,1
0,i,j,3,l,4,n,3,3,1
0,i,j,3,l,3,4,3,p,1
0,i,j,3,l,3,4,o,3,1
0,i,j,3,l,3,3,4,p,1
0,i,j,3,l,3,3,o,4,1
0,i,j,3,l,3,n,4,3,1
0,i,j,3,l,3,n,3,4,1
0,i,j,3,l,m,3,4,3,1
0,i,j,3,l,m,3,3,4,1
0,i,j,k,3,3,3,o,4,1
0,i,j,k,3,3,n,4,3,1
0,i,j,k,3,3,n,3,4,1
0,i,j,k,3,m,4,3,3,1
0,i,j,k,3,m,3,4,3,1
0,i,j,k,3,m,3,3,4,1
0,i,j,k,l,4,3,3,3,1
0,i,j,k,l,3,4,3,3,1
0,i,j,k,l,3,3,4,3,1
0,i,j,k,l,3,3,3,4,1

# A red cell becomes green upon touching a trigger cell

0,6,1,k,l,m,n,o,p,4
0,1,6,k,l,m,n,o,p,4
0,6,j,1,l,m,n,o,p,4
0,i,1,k,6,m,n,o,p,4
0,1,j,k,6,m,n,o,p,4
0,6,j,k,1,m,n,o,p,4
0,6,j,k,l,1,n,o,p,4
0,i,6,k,l,m,1,o,p,4

# Two orthogonally ajacent green cells become red, enacling an AND gate

0,4,4,k,l,m,n,o,p,1
4,4,j,k,l,m,n,o,p,2
0,i,4,k,l,m,5,o,p,4

# Two green cells react with two white cells, enabling an OR gate

0,6,b2,c2,d2,6,4,g2,4,4
0,4,6,k,6,4,n,o,p,5

# Enabling a diagonal diode

0,6,6,3,l,m,n,o,4,4
0,3,4,k,l,m,n,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:FireWorld+

2022-05-16T13:53:00Z

Yoel:

@RULE FireWorld+

# A fancy combination of FireWorld rule with the Diaphotons rule

# FireWorld is the next generation of Fireworld (03ajkr/2ak/3), proven to be
# capable in itself of universal computation and suitable for constructing logic circuits.

# This new generation of Fireworld is a hybrid rule combining 03ajkr7/2ak/3 and
# a Wireworld-like wiring system. It is fully backward compatible with Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule mirrors the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the maximum "speed of light".

# The resulting combination rule allows to convert diaphotons to photons and electrons and vice versa.
# Diaphotons have their own 2 states. Another extra state converts photons to diaphtons.
# It also enables a diagonal diode and the OR gate. Interaction between diophotons enables the AND gate.

# As long as these extra states are not used, the rule is 100% backward compatible with FireWorld.

# Partially inspired by Brian Prentice's rule Mites

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 0 255 255
6 255 255 255

@TABLE

n_states:7
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3,4,5,6}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2,5}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld augmented with S7

0,1,1,i,j,k,l,m,n,1
0,1,i,j,1,k,l,m,n,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,i,j,k,l,m,1
1,1,i,1,1,j,k,l,m,1
1,1,1,i,j,1,k,l,m,1
1,1,i,1,j,k,1,l,m,1
1,1,i,1,j,k,l,m,1,1
1,1,1,1,1,1,1,1,i,1
1,1,1,1,1,1,1,i,1,1

var a2={0,2,6}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

# Diaphtons

0,a2,4,c2,d2,e2,f2,g2,h2,4
0,4,b2,c2,d2,e2,f2,g2,h2,5
0,4,5,c2,d2,e2,f2,g2,h2,5

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# When touching a wire, a diagonal photons becomes an electron

0,i,j,4,l,m,3,o,3,1
0,i,j,3,3,m,n,4,p,1
0,i,j,3,l,4,n,3,p,1
0,i,j,3,l,4,n,o,3,1
0,i,j,3,l,3,n,4,p,1
0,i,j,3,l,3,n,o,4,1
0,i,j,3,l,m,3,o,4,1
0,i,j,3,l,m,n,4,3,1
0,i,j,3,l,m,n,3,4,1
0,i,j,k,3,3,n,o,4,1
0,i,j,k,3,m,4,o,3,1
0,i,j,k,3,m,3,o,4,1
0,i,j,k,3,m,n,4,3,1
0,i,j,k,3,m,n,3,4,1
0,i,j,k,l,4,3,o,3,1
0,i,j,k,l,4,n,3,3,1
0,i,j,k,l,3,4,3,p,1
0,i,j,k,l,3,4,o,3,1
0,i,j,k,l,3,3,4,p,1
0,i,j,k,l,3,3,o,4,1
0,i,j,k,l,3,n,4,3,1
0,i,j,k,l,3,n,3,4,1
0,i,j,k,l,m,3,4,3,1
0,i,j,k,l,m,3,3,4,1

0,3,j,3,l,3,n,4,p,1
0,i,3,k,3,m,3,o,4,1
0,i,j,4,3,m,3,o,3,1
0,i,j,4,l,3,3,o,3,1
0,i,j,4,l,3,n,3,3,1
0,i,j,4,l,m,3,3,3,1
0,i,j,3,4,3,n,o,3,1
0,i,j,3,4,m,3,o,3,1
0,i,j,3,3,4,n,o,3,1
0,i,j,3,3,3,n,4,p,1
0,i,j,3,3,3,n,o,4,1
0,i,j,3,3,m,4,3,p,1
0,i,j,3,3,m,4,o,3,1
0,i,j,3,3,m,3,4,p,1
0,i,j,3,3,m,3,o,4,1
0,i,j,3,3,m,n,4,3,1
0,i,j,3,3,m,n,3,4,1
0,i,j,3,l,4,3,3,p,1
0,i,j,3,l,4,3,o,3,1
0,i,j,3,l,4,n,3,3,1
0,i,j,3,l,3,4,3,p,1
0,i,j,3,l,3,4,o,3,1
0,i,j,3,l,3,3,4,p,1
0,i,j,3,l,3,3,o,4,1
0,i,j,3,l,3,n,4,3,1
0,i,j,3,l,3,n,3,4,1
0,i,j,3,l,m,3,4,3,1
0,i,j,3,l,m,3,3,4,1
0,i,j,k,3,3,3,o,4,1
0,i,j,k,3,3,n,4,3,1
0,i,j,k,3,3,n,3,4,1
0,i,j,k,3,m,4,3,3,1
0,i,j,k,3,m,3,4,3,1
0,i,j,k,3,m,3,3,4,1
0,i,j,k,l,4,3,3,3,1
0,i,j,k,l,3,4,3,3,1
0,i,j,k,l,3,3,4,3,1
0,i,j,k,l,3,3,3,4,1

# A red cell becomes green upon touching a trigger cell

0,6,1,k,l,m,n,o,p,4
0,1,6,k,l,m,n,o,p,4
0,6,j,1,l,m,n,o,p,4
0,i,1,k,6,m,n,o,p,4
0,1,j,k,6,m,n,o,p,4
0,6,j,k,1,m,n,o,p,4
0,6,j,k,l,1,n,o,p,4
0,i,6,k,l,m,1,o,p,4

# Two orthogonally ajacent green cells become red, enacling an AND gate

0,4,4,k,l,m,n,o,p,1
4,4,j,k,l,m,n,o,p,2
0,i,4,k,l,m,5,o,p,4

# Two greens cells react with two white cells, enabling an OR gate

0,6,b2,c2,d2,6,4,g2,4,4
0,4,6,k,6,4,n,o,p,5

# Enabling a diagonal diode

0,6,6,3,l,m,n,o,4,4
0,3,4,k,l,m,n,o,p,4

# Cleaning up, making sure the wires are immutable

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

Rule:HyperBrain5

2022-05-10T16:31:49Z

Yoel: Created page with "@RULE HyperBrain5 # A hybrid of 03ijr45/2ak/3 and Diaphotons # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 @COLORS 0 0 0 0 1 255 0 0 2 255 255 0 3 0 255 0 4 0 255 255 @TABLE n_states:5 neighborhood:Moore symmetries:rotate4reflect var a={0,2,3,4} var b=a var c=a var d=a var e=a var f=a var g=a var h=a var A={0,1,2,3,4} var B=A var C=A var D=A var E=A var F=A var G=A var H=A var a2={0,2} var b2=a2 var c2=a2 var d2=a2 var e2=a2 var f2=a2..."

@RULE HyperBrain5

# A hybrid of 03ijr45/2ak/3 and Diaphotons

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

@COLORS

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

@TABLE

n_states:5
neighborhood:Moore
symmetries:rotate4reflect
var a={0,2,3,4}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var A={0,1,2,3,4}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A

var a2={0,2}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

var a3={0,4}
var b3=a3
var c3=a3
var d3=a3
var e3=a3
var f3=a3
var g3=a3
var h3=a3

# Diaphotons

0,a2,3,c2,d2,e2,f2,g2,h2,3
0,3,b2,c2,d2,e2,f2,g2,h2,4
0,3,4,c2,d2,e2,f2,g2,h2,4

# 03ijr45/2ak/3

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

1,a,1,c,1,e,1,g,1,1
1,1,b,1,d,1,f,1,h,1
1,1,1,c,1,e,f,1,h,1
1,1,1,c,d,e,f,1,1,1
1,a,1,1,d,e,f,1,1,1
1,1,1,c,d,e,1,g,1,1
1,1,1,c,1,e,1,g,h,1
1,1,1,1,d,e,1,g,h,1
1,1,1,c,d,1,f,1,h,1
1,1,1,1,d,1,f,g,h,1
1,1,1,c,d,1,f,g,1,1
1,1,1,c,d,e,1,1,h,1
1,1,1,c,d,1,1,g,h,1

1,1,1,1,d,1,f,1,h,1
1,1,1,c,1,e,1,g,1,1
1,1,1,c,1,e,1,1,h,1
1,1,1,1,1,e,f,g,1,1
1,1,1,1,d,e,f,1,1,1
1,1,1,1,1,e,f,1,h,1
1,1,1,c,1,1,f,1,h,1
1,1,1,1,d,1,1,g,h,1
1,1,1,1,1,e,1,g,h,1
1,1,1,c,1,1,1,g,h,1

# Interaction between rules

0,1,1,c2,d2,1,1,g2,h2,3
0,a2,3,c2,d2,e2,f2,1,h2,3
0,1,3,c2,d2,e2,f2,g2,h2,3
0,a2,1,3,4,d2,f2,g2,h2,3
0,3,3,c2,d2,e2,f2,g2,h2,1
0,3,3,c3,d3,e3,f3,g3,3,1
3,1,b2,c2,d2,4,f2,g2,h2,3
1,a2,1,c2,d2,e2,1,g2,h2,3
3,3,b3,c3,d3,e3,f3,g3,h3,1

# Cleanup

1,A,B,C,D,E,F,G,H,2
2,A,B,C,D,E,F,G,H,0
3,A,B,C,D,E,F,G,H,0
4,A,B,C,D,E,F,G,H,0

Rule:HyperBrain

2022-05-10T16:30:56Z

Yoel:

@RULE HyperBrain

# A hybrid of 03aijkr45/2ak/3 and Diaphotons

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

@COLORS

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

@TABLE

n_states:4
neighborhood:Moore
symmetries:rotate4reflect
var a={0,2,3}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var A={0,1,2,3}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A

# Diaphotons

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

# 03aijkr45/2ak/3

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

1,a,1,c,1,e,1,g,1,1
1,1,b,1,d,1,f,1,h,1
1,1,1,c,1,e,f,1,h,1
1,1,1,c,d,e,f,1,1,1
1,a,1,1,d,e,f,1,1,1
1,1,1,c,d,e,1,g,1,1
1,1,1,c,1,e,1,g,h,1
1,1,1,1,d,e,1,g,h,1
1,1,1,c,d,1,f,1,h,1
1,1,1,1,d,1,f,g,h,1
1,1,1,c,d,1,f,g,1,1
1,1,1,c,d,e,1,1,h,1
1,1,1,c,d,1,1,g,h,1

1,1,1,1,d,1,f,1,h,1
1,1,1,c,1,e,1,g,1,1
1,1,1,c,1,e,1,1,h,1
1,1,1,1,1,e,f,g,1,1
1,1,1,1,d,e,f,1,1,1
1,1,1,1,1,e,f,1,h,1
1,1,1,c,1,1,f,1,h,1
1,1,1,1,d,1,1,g,h,1
1,1,1,1,1,e,1,g,h,1
1,1,1,c,1,1,1,g,h,1

# Interaction between rules

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

# Cleanup

1,A,B,C,D,E,F,G,H,2
2,A,B,C,D,E,F,G,H,0
3,A,B,C,D,E,F,G,H,0

Rule:HyperBrain

2022-05-08T23:25:11Z

Yoel: Created page with "@RULE HyperBrain # A hybrid of 03ijr45/2ak/3 and Diaphotons # Copyright by Yoel Matveyev, 2022 # The GNU General Public License v3.0 @COLORS 0 0 0 0 1 255 0 0 2 255 255 0 3 0 255 0 4 0 255 255 @TABLE n_states:5 neighborhood:Moore symmetries:rotate4reflect var a={0,2,3,4} var b=a var c=a var d=a var e=a var f=a var g=a var h=a var A={0,1,2,3,4} var B=A var C=A var D=A var E=A var F=A var G=A var H=A var a2={0,2} var b2=a2 var c2=a2 var d2=a2 var e2=a2 var f2=a2 v..."

@RULE HyperBrain

# A hybrid of 03ijr45/2ak/3 and Diaphotons

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

@COLORS

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

@TABLE

n_states:5
neighborhood:Moore
symmetries:rotate4reflect
var a={0,2,3,4}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var A={0,1,2,3,4}
var B=A
var C=A
var D=A
var E=A
var F=A
var G=A
var H=A

var a2={0,2}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

var a3={0,4}
var b3=a3
var c3=a3
var d3=a3
var e3=a3
var f3=a3
var g3=a3
var h3=a3

# Diaphotons

0,a2,3,c2,d2,e2,f2,g2,h2,3
0,3,b2,c2,d2,e2,f2,g2,h2,4
0,3,4,c2,d2,e2,f2,g2,h2,4

# 03ijr45/2ak/3

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

1,a,1,c,1,e,1,g,1,1
1,1,b,1,d,1,f,1,h,1
1,1,1,c,1,e,f,1,h,1
1,1,1,c,d,e,f,1,1,1
1,a,1,1,d,e,f,1,1,1
1,1,1,c,d,e,1,g,1,1
1,1,1,c,1,e,1,g,h,1
1,1,1,1,d,e,1,g,h,1
1,1,1,c,d,1,f,1,h,1
1,1,1,1,d,1,f,g,h,1
1,1,1,c,d,1,f,g,1,1
1,1,1,c,d,e,1,1,h,1
1,1,1,c,d,1,1,g,h,1

1,1,1,1,d,1,f,1,h,1
1,1,1,c,1,e,1,g,1,1
1,1,1,c,1,e,1,1,h,1
1,1,1,1,1,e,f,g,1,1
1,1,1,1,d,e,f,1,1,1
1,1,1,1,1,e,f,1,h,1
1,1,1,c,1,1,f,1,h,1
1,1,1,1,d,1,1,g,h,1
1,1,1,1,1,e,1,g,h,1
1,1,1,c,1,1,1,g,h,1

# Interaction between rules

0,1,1,c2,d2,1,1,g2,h2,3
0,a2,3,c2,d2,e2,f2,1,h2,3
0,1,3,c2,d2,e2,f2,g2,h2,3
0,a2,1,3,4,d2,f2,g2,h2,3
0,3,3,c2,d2,e2,f2,g2,h2,1
0,3,3,c3,d3,e3,f3,g3,3,1
3,1,b2,c2,d2,4,f2,g2,h2,3
1,a2,1,c2,d2,e2,1,g2,h2,3
3,3,b3,c3,d3,e3,f3,g3,h3,1

# Cleanup

1,A,B,C,D,E,F,G,H,2
2,A,B,C,D,E,F,G,H,0
3,A,B,C,D,E,F,G,H,0
4,A,B,C,D,E,F,G,H,0

Universal computer

2022-04-26T06:24:43Z

Yoel:

{{Glossary}}
A '''universal computer''' in a [[cellular automaton]] is a system that can compute anything that a [http://en.wikipedia.org/wiki/Turing_machine Turing machine] can compute (another term for this is '''Turing-complete'''). A cellular automaton in which such a system exists is called '''universal'''. A universal computer may be either infinite or finite, but when combined with a [[universal constructor]], it is assumed to be finite.

==Universal computers in Life==
In 1982, [[John Conway]] proved in ''[[Winning Ways]]'' that the [[Game of Life]] has a (finite) universal computer, as well as a universal constructor. Proving the universality of a cellular automaton with simple rules was in fact Conway's aim in Life right from the start. The universal computer uses [[glider]] logic and a [[sliding block memory]], and the proof of its existence is also outlined in [[The Recursive Universe]].

In April 2000, [[Paul Rendell]] constructed a direct implementation of a [[Turing machine]].<ref>{{cite web|url=http://rendell-attic.org/gol/tm.htm|title=A Turing Machine in Conway's Game of Life|author=Paul Rendell|date=April 2, 2000}}</ref> This computer is infinite, as it requires an infinite length of tape for the Turing Machine.

In 2002, using [[Dean Hickerson]]'s [[sliding block memory]], [[Paul Chapman]] constructed an implementation of a Minsky Register Machine (a machine of the same capability as a Turing Machine), which he extended to a Universal Register Machine, a finite universal computer.<ref>{{cite web|url=http://www.igblan.free-online.co.uk/igblan/ca/|title=Life Universal Computer|author=Paul Chapman|date=November 11, 2002}}</ref>

In 2009, [[Adam P. Goucher]] built a [[Spartan universal computer-constructor]], which has three infinite binary memory tapes (program tape, data tape and marker tape). This allows data to be stored in linear space, rather than the exponential space that a Register Machine uses.

In 2010, Paul Rendell completed a [[universal Turing machine|universal version]] of his Turing machine pattern, followed in 2011 by a [[fully universal Turing machine|fully universal]] version, removing the previous requirement (needed for true universality) that the initial Life pattern must have unbounded size and infinite population.

In 2016, [[Nicolas Loizeau]] created an [[8-bit programmable computer]] pattern, using only four basic parts: a [[twogun|period 60 glider gun]], a [[buckaroo|90° glider reflector]], a [[glider duplicator|p30 glider duplicator]], and a [[eater1|glider eater]].<ref>{{cite web|url=https://conwaylife.com/forums/viewtopic.php?p=84641#p84641|title=Building a computer in Conway's Game of Life|author=Nicolas Loizeau|date=March 10, 2017}}</ref>

==Universal computers in other cellular automata==
David Eppstein and Dean Hickerson proved that the [[totalistic Life-like cellular automaton]] B35/S236 has a universal computer and universal constructor, using the same method of proof that Conway used to prove that Life is universal.<ref>{{cite web|url=http://www.ics.uci.edu/~eppstein/ca/b35s236/|title=B35/S236|author=D. Eppstein}}</ref>

Tim Hutton has implemented Codd's design for a universal computer in Codd's 8-state cellular automaton.<ref>{{cite web|url=https://github.com/GollyGang/ruletablerepository/wiki/CoddsDesign|title=Rule Table Repository|author=Tim Hutton}}</ref>

The well-known rule [[OCA:WireWorld|Wireworld]] allow to construct very small and robust logic gates, triggers, memory banks etc. In September 2004 David Moore and Mark Owen released a Wireworld computer, in which the results of calculations are shown in seven-segment displays by running "electrons". The computer's instruction set is a highly orthogonal RISC architecture. The program, CPU status and data are stored in a bank of 64 16-bit registers. According to the authors, the computer was designed, with the help of many others, between 1990 and 1992. The version of it included in [[Golly]] is preprogrammed to compute and display the sequence of prime numbers. Likely this was the first computer in a cellular automaton that looks like a computer from human perspective.

In 2021 [[Yoel Matveyev]] released<ref name="post136309" /> the largest known cellular automation computer called Izhora based on his own 4-state rule [OCA:FireWorld|FireWorld]. It has 256 kilobytes of memory, a 256x128 memory-mapped pixel display and a keyboard driven by a script. Its 32-bit CPU uses a single operation, subtract and branch if zero or negative (SUBLEQ), from which all other operations can be synthesized. Examples include 256-bit factorials, primes and Fibonacci numbers. Tools such as an assembler and emulator are provided for programming it.

Other examples of cellular automation computers include a partial emulation of a real-world Picoblaze microcontroller and a custom multicore CPU<ref name="post3362" />.

==References==
<references>
<ref name="post136309">{{LinkForumThread
|p = 136309
|format = ref
|title = Izhora (Fireworld2 computer)
|author = Yoel Matveyev
|date = October 5, 2021
}}</ref>
<ref name="post3362">{{LinkForumThread
|p = 3362
|format = ref
|title = Resources pertaining to computation in cellular automata
|author = blah
|date = April 18, 2018
}}</ref>
</references>

==External links==
{{LinkWikipedia|Turing_completeness|name=Turing completeness}}
{{LinkLexicon|lex_u.htm#universalcomputer}}

Yoel Matveyev

2022-04-26T06:23:34Z

Yoel: Created page with "{{Person |name = Yoel Matveyev |nat = Russian }} '''Yoel Matveyev''' is a Russian science fiction writer, poet, software developer and a cellular automata enthusiast. In 2021 he released<ref name="post136309" /> the largest known cellular automation computer called Izhora based on his own 4-state rule FireWorld. It has 256 kilobytes of memory, a 256x128 memory-mapped pixel display and a keyboard driven by a script. Its 32-bit CPU uses a single operatio..."

{{Person
|name = Yoel Matveyev
|nat = Russian
}}

'''Yoel Matveyev''' is a Russian science fiction writer, poet, software developer and a cellular automata enthusiast. In 2021 he released<ref name="post136309" /> the largest known cellular automation computer called Izhora based on his own 4-state rule [[OCA:FireWorld|FireWorld]]. It has 256 kilobytes of memory, a 256x128 memory-mapped pixel display and a keyboard driven by a script. Its 32-bit CPU uses a single operation, subtract and branch if zero or negative (SUBLEQ), from which all other operations can be synthesized. Examples include 256-bit factorials, primes and Fibonacci numbers. Tools such as an assembler and emulator are provided for programming it.

Matveyev is also notable for proving Turing completeness of [[OCA:Brian's Brain|Brian's Brain]] in 2020 <ref name="post110762" /> and for investigating multistate cyclical rules, which can be viewed as generalizing the notion of [[Self-complementary|self-complementarity]]. In multistate cyclic rules every pattern behaves exactly the same, if the states of all live cells are cyclically changed to one another, e.g. 1->2,2->3,3->1<ref name="post101012" />.

==References==
<references>
<ref name="post136309">{{LinkForumThread
|p = 136309
|format = ref
|title = Izhora (Fireworld2 computer)
|author = Yoel Matveyev
|date = October 5, 2021
}}</ref>
<ref name="post110762">{{LinkForumThread
|p = 110762
|format = ref
|title = Re: Turing - complete Generations rules
|author = Yoel Matveyev
|date = November 15, 2020
}}</ref>
<ref name="post101012">{{LinkForumThread
|format = ref
|title = Re: Gluonic
|p = 101012
|author = Yoel Matveyev
|date = July 24, 2020
}}</ref>
</references>
==External links==
{{LinkWikipedia|Brian_Silverman}}

{{DEFAULTSORT:Silverman, Brian}}

Universal computer

2022-04-26T05:58:52Z

Yoel:

{{Glossary}}
A '''universal computer''' in a [[cellular automaton]] is a system that can compute anything that a [http://en.wikipedia.org/wiki/Turing_machine Turing machine] can compute (another term for this is '''Turing-complete'''). A cellular automaton in which such a system exists is called '''universal'''. A universal computer may be either infinite or finite, but when combined with a [[universal constructor]], it is assumed to be finite.

==Universal computers in Life==
In 1982, [[John Conway]] proved in ''[[Winning Ways]]'' that the [[Game of Life]] has a (finite) universal computer, as well as a universal constructor. Proving the universality of a cellular automaton with simple rules was in fact Conway's aim in Life right from the start. The universal computer uses [[glider]] logic and a [[sliding block memory]], and the proof of its existence is also outlined in [[The Recursive Universe]].

In April 2000, [[Paul Rendell]] constructed a direct implementation of a [[Turing machine]].<ref>{{cite web|url=http://rendell-attic.org/gol/tm.htm|title=A Turing Machine in Conway's Game of Life|author=Paul Rendell|date=April 2, 2000}}</ref> This computer is infinite, as it requires an infinite length of tape for the Turing Machine.

In 2002, using [[Dean Hickerson]]'s [[sliding block memory]], [[Paul Chapman]] constructed an implementation of a Minsky Register Machine (a machine of the same capability as a Turing Machine), which he extended to a Universal Register Machine, a finite universal computer.<ref>{{cite web|url=http://www.igblan.free-online.co.uk/igblan/ca/|title=Life Universal Computer|author=Paul Chapman|date=November 11, 2002}}</ref>

In 2009, [[Adam P. Goucher]] built a [[Spartan universal computer-constructor]], which has three infinite binary memory tapes (program tape, data tape and marker tape). This allows data to be stored in linear space, rather than the exponential space that a Register Machine uses.

In 2010, Paul Rendell completed a [[universal Turing machine|universal version]] of his Turing machine pattern, followed in 2011 by a [[fully universal Turing machine|fully universal]] version, removing the previous requirement (needed for true universality) that the initial Life pattern must have unbounded size and infinite population.

In 2016, [[Nicolas Loizeau]] created an [[8-bit programmable computer]] pattern, using only four basic parts: a [[twogun|period 60 glider gun]], a [[buckaroo|90° glider reflector]], a [[glider duplicator|p30 glider duplicator]], and a [[eater1|glider eater]].<ref>{{cite web|url=https://conwaylife.com/forums/viewtopic.php?p=84641#p84641|title=Building a computer in Conway's Game of Life|author=Nicolas Loizeau|date=March 10, 2017}}</ref>

==Universal computers in other cellular automata==
David Eppstein and Dean Hickerson proved that the [[totalistic Life-like cellular automaton]] B35/S236 has a universal computer and universal constructor, using the same method of proof that Conway used to prove that Life is universal.<ref>{{cite web|url=http://www.ics.uci.edu/~eppstein/ca/b35s236/|title=B35/S236|author=D. Eppstein}}</ref>

Tim Hutton has implemented Codd's design for a universal computer in Codd's 8-state cellular automaton.<ref>{{cite web|url=https://github.com/GollyGang/ruletablerepository/wiki/CoddsDesign|title=Rule Table Repository|author=Tim Hutton}}</ref>

The well-known rule [[OCA:WireWorld|Wireworld]] allow to construct very small and robust logic gates, triggers, memory banks etc. In September 2004 David Moore and Mark Owen released a Wireworld computer, in which the results of calculations are shown in seven-segment displays by running "electrons". The computer's instruction set is a highly orthogonal RISC architecture. The program, CPU status and data are stored in a bank of 64 16-bit registers. According to the authors, the computer was designed, with the help of many others, between 1990 and 1992. The version of it included in [[Golly]] is preprogrammed to compute and display the sequence of prime numbers. Likely this was the first computer in a cellular automaton that looks like a computer from human perspective.

In 2021 [[Yoel Matveyev]] released<ref name="post136309" /> the largest known cellular automation computer called Izhora based on his own 4-state rule [OCA:FireWorld|FireWorld]. It has 256 kilobytes of memory, a 256x128 memory-mapped pixel display and a keyboard driven by a script. Its 32-bit CPU uses a single operation, subtract and branch if zero or negative (SUBLEQ), from which all other operations can be synthesized. Examples include 256-bit factorials, primes and Fibonacci numbers. Tools such as an assembler and emulator are provided for programming it.

Other examples of cellular automation computers include a partial emulation of a real-world Picoblaze microcontroller and a custom multicore CPU<ref name="post3362" />.

==References==
<references>
<ref name="post136309">{{LinkForumThread
|p = 136309
|format = ref
|title = Izhora (Fireworld2 computer)
|author = Yoel
|date = October 5, 2021
}}</ref>
<ref name="post3362">{{LinkForumThread
|p = 3362
|format = ref
|title = Resources pertaining to computation in cellular automata
|author = blah
|date = April 18, 2018
}}</ref>
</references>

==External links==
{{LinkWikipedia|Turing_completeness|name=Turing completeness}}
{{LinkLexicon|lex_u.htm#universalcomputer}}

Rule:FireWorld+

2022-04-26T03:25:52Z

Yoel: 7-state combination of FireWorld and Diaphotons. 100% backward compatible with FireWorld

@RULE FireWorld+

# A fancy combination of FireWorld rule with the Diaphotons rule

# Partially inspired by Brian Prentice's rule Mites

# FireWorld is the next generation of Fireworld (03ajkr/2ak/3), proven to be capable
# in itself of universal computation and suitable for constructing logic circuits.

# This new generation of Fireworld is a hybrid rule combining 03ajkr7/2ak/3 and
# a Wireworld-like wiring system. It is fully backward compatible with Fireworld.

# Wires are implemented as the fourth, immutable state. The new rules are as follows:

# 1. A cell is born, if surrounded by 1 living (state 1) cell and 2 or 3 wire cells (state 3).
# 2. A cell is born, if surrounded by 1 orthogonal and 1 diagonal neighboring living cell and 2 or 3 wire cells.

# The last rule mirrors the "2ak" behavior of Fireworld and helps to ignite electrons on wires by free photons.

# Diaphotons is a simple rule that allows spaceships to travel diagonally at the maximum "speed of light"

# This combination rule allows to convert diaphotons to photons and electrons and vice versa.

# Diaphotons have their own 2 states. Another extra state converts photons to diaphtons.

# As long as these extra states are not used, the rule is 100% backward compatible with FireWorld.

# Copyright by Yoel Matveyev, 2022
# The GNU General Public License v3.0

@COLORS

0 0 0 0
1 255 0 0
2 255 255 0
3 0 0 255
4 0 255 0
5 255 255 255
6 0 255 255

@TABLE

n_states:7
neighborhood:Moore
symmetries:rotate4reflect
var a={0,1,2,3,4,5,6}
var b=a
var c=a
var d=a
var e=a
var f=a
var g=a
var h=a

var i={0,2,6}
var j=i
var k=i
var l=i
var m=i
var n=i
var o=i
var p=i

# The original Fireworld augmented with S7

0,1,1,i,j,k,l,m,n,1
0,1,i,j,1,k,l,m,n,1
1,i,j,k,l,m,n,o,p,1
1,1,1,1,i,j,k,l,m,1
1,1,i,1,1,j,k,l,m,1
1,1,1,i,j,1,k,l,m,1
1,1,i,1,j,k,1,l,m,1
1,1,i,1,j,k,l,m,1,1
1,1,1,1,1,1,1,1,i,1
1,1,1,1,1,1,1,i,1,1

var a2={0,2}
var b2=a2
var c2=a2
var d2=a2
var e2=a2
var f2=a2
var g2=a2
var h2=a2

0,a2,4,c2,d2,e2,f2,g2,h2,4
0,4,b2,c2,d2,e2,f2,g2,h2,6
0,4,6,c2,d2,e2,f2,g2,h2,6

# A computer-generated list of all possible living cells and wire cells positions

0,i,j,1,l,m,3,o,3,1
0,i,j,3,3,m,n,1,p,1
0,i,j,3,l,1,n,3,p,1
0,i,j,3,l,1,n,o,3,1
0,i,j,3,l,3,n,1,p,1
0,i,j,3,l,3,n,o,1,1
0,i,j,3,l,m,3,o,1,1
0,i,j,3,l,m,n,1,3,1
0,i,j,3,l,m,n,3,1,1
0,i,j,k,3,3,n,o,1,1
0,i,j,k,3,m,1,o,3,1
0,i,j,k,3,m,3,o,1,1
0,i,j,k,3,m,n,1,3,1
0,i,j,k,3,m,n,3,1,1
0,i,j,k,l,1,3,o,3,1
0,i,j,k,l,1,n,3,3,1
0,i,j,k,l,3,1,3,p,1
0,i,j,k,l,3,1,o,3,1
0,i,j,k,l,3,3,1,p,1
0,i,j,k,l,3,3,o,1,1
0,i,j,k,l,3,n,1,3,1
0,i,j,k,l,3,n,3,1,1
0,i,j,k,l,m,3,1,3,1
0,i,j,k,l,m,3,3,1,1

0,3,j,3,l,3,n,1,p,1
0,i,3,k,3,m,3,o,1,1
0,i,j,1,3,m,3,o,3,1
0,i,j,1,l,3,3,o,3,1
0,i,j,1,l,3,n,3,3,1
0,i,j,1,l,m,3,3,3,1
0,i,j,3,1,3,n,o,3,1
0,i,j,3,1,m,3,o,3,1
0,i,j,3,3,1,n,o,3,1
0,i,j,3,3,3,n,1,p,1
0,i,j,3,3,3,n,o,1,1
0,i,j,3,3,m,1,3,p,1
0,i,j,3,3,m,1,o,3,1
0,i,j,3,3,m,3,1,p,1
0,i,j,3,3,m,3,o,1,1
0,i,j,3,3,m,n,1,3,1
0,i,j,3,3,m,n,3,1,1
0,i,j,3,l,1,3,3,p,1
0,i,j,3,l,1,3,o,3,1
0,i,j,3,l,1,n,3,3,1
0,i,j,3,l,3,1,3,p,1
0,i,j,3,l,3,1,o,3,1
0,i,j,3,l,3,3,1,p,1
0,i,j,3,l,3,3,o,1,1
0,i,j,3,l,3,n,1,3,1
0,i,j,3,l,3,n,3,1,1
0,i,j,3,l,m,3,1,3,1
0,i,j,3,l,m,3,3,1,1
0,i,j,k,3,3,3,o,1,1
0,i,j,k,3,3,n,1,3,1
0,i,j,k,3,3,n,3,1,1
0,i,j,k,3,m,1,3,3,1
0,i,j,k,3,m,3,1,3,1
0,i,j,k,3,m,3,3,1,1
0,i,j,k,l,1,3,3,3,1
0,i,j,k,l,3,1,3,3,1
0,i,j,k,l,3,3,1,3,1
0,i,j,k,l,3,3,3,1,1

0,i,j,1,3,m,1,o,3,1
0,i,j,1,3,m,3,o,1,1
0,i,j,1,l,3,n,3,1,1
0,i,j,1,l,3,1,o,3,1
0,i,j,1,l,3,3,o,1,1
0,i,j,1,l,m,3,3,1,1
0,i,j,1,1,m,3,o,3,1
0,i,j,3,l,1,3,o,1,1
0,i,j,3,l,1,n,3,1,1
0,i,j,3,l,1,1,o,3,1
0,i,j,3,l,3,n,1,1,1
0,i,j,3,l,3,1,1,p,1
0,i,j,3,l,m,3,1,1,1
0,i,j,3,1,3,n,1,p,1
0,i,j,3,1,m,3,1,p,1
0,i,j,3,1,m,n,1,3,1
0,i,j,3,1,1,n,3,p,1
0,i,j,3,1,1,n,o,3,1
0,i,j,3,3,m,1,1,p,1
0,i,j,3,3,m,n,1,1,1
0,i,j,3,3,1,n,o,1,1
0,i,j,k,3,m,3,1,1,1
0,i,j,k,3,1,3,o,1,1
0,i,j,k,3,1,n,3,1,1
0,i,j,k,3,1,1,o,3,1
0,i,j,k,3,3,n,1,1,1
0,i,j,k,l,1,3,3,1,1
0,i,j,k,l,1,1,3,3,1
0,i,j,k,l,3,1,1,3,1
0,i,j,k,l,3,3,1,1,1

0,3,1,3,l,3,n,1,p,1
0,3,1,1,l,3,n,3,p,1
0,i,3,1,3,m,3,o,1,1
0,i,3,1,l,3,n,3,1,1
0,i,3,1,l,3,1,o,3,1
0,i,3,1,1,m,3,o,3,1
0,i,3,3,l,1,3,o,1,1
0,i,3,3,l,1,n,3,1,1
0,i,3,3,l,1,1,o,3,1
0,i,3,3,l,3,n,1,1,1
0,i,j,1,3,m,1,3,3,1
0,i,j,1,3,m,3,3,1,1
0,i,j,1,3,3,n,3,1,1
0,i,j,1,3,3,1,o,3,1
0,i,j,1,3,3,3,o,1,1
0,i,j,1,l,3,1,3,3,1
0,i,j,1,l,3,3,3,1,1
0,i,j,1,1,3,n,3,3,1
0,i,j,1,1,3,3,o,3,1
0,i,j,1,1,m,3,3,3,1
0,i,j,3,l,1,3,3,1,1
0,i,j,3,l,1,1,3,3,1
0,i,j,3,l,3,1,1,3,1
0,i,j,3,l,3,3,1,1,1
0,i,j,3,1,3,n,1,3,1
0,i,j,3,1,3,3,1,p,1
0,i,j,3,1,m,3,1,3,1
0,i,j,3,1,1,3,o,3,1
0,i,j,3,1,1,n,3,3,1
0,i,j,3,3,m,1,1,3,1
0,i,j,3,3,m,3,1,1,1
0,i,j,3,3,1,3,o,1,1
0,i,j,3,3,1,n,3,1,1
0,i,j,3,3,1,1,3,p,1
0,i,j,3,3,1,1,o,3,1
0,i,j,3,3,3,n,1,1,1
0,i,j,3,3,3,1,1,p,1
0,i,j,k,3,1,3,3,1,1
0,i,j,k,3,3,1,1,3,1
0,i,j,k,3,3,3,1,1,1

# When touching a wire, a diagonal photons becomes an electron

0,i,j,4,l,m,3,o,3,1
0,i,j,3,3,m,n,4,p,1
0,i,j,3,l,4,n,3,p,1
0,i,j,3,l,4,n,o,3,1
0,i,j,3,l,3,n,4,p,1
0,i,j,3,l,3,n,o,4,1
0,i,j,3,l,m,3,o,4,1
0,i,j,3,l,m,n,4,3,1
0,i,j,3,l,m,n,3,4,1
0,i,j,k,3,3,n,o,4,1
0,i,j,k,3,m,4,o,3,1
0,i,j,k,3,m,3,o,4,1
0,i,j,k,3,m,n,4,3,1
0,i,j,k,3,m,n,3,4,1
0,i,j,k,l,4,3,o,3,1
0,i,j,k,l,4,n,3,3,1
0,i,j,k,l,3,4,3,p,1
0,i,j,k,l,3,4,o,3,1
0,i,j,k,l,3,3,4,p,1
0,i,j,k,l,3,3,o,4,1
0,i,j,k,l,3,n,4,3,1
0,i,j,k,l,3,n,3,4,1
0,i,j,k,l,m,3,4,3,1
0,i,j,k,l,m,3,3,4,1

0,3,j,3,l,3,n,4,p,1
0,i,3,k,3,m,3,o,4,1
0,i,j,4,3,m,3,o,3,1
0,i,j,4,l,3,3,o,3,1
0,i,j,4,l,3,n,3,3,1
0,i,j,4,l,m,3,3,3,1
0,i,j,3,4,3,n,o,3,1
0,i,j,3,4,m,3,o,3,1
0,i,j,3,3,4,n,o,3,1
0,i,j,3,3,3,n,4,p,1
0,i,j,3,3,3,n,o,4,1
0,i,j,3,3,m,4,3,p,1
0,i,j,3,3,m,4,o,3,1
0,i,j,3,3,m,3,4,p,1
0,i,j,3,3,m,3,o,4,1
0,i,j,3,3,m,n,4,3,1
0,i,j,3,3,m,n,3,4,1
0,i,j,3,l,4,3,3,p,1
0,i,j,3,l,4,3,o,3,1
0,i,j,3,l,4,n,3,3,1
0,i,j,3,l,3,4,3,p,1
0,i,j,3,l,3,4,o,3,1
0,i,j,3,l,3,3,4,p,1
0,i,j,3,l,3,3,o,4,1
0,i,j,3,l,3,n,4,3,1
0,i,j,3,l,3,n,3,4,1
0,i,j,3,l,m,3,4,3,1
0,i,j,3,l,m,3,3,4,1
0,i,j,k,3,3,3,o,4,1
0,i,j,k,3,3,n,4,3,1
0,i,j,k,3,3,n,3,4,1
0,i,j,k,3,m,4,3,3,1
0,i,j,k,3,m,3,4,3,1
0,i,j,k,3,m,3,3,4,1
0,i,j,k,l,4,3,3,3,1
0,i,j,k,l,3,4,3,3,1
0,i,j,k,l,3,3,4,3,1
0,i,j,k,l,3,3,3,4,1

# A red cell becomes green upon touching a trigger cell

0,5,1,k,l,m,n,o,p,4
0,1,5,k,l,m,n,o,p,4
0,5,j,1,l,m,n,o,p,4
0,i,1,k,5,m,n,o,p,4
0,1,j,k,5,m,n,o,p,4
0,5,j,k,1,m,n,o,p,4
0,5,j,k,l,1,n,o,p,4
0,i,5,k,l,m,1,o,p,4

# Cleaning up, making sure the wires are immutable

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