Alas, it doesn't run on my machine. Can you post a screenshot?
Looking at the code, it appears to be a threshold sort of totalistic CA, where cells "die" if too many neighbors are "alive" or become "alive" if enough are alive, and with boundary conditions that are forced to be 0. I can't tell how many colors there are from the code.
I don't think circuit patterns are that unusual. For example the 5 neighbor totalistic 2D space has only 64 rules in it (smaller than the ECA space) and many make lines that connect at vertices (or some approximation to that)
Grid[Table[{rn,
ArrayPlot[
CellularAutomaton[{rn, {2, {{0, 1, 0}, {1, 1, 1}, {0, 1, 0}}}, {1,
1}}, RandomInteger[1, {30, 30}], {{{80}}}]]}, {rn, 0, 63, 2}]]
For instance, here is code 38 on a 60 by 60 grid for 80 steps