Find a rule game

[Sarp]

I will post a challenge every week and you'll find/create a rule to compete. The rules that perform the best will be listed at the end of every week.

Week 1 Challenge:
Find a Life-like (Totalistic 2 state) rule which the following pattern stabilises within 100000 generations and has the maximum end population (if the population oscillates then the max population counts)

Code: Select all

x = 8, y = 7, rule = B3/S23
$2b4o$5b2o$2bob2o$2b3o$3bo!

My record is 840 cells

[KittyTac]

Totalistic is too easy.

[Sarp]

Totalistic is too easy.

There are 131072 possible totalistic rules. I don't think anybody will search them all

[AforAmpere]

I think I found the rule with 840:

Code: Select all

x = 5, y = 5, rule = B3678/S1245678
4o$3b2o$ob2o$3o$bo!

I don't know if it can get higher through similar means.

[KittyTac]

Totalistic is too easy.

There are 131072 possible totalistic rules. I don't think anybody will search them all

There are only a few totalistic rules that do not eternally explode or collapse immediately. There are about 100 interesting ones, I think.

[Hunting]

Totalistic is too easy.

There are 131072 possible totalistic rules. I don't think anybody will search them all

There are only a few totalistic rules that do not eternally explode or collapse immediately. There are about 100 interesting ones, I think.

I agree that.

[77topaz]

Somewhat off-topic (or maybe it could be considered a new challenge?): with such a figure (~100 rules), we could actually attempt to create an exhaustive list of "interesting" totalistic Life-like CA.

[Sarp]

Week 2 challenge
Find a Three state totalistic rule that has the highest amount of space ships that fit in a 10x10 bounding box in at least 1 generation

[Hunting]

Week 2 challenge
Find a Three state totalistic rule that has the highest amount of space ships that fit in a 10x10 bounding box in at least 1 generation

THREE state means generations?
You need to use computers to check this

[Hunting]

@Sarp, I'll try to find a solution of Week 2 challege in the "generations" rule set.
EDIT: Hopefully, I found this rule: /2/3.
Soup will usually creates a mess, but if you take a closer look on the chaotic growing mess, you'll find LOTS of spaceship travels at light-speed.
Spaceship families:

Code: Select all

x = 28, y = 10, rule = /2/3
4.2A20.2A$4.2B19.A2B$3.A20.AB$3.B19.AB$2.A19.AB$2.B18.AB$.A18.AB$.B
17.AB$A17.AB$B17.B!

EDIT: First diag ship:

Code: Select all

x = 4, y = 4, rule = /2/3
2.A$.BAB$A$.B!

It's c/4.
EDIT: This is sparky:

Code: Select all

x = 10, y = 5, rule = /2/3
7.AB$6.AB.A$.AB2.AB2.B$AB.AB.AB$AB!

[KittyTac]

@Sarp, I'll try to find a solution of Week 2 challege in the "generations" rule set.
EDIT: Hopefully, I found this rule: /2/3.
Soup will usually creates a mess, but if you take a closer look on the chaotic growing mess, you'll find LOTS of spaceship travels at light-speed.
Spaceship families:

Code: Select all

x = 28, y = 10, rule = /2/3
4.2A20.2A$4.2B19.A2B$3.A20.AB$3.B19.AB$2.A19.AB$2.B18.AB$.A18.AB$.B
17.AB$A17.AB$B17.B!

EDIT: First diag ship:

Code: Select all

x = 4, y = 4, rule = /2/3
2.A$.BAB$A$.B!

It's c/4.
EDIT: This is sparky:

Code: Select all

x = 10, y = 5, rule = /2/3
7.AB$6.AB.A$.AB2.AB2.B$AB.AB.AB$AB!

That's one of the best-known rules, actually. It's pretty watchable on a torus.

Code: Select all

x = 80, y = 64, rule = /2/3
13$60.AB$59.AB$58.AB$57.AB$56.AB$55.AB$54.AB$53.AB$52.AB$51.AB$50.AB$
49.AB$48.AB$47.AB$46.AB$45.AB$44.AB$43.AB$42.AB$41.AB$40.AB$39.AB$38.
AB$37.AB$36.AB$35.AB$34.AB$33.AB$32.AB$31.AB$30.AB$29.AB.A$24.AB2.AB
2.B$23.AB.AB.AB$23.AB!

[Hunting]

@Sarp, I'll try to find a solution of Week 2 challege in the "generations" rule set.
EDIT: Hopefully, I found this rule: /2/3.
Soup will usually creates a mess, but if you take a closer look on the chaotic growing mess, you'll find LOTS of spaceship travels at light-speed.
Spaceship families:

Code: Select all

x = 28, y = 10, rule = /2/3
4.2A20.2A$4.2B19.A2B$3.A20.AB$3.B19.AB$2.A19.AB$2.B18.AB$.A18.AB$.B
17.AB$A17.AB$B17.B!

EDIT: First diag ship:

Code: Select all

x = 4, y = 4, rule = /2/3
2.A$.BAB$A$.B!

It's c/4.
EDIT: This is sparky:

Code: Select all

x = 10, y = 5, rule = /2/3
7.AB$6.AB.A$.AB2.AB2.B$AB.AB.AB$AB!

That's one of the best-known rules, actually. It's pretty watchable on a torus.

Code: Select all

x = 80, y = 64, rule = /2/3
13$60.AB$59.AB$58.AB$57.AB$56.AB$55.AB$54.AB$53.AB$52.AB$51.AB$50.AB$
49.AB$48.AB$47.AB$46.AB$45.AB$44.AB$43.AB$42.AB$41.AB$40.AB$39.AB$38.
AB$37.AB$36.AB$35.AB$34.AB$33.AB$32.AB$31.AB$30.AB$29.AB.A$24.AB2.AB
2.B$23.AB.AB.AB$23.AB!

I know it's known. It's in the Golly Files. Folder: Patterns/Generations/What-a-mess.rle

[wildmyron]

@Hunting: care to provide a figure for how many spaceships exist which fit inside 10x10 bbox?

I suspect the answer is quite large - probably in the thousands even just counting p1 photons, depending on the definition of spaceship.

A different generations rule - /23/3 - might even beat Brian's Brain, at least I'm fairly sure it will based on the increase in number of p1 photons because it allows the following kinds of spaceship families in addition to those in /2/3:

Code: Select all

x = 4, y = 49, rule = /23/3
2.BA$2.BA$.BA$.BA3$2.BA$2.BA$2.BA3$2.BA$2.BA$2.BA$.BA3$2.BA$2.BA$2.BA
$.BA$BA3$2.BA$2.BA$2.BA$.BA$.BA3$2.BA$2.BA$.BA$.BA$.BA3$2.BA$2.BA$2.B
A$2.BA3$2.BA$2.BA$2.BA$2.BA$.BA!

and maybe (depending on the definition of spaceship)

Code: Select all

x = 5, y = 3, rule = /23/3
BA.BA$BA.BA$2.BA!

@Sarp: An interesting challenge, I'm not sure that one week is sufficient time to allow for responses though. Also, I think the rules for this challenge are a bit vague. Perhaps you could provide a few clarifications:

1. What patterns should be considered as unique spaceships for the purpose of this challenge? For example, I think the second pattern above should count but what about patterns where the parts are less well connected, e.g.

   Code: Select all

   x = 5, y = 4, rule = /2/3
   BA$BA$3.BA$3.BA!

   where the cell at (2,2) is influenced by cells from both parts, but the actual evolution of the two parts is not distinct from the separate parts due to the rules of this particular CA.
2. What is the definition of totalistic for this challenge? From the first challenge you evidently mean outer-totalistic and not strictly totalistic, but which multi-state rules are allowed. Some options:
   • Generations rules (outer-totalistic rules with one history state, such as /2/3).
   • totalistic or outer-totalistic rules where the total is the sum of all cell states in the neighbourhood. (Generations rules not allowed)
   • totalistic or outer-totalistic rules where the total number of cells of both states is counted and used to determine the resulting state. (Generations rules allowed, as well as many more complex rules.)

