Thread for basic non-CGOL questions

NimbleRogue · Post by **NimbleRogue** » April 17th, 2025, 1:57 pm

Can anyone find the rule that this rep follows?

x = 25, y = 9, rule = B3-cer4qz5iqy7e/S2-cn3cejk4-anqy5cnqry6-a7e
$11b2o3bo$10b9o$12bo$9b4o$10b2o$13bo!

PK22 · Post by **PK22** » April 17th, 2025, 2:24 pm

NimbleRogue wrote: ↑
April 17th, 2025, 1:57 pm
Can anyone find the rule that this rep follows?
Code: Select all
rle

Do you know what the period is?

confocaloid · Post by **confocaloid** » April 18th, 2025, 7:00 am

NimbleRogue wrote: ↑
April 17th, 2025, 1:57 pm
Can anyone find the rule that this rep follows?
Code: Select all
x = 25, y = 9, rule = B3-cer4qz5iqy7e/S2-cn3cejk4-anqy5cnqry6-a7e
$11b2o3bo$10b9o$12bo$9b4o$10b2o$13bo!

I think it is inaccurate (oversimplification) to label that object as "replicator", or to assume from the beginning that it would follow some simple "law". A reasonably complete explanation of how it "works" would go beyond what could possibly be communicated by putting it into a predefined category.

Side note: the first 1000 ticks of the evolutionary sequence are endemic to the specified cellular automaton, within the space of all 2^102 two-state isotropic cellular automata with Moore neighbourhood. (In other words, as long as you stay within the space of cellular automata of the same type, tweaking the rules will necessarily modify some of the first 1001 generations.)

The rest of this post focuses on the evolutionary sequence itself, and mostly ignores the rules of the cellular automaton that determine the evolutionary sequence. One could say that it's more about "what can be observed" rather than about "why it is the way it is".

First, I scanned the first 1000 generations (including the provided generation 0) from the evolutionary sequence. Below are given counts of occurrences of every "isotropic" cell condition (i.e., counts of occurrences of every equivalence class of neighbourhood configurations up to rotations and reflections):
B0 (infinitely many occurrences in every generation), B1c (159949), B1e (90170), B2a (87608), S2a (37389), B3i (32937), B4a (27340), B3a (27264), S3i (21807), B2c (20619), S4a (18826), S5r (17953), S3e (16706), B3j (16583), S1c (12077), B3n (11375), S4r (11338), B5i (10452), S4j (9400), B2k (9360), S4i (9173), S3j (8949), S3a (8812), S7e (8579), S3n (8537), S4k (7534), S5q (7072), B2e (6942), S2e (6837), B8 (6771), S6k (6527), S5i (6376), S6i (6279), B4r (6159), B5r (6025), S5n (5838), S5c (5665), B4n (5242), B7c (5197), B7e (5100), B6a (4954), S0 (4704), B5a (4531), S1e (4482), S3r (4280), S6a (4144), S3k (3835), S5y (3580), S4z (3556), B4t (3554), B5j (3395), S4e (3367), B3r (3364), B4k (3188), B3q (3107), S3q (2983), S2k (2742), S4n (2428), S6c (2393), B2n (2214), S4w (2177), S2c (2114), B3e (2047), B5n (2025), S4t (1932), S6n (1792), B5q (1649), S4q (1550), S5j (1418), B4w (1406), B4i (1304), B4j (1295), S4y (1215), S8 (1167), S7c (1046), B3c (971), S5a (957), S3y (932), B6e (912), B4y (900), B6k (863), B4z (859), B2i (840), S2i (822), B3k (821), B4q (764), S2n (760), S5k (676), B3y (634), B5e (623), B5y (584), B6i (568), B5k (484), B6c (386), S3c (379), B5c (317), S5e (199), B4e (185), B6n (178), S6e (163), S4c (117), B4c (72)
The least frequent cell condition (with only 72 occurrences in the first 1000 generations) can be stated as follows:
"(the cell is currently dead) AND (the cell has four alive diagonal neighbours) AND (the cell has zero alive orthogonal neighbours)"
Code: Select all
```
1 0 1
0 0 0
1 0 1
```

Next, I scanned the first 10000 generations to find out which generations contain occurrences of the cell condition (B4c/A4c), and I got the following results: