Hello,

I am new in forum, my english is very poor (sorry). I found game of live a lot time ago and now I am playing with Golly. I am fascinated with B13/S23:T200,200 rule. I input in golly the next *.rle file:

#CXRLE Pos=-2,-2

x = 4, y = 4, rule = B13/S23:T120,120

b2o$o2bo$o2bo$b2o!

It seems to be simple, but I am obtaining an amazing simetric patterns wich have no oscillation in a lot (i do not how many) generations.

it has experienced somebody with this?

Dani.

## B13/S23

### Re: B13/S23

Welcomeiinjdpa wrote:Hello, I am new in forum.

simetric -> symmetric

I think play with B1 rules is unusal. Patterns in B1 rules are just explode.

No still lifes, no oscillators, no spaceships!

If you want to play with B1 rules, try to find replicators. Replicators are intresting!

Call me "Dannyu NDos" in Forum. Call me "Park Shinhwan"(박신환) in Wiki.

### Re: B13/S23

Indeed. I believe it is from the Greek sym-metros, meaning 'balanced measure'. Of course, the meaning has evolved significantly, and it now means 'invariant under some group of transformations'. For example, the rules you are investigating are invariant under integer translations and Di(8) rotations/reflections.simetric -> symmetric

Welcome to the forum!

What do you do with ill crystallographers? Take them to the

**!***mono*-clinic### Re: B13/S23

"Under integer translations"? I wonder, are non-integer translations possible on Life?

### Re: B13/S23

Thank you for your answer.

I am playing with B13/S23 in a toroidal grid geometry. I am really discovering a new world with the cellular automata.

Mi first experiment with B13/S23 is to analyze oscillation in function of toroidal size. It was the result using always the same seed: b2o$o2bo$o2bo$b2o!

In all the cases it produces symmetrical patterns with respect to four axes. All the patterns are different

-T6,6: pattern stable in generation 3

-T7,7: oscilation period: 3

-T8,8: generation 3 all cells dead

-T9,9: oscilation period: 4

-T10,10: generation 11 all cells dead

-T11,11:oscillation period: 5

-T12,12: oscillation period: 5

-T13,13: oscillation period: 22

-T14,14:generation 281all cells dead

-T15,15: oscillation period: 56

-T16,16: oscillation period: 60

-T17,17: oscillation period: 571

-T18,18:oscillation period: 4

-T19,19:oscillation period: 9514

-T20,20: generation 10416 all cells dead

-T21,21: oscillation period: 30802

-T22,22: oscillation period: 5

-T23,23: oscillation period: 900398

-T24,24: oscillation period: 527542

ok, no more.

The conclusion seems to be:

-The symmetric patterns production grows faster than grid size

-The symmetric patterns production represents a bigger proportion of the possible combinations (2^n with n=grid size).

-There are grid size with strange results

-Is it possible that hash function returns some collision?

Ok, perhaps I am new with this things but for me it is amazing and pretty. The question is, where are the information that produces all this symmetric patterns?.

I am playing with B13/S23 in a toroidal grid geometry. I am really discovering a new world with the cellular automata.

Mi first experiment with B13/S23 is to analyze oscillation in function of toroidal size. It was the result using always the same seed: b2o$o2bo$o2bo$b2o!

In all the cases it produces symmetrical patterns with respect to four axes. All the patterns are different

-T6,6: pattern stable in generation 3

-T7,7: oscilation period: 3

-T8,8: generation 3 all cells dead

-T9,9: oscilation period: 4

-T10,10: generation 11 all cells dead

-T11,11:oscillation period: 5

-T12,12: oscillation period: 5

-T13,13: oscillation period: 22

-T14,14:generation 281all cells dead

-T15,15: oscillation period: 56

-T16,16: oscillation period: 60

-T17,17: oscillation period: 571

-T18,18:oscillation period: 4

-T19,19:oscillation period: 9514

-T20,20: generation 10416 all cells dead

-T21,21: oscillation period: 30802

-T22,22: oscillation period: 5

-T23,23: oscillation period: 900398

-T24,24: oscillation period: 527542

ok, no more.

The conclusion seems to be:

-The symmetric patterns production grows faster than grid size

-The symmetric patterns production represents a bigger proportion of the possible combinations (2^n with n=grid size).

-There are grid size with strange results

-Is it possible that hash function returns some collision?

Ok, perhaps I am new with this things but for me it is amazing and pretty. The question is, where are the information that produces all this symmetric patterns?.