[Hunting]

@Hunting: care to provide a figure for how many spaceships exist which fit inside 10x10 bbox?

I suspect the answer is quite large - probably in the thousands even just counting p1 photons, depending on the definition of spaceship.

A different generations rule - /23/3 - might even beat Brian's Brain, at least I'm fairly sure it will based on the increase in number of p1 photons because it allows the following kinds of spaceship families in addition to those in /2/3:

Code: Select all

x = 4, y = 49, rule = /23/3
2.BA$2.BA$.BA$.BA3$2.BA$2.BA$2.BA3$2.BA$2.BA$2.BA$.BA3$2.BA$2.BA$2.BA
$.BA$BA3$2.BA$2.BA$2.BA$.BA$.BA3$2.BA$2.BA$.BA$.BA$.BA3$2.BA$2.BA$2.B
A$2.BA3$2.BA$2.BA$2.BA$2.BA$.BA!

and maybe (depending on the definition of spaceship)

Code: Select all

x = 5, y = 3, rule = /23/3
BA.BA$BA.BA$2.BA!

@Sarp: An interesting challenge, I'm not sure that one week is sufficient time to allow for responses though. Also, I think the rules for this challenge are a bit vague. Perhaps you could provide a few clarifications:

1. What patterns should be considered as unique spaceships for the purpose of this challenge? For example, I think the second pattern above should count but what about patterns where the parts are less well connected, e.g.

   Code: Select all

   x = 5, y = 4, rule = /2/3
   BA$BA$3.BA$3.BA!

   where the cell at (2,2) is influenced by cells from both parts, but the actual evolution of the two parts is not distinct from the separate parts due to the rules of this particular CA.
2. What is the definition of totalistic for this challenge? From the first challenge you evidently mean outer-totalistic and not strictly totalistic, but which multi-state rules are allowed. Some options:
   • Generations rules (outer-totalistic rules with one history state, such as /2/3).
   • totalistic or outer-totalistic rules where the total is the sum of all cell states in the neighbourhood. (Generations rules not allowed)
   • totalistic or outer-totalistic rules where the total number of cells of both states is counted and used to determine the resulting state. (Generations rules allowed, as well as many more complex rules.)

wildmyron, 1. History cells doesnt count.
2. I guess the third definition is right.
P. S. you'll never beat me. Just go on and you'll see.(keep the rhyme!)

[wildmyron]

wildmyron, 1. History cells doesnt count.

What do you mean? In which tally do history cells not count (according to you)?

2. I guess the third definition is right.

The traditional definition is #2 in my list, which is why I asked for clarification.

P. S. you'll never beat me. Just go on and you'll see.(keep the rhyme!)

Oh no, give me mercy.

[Hunting]

wildmyron, 1. History cells doesnt count.

What do you mean? In which tally do history cells not count (according to you)?

2. I guess the third definition is right.

The traditional definition is #2 in my list, which is why I asked for clarification.

P. S. you'll never beat me. Just go on and you'll see.(keep the rhyme!)

Oh no, give me mercy.

1. History cells cannot create births, so no interactions,then the spaceship is trivial, doesnt count.
2. ?
3. ...

[Saka]

This is kind of a joke, but

Code: Select all

@RULE 3State

Yes, this is a "troll"

@TABLE
n_states:3
neighborhood:oneDimensional
symmetries:none
var a = {0,1,2}
var b={1,2}
var c={1,2}
0,b,a,b
b,0,c,0
b,0,0,0

Code: Select all

x = 35, y = 24, rule = 3State
7.A6.A.A$5.3A7.3B$4.A2.A7.3B$16.2B10.A$15.3A10.A$26.2B3$9.4A5.B13.B$.
A2.B4.4B6.2A10.3A$2B.A5.2B.B5.4A9.2B$.4A3.B.3A8.A$2.3A5.2A8.2A$4.A$3.
2B2$8.3B.A19.3A$8.5A19.2A$8.2A.2A19.B$8.B.2A8.2B$10.2B8.B.2A$11.B9.2A
.2A$22.3B$21.B3.A!

[Hunting]

This is kind of a joke, but

Code: Select all

@RULE 3State

Yes, this is a "troll"

@TABLE
n_states:3
neighborhood:oneDimensional
symmetries:none
var a = {0,1,2}
var b={1,2}
var c={1,2}
0,b,a,b
b,0,c,0
b,0,0,0

Code: Select all

x = 35, y = 24, rule = 3State
7.A6.A.A$5.3A7.3B$4.A2.A7.3B$16.2B10.A$15.3A10.A$26.2B3$9.4A5.B13.B$.
A2.B4.4B6.2A10.3A$2B.A5.2B.B5.4A9.2B$.4A3.B.3A8.A$2.3A5.2A8.2A$4.A$3.
2B2$8.3B.A19.3A$8.5A19.2A$8.2A.2A19.B$8.B.2A8.2B$10.2B8.B.2A$11.B9.2A
.2A$22.3B$21.B3.A!

"nice" solution - almost everything is a spaceship.
BUT remember Sarp says "totalistic" - your symmetries is none, so it's non-isotropic non-totalistic.

[gameoflifemaniac]

Week 3 Challenge: Find a 3-state rule with the the slowest 1-cell spaceship.

[Hunting]

Week 3 Challenge: Find a 3-state rule with the the slowest 1-cell spaceship.

Difficulty level: Golly Hard.
At first, symmetric rules can not do that. So we need some rule like this:

Code: Select all

x=1,y=1,rule=MAPAASAAA/3
o!

This is not a valid solution(or an almost solution, because the history cell doesn't matter, I think).

[gameoflifemaniac]

Week 3 Challenge: Find a 3-state rule with the the slowest 1-cell spaceship.

Difficulty level: Golly Hard.
At first, symmetric rules can not do that. So we need some rule like this:

Code: Select all

x=1,y=1,rule=MAPAASAAA/3
o!

This is not a valid solution(or an almost solution, because the history cell doesn't matter, I think).

I meant any of the 2^19683 3-state rules.

[AforAmpere]

This thread tried to find the answer for n-states. The record for 3 states was C/36 by toroidalet.

[Sarp]

Week 4 Challenge
Find a 2 state rule and a shape fitting in a 10x10 bounding box so that the shape stabilises in as many generations as possible (A shape stabilizes when it becomes only still lifes, oscillators, spaceships, linear growths and/or replicators that won't interact with eachother). if the shape doesn't stabilise it doesn't qualify.

[Hunting]

Week 4 Challenge
Find a 2 state rule and a shape fitting in a 10x10 bounding box so that the shape stabilises in as many generations as possible (A shape stabilizes when it becomes only still lifes, oscillators, spaceships, linear growths and/or replicators that won't interact with eachother). if the shape doesn't stabilise it doesn't qualify.

Hard! Very very very very HARD!
I'll post:
B3/S23, and this:

Code: Select all

x = 6, y = 4, rule = B3/S23
ob3o$o4bo$obobo$bo2bo!

Hmmmm, It's 17465 gen.

[Macbi]

Week 4 Challenge
Find a 2 state rule and a shape fitting in a 10x10 bounding box so that the shape stabilises in as many generations as possible (A shape stabilizes when it becomes only still lifes, oscillators, spaceships, linear growths and/or replicators that won't interact with eachother). if the shape doesn't stabilise it doesn't qualify.

Hard! Very very very very HARD!
I'll post:
B3/S23, and this:

Code: Select all

x = 6, y = 4, rule = B3/S23
ob3o$o4bo$obobo$bo2bo!

Hmmmm, It's 17465 gen.

There's Simon Ekström's 9-by-6 version of Lidka:

Code: Select all

x = 9, y = 6, rule = B3/S23
6bo$6b3o2$3b2o3bo$3bo4bo$3o5bo!

(29126 generations)