Rule:TernaryNTAA

@RULE TernaryNTAA

NTAA but with ternary, and it's fair. Only difference from original NTAA is: 3 signal state instead of 2, and of course, the gates changed

The gate is: With two input, if the input is same, output is just input;

               if the input is different, output is the third type of signal.

With three input, while the output's opposite input weighted 1.5,

                 the output is the most of the input.

Because the gates are fair, you can use either of R,G,B for a trit value.

@COLORS 0 0 0 0 Blank 1 84 84 84 Wire 2 255 0 0 Signal R 3 0 255 0 Signal G 4 0 0 255 Signal B 5 169 169 169 Tail @TABLE n_states: 6 neighborhood: vonNeumann symmetries: rotate4reflect

1. 2-input gate

112202 113303 114404 112304 113204 112403 114203 113402 114302 112022 113033 114044 112034 112043 113042

1. any state: a-d

var a = {0,1,2,3,4,5} var b = a var c = a var d = a

1. any state except 0

var h = {1,2,3,4,5}

1. any signal state: e-g

var e = {2,3,4} var f = e var g = e

1. 3-input gate

1,1,2,2,e,2 1,1,2,e,2,2 1,1,3,3,e,3 1,1,3,e,3,3 1,1,4,4,e,4 1,1,4,e,4,4 1,1,3,2,4,2 1,1,2,3,4,3 1,1,2,4,3,4

1. split

1,1,e,1,0,e

1. fix bug

e,e,0,1,5,e e,f,0,e,0,5 e,f,e,0,0,5

1. basic propagation
2. wire becomes signal with a wire

1,1,0,e,0,e 1,0,1,e,0,e

1. signal becomes tail with a signal and a tail

e,f,5,a,b,5 e,f,a,5,b,5

1. or with 2 tails

e,5,5,0,0,5 e,5,0,5,0,5

1. or the beginning

e,f,0,0,0,5

1. tail becomes wire without signal

5,e,a,b,c,5 5,a,b,c,d,1

1. dead-end

1,e,0,0,0,e