ConwayLife.com

Posted: **January 28th, 2019, 9:19 pm**

Moosey wrote: Inline... like comments? (Sorry, I'm not too good with code yet.)

Let me guess - you are on Mac. Install homebrew (brew.sh) and run

brew tap homebrew/versions
brew install [flags] gcc48

and recompile with gcc.

Hope it works!

Posted: **January 29th, 2019, 12:11 am**

Moosey wrote:
Andrew wrote:
Moosey wrote:I got gfind, but couldn't run it. Any tips on that?
The link errors seem to be due to the use of inline. Edit gfind.c and either remove all the inline strings or change them to "static inline".
Inline... like comments? (Sorry, I'm not too good with code yet.)

No, not like comments. inline is a keyword in C which gives the compiler a hint about how it should compile a function. It is only used on function definitions. What Andrew is saying is that you need to edit gfind.c to change lines such as

Code: Select all

inline long hashFunction(node b, row r) {

to

Code: Select all

static inline long hashFunction(node b, row r) {

If you get a copy of gfind.c from https://github.com/conwaylife/gfind then you will have a version with these changes already made.

If you prefer, you can follow testitemqlstudop's advice and compile with gcc, then you won't need this modification. Out of the box, the gcc command on MacOS is actually running a different compiler called clang - which you can see reference to in the screenshot you posted.

Further questions about compiling and using gfind are best asked in one of the existing gfind threads (of which there are several), such as How to use Gfind?

Posted: **January 30th, 2019, 8:53 pm**

What do i do now?
[Removed]

Posted: **January 30th, 2019, 9:55 pm**

The "note" lines actually tell you precisely what to do to silence those warnings.

Posted: **January 30th, 2019, 10:49 pm**

Moosey wrote:What do i do now?

Now you have compiled gfind. There will be an executable file named "gfind" in the Gfind folder. You can now run gfind with

Code: Select all

./gfind c

to see the options available.

Note: pass all the desired options as a single string, with or without slashes separating the options. The following two commands are equivalent:

Code: Select all

./gfind b3/s23/o3/v/f2
./gfind b3s23o3vf2

They will both find two small c/3 ships: one with 60 cells and the turtle.

wildmyron wrote:Further questions about compiling and using gfind are best asked in one of the existing gfind threads (of which there are several), such as How to use Gfind?

As an aside, please copy and paste output from the terminal as text rather than posting screenshots. This makes it just a bit easier for the rest of us trying to help you.

77topaz wrote:The "note" lines actually tell you precisely what to do to silence those warnings.

The warnings can be safely ignored in this case, it just means that the evaluation of the expression relies on precedence rules rather than being explicit about the order of operations.

Posted: **January 31st, 2019, 9:26 am**

wildmyron wrote:
Moosey wrote:What do i do now?
Now you have compiled gfind. There will be an executable file named "gfind" in the Gfind folder. You can now run gfind with
Code: Select all
./gfind c
to see the options available.

Note: pass all the desired options as a single string, with or without slashes separating the options. The following two commands are equivalent:
Code: Select all
./gfind b3/s23/o3/v/f2
./gfind b3s23o3vf2
They will both find two small c/3 ships: one with 60 cells and the turtle.

wildmyron wrote:Further questions about compiling and using gfind are best asked in one of the existing gfind threads (of which there are several), such as How to use Gfind?
As an aside, please copy and paste output from the terminal as text rather than posting screenshots. This makes it just a bit easier for the rest of us trying to help you.

77topaz wrote:The "note" lines actually tell you precisely what to do to silence those warnings.
The warnings can be safely ignored in this case, it just means that the evaluation of the expression relies on precedence rules rather than being explicit about the order of operations.

Yeah, after posting it I tried running the commands from the lifewiki tutorial and it worked.

Posted: **February 12th, 2020, 5:47 pm**

This incomplete search result came up in a discussion today -- figured I'd repost it here:

Code: Select all

#C partial p5 hyperfountain -- David Eppstein, 2 October 2002
x = 25, y = 39, rule = B3/S23
12bo4$6bo2b2obob2o2bo$4b5o2bobo2b5o$3bo4b2obobob2o4bo$2bob3o11b3obo$3b
o3bob7obo3bo$4b3o11b3o$6bo11bo$2b4ob3o5b3ob4o$bo4b4ob3ob4o4bo$b2o2b2o
4b3o4b2o2b2o$5bob4o3b4obo$11bobo$3b2ob2obobobobob2ob2o$2bo3bo4bobo4bo
3bo$2bobo3bo2bobo2bo3bobo$b2o2b4obo3bob4o2b2o$o2bo5b2o3b2o5bo2bo$2ob4o
11b4ob2o$3b8o3b8o$4o5b2o3b2o5b4o$o5b5o3b5o5bo$b4o2bo9bo2b4o$12bo$b4o3b
2ob3ob2o3b4o$bo2b3o5bo5b3o2bo$2bo2bo2bo7bo2bo2bo$obo3bobo7bobo3bobo$2o
4b3o7b3o4b2o$4b2obobo5bobob2o$3b5o2b2ob2o2b5o$3b2ob2ob2o3b2ob2ob2o$5b
2o11b2o$5bo13bo$bo2bo15bo2bo$2b2o17b2o!

Can modern tools find a completion for this? There was a definite negative result that Nicolay Beluchenko reported for a p4 "ultrafountain" (largest possible number of blank rows given the period), but I don't think there's a p5 hyperfountain or ultrafountain known yet, or a proven negative result. (?)

Here's a link with some previous discussion of the terminology.

Posted: **February 14th, 2020, 9:13 pm**

dvgrn wrote: February 12th, 2020, 5:47 pm This incomplete search result came up in a discussion today -- figured I'd repost it here:
Code: Select all
#C partial p5 hyperfountain -- David Eppstein, 2 October 2002
x = 25, y = 39, rule = B3/S23
12bo4$6bo2b2obob2o2bo$4b5o2bobo2b5o$3bo4b2obobob2o4bo$2bob3o11b3obo$3b
o3bob7obo3bo$4b3o11b3o$6bo11bo$2b4ob3o5b3ob4o$bo4b4ob3ob4o4bo$b2o2b2o
4b3o4b2o2b2o$5bob4o3b4obo$11bobo$3b2ob2obobobobob2ob2o$2bo3bo4bobo4bo
3bo$2bobo3bo2bobo2bo3bobo$b2o2b4obo3bob4o2b2o$o2bo5b2o3b2o5bo2bo$2ob4o
11b4ob2o$3b8o3b8o$4o5b2o3b2o5b4o$o5b5o3b5o5bo$b4o2bo9bo2b4o$12bo$b4o3b
2ob3ob2o3b4o$bo2b3o5bo5b3o2bo$2bo2bo2bo7bo2bo2bo$obo3bobo7bobo3bobo$2o
4b3o7b3o4b2o$4b2obobo5bobob2o$3b5o2b2ob2o2b5o$3b2ob2ob2o3b2ob2ob2o$5b
2o11b2o$5bo13bo$bo2bo15bo2bo$2b2o17b2o!
Can modern tools find a completion for this? There was a definite negative result that Nicolay Beluchenko reported for a p4 "ultrafountain" (largest possible number of blank rows given the period), but I don't think there's a p5 hyperfountain or ultrafountain known yet, or a proven negative result. (?)

Here's a link with some previous discussion of the terminology.

Obviously reducible:

Code: Select all

x = 162, y = 27, rule = B3/S23
19b2obo7b2o12bo2bobobo3b2o2b2ob2o5bo19b2obo2bob2o3bobo2bo4b2o8b2o9b2o
15b2o$15b2o2bob2o2bo4bo4b2o5b6ob2obobo2bo2bobobo3bobo9bobo2bobo2bob4ob
obobob2o2b3o2bobo7bobobo2bobo2bo2b2o10bo2bo$14bo2bobo3b3o6bobobo4bo6bo
3bob2ob2o5bo3bobo8bob5ob2obo8bobo3b2o3bobobo4b2obobob4ob2obobo2bo3b2ob
o3b2o5bo$11b2o2b3o2b2o6b5obo6bo2b2o2bo3bo2bo3b3o2bob2o2b2o4bo2bo7bo2b
4ob2o2bob3o4b2obobo5bobo2bo7bobo2b2o4bob5o6bobo$6bo3bo2b2o3bobob2o4bo
5b2o4b2obo2bobob2obo2b2o4bob2obobo2bo2bobob2ob2o3bobo3bobobobo4b4obobo
9bobob6o4b2o2b3obo5bo6bobo$5bobobobo3bob2obo3bo4b4o4bo5bo2bobo2bob2obo
b4obo4b2obo2bo2bo2bobo2bobobobobo3bo2bob2o3bo3bo8bo2bobo5b4o2bo4bob4o
7b2obob2o$5bobobobob2o4b2o2bobobob2o2b3o3b2ob2ob2o4bobo2bo4bobo5bo3bo
2bobo3bobo3bo6bo2bobob2o2bo2bobobo2b4obobo4bobo4bob4obo7bo2b2o3bo2bo$
4b2obob2ob2o2b2o2b6obo11bob2o5bo2bob2obobo2bob3o4b2ob2o4b3ob2o6bo3b2o
4bobob3o8bo4b3o2b2o3bo2b2o4b3ob3o3bo2b2o3bobo$5bo2bo2b2ob4o4b2obobob2o
6bo14b2o4bo2bo5bobob5o3bobobo2b3o6b4obo3bo2bo3bo6b2ob2o3b2ob3o5bobo3b
2ob3o2b4o3bob2o$5b2o4b2obo6b3o6bo4b2o8b2obobobob4o4bo2b2ob2obo3bob2obo
bobo4bo2bobo4b5o7bob2o7bo4bo3bob2obo2b4obo2bobobo4bobobo$4bobobo2b2obo
b4o3bo9b2o8bo2bobo4bo3b5obobobobob2o3bo2bo2bobob2ob4ob4o6b6obobo8b2o3b
ob2o2bo3b2o3bobo2bobo2b4obo2bo$4bo3bo5bobo2bobobo2bo16b3o2bobobob2o5bo
bobobobobobo5bob2o2bob2o4bo4b3o2bo3bo2bo2bo3b2o4bo4bo2b2o2b2o2b3o2b4o
2bobo4bobo$5b2obo3b2obo4b2o2b3o19b2obob2obob3o4b2obobobo2b6obo2b2o5bo
2bo2bo4bo2bo5bob2obo2bo2bo2b2o4bo2b2obobo3b2o4b2obo2bobo2b2o$o3bo3bo3b
2o8b2o21bo3bo9bo2bo3bo3bobo7bobo2b5obobobob4ob2obo3b2o4b2obobob2o2bo2b
2obo5b2obo2bo2bo3bob2obobo$5b2obo3b2obo4b2o2b3o19b2obob2obob3o4b2obobo
bo2b6obo2b2o5bo2bo2bo4bo2bo5bob2obo2bo2bo2b2o4bo2b2obobo3b2o4b2obo2bob
o2b2o$4bo3bo5bobo2bobobo2bo16b3o2bobobob2o5bobobobobobobo5bob2o2bob2o
4bo4b3o2bo3bo2bo2bo3b2o4bo4bo2b2o2b2o2b3o2b4o2bobo4bobo$4bobobo2b2obob
4o3bo9b2o8bo2bobo4bo3b5obobobobob2o3bo2bo2bobob2ob4ob4o6b6obobo8b2o3bo
b2o2bo3b2o3bobo2bobo2b4obo2bo$5b2o4b2obo6b3o6bo4b2o8b2obobobob4o4bo2b
2ob2obo3bob2obobobo4bo2bobo4b5o7bob2o7bo4bo3bob2obo2b4obo2bobobo4bobob
o$5bo2bo2b2ob4o4b2obobob2o6bo14b2o4bo2bo5bobob5o3bobobo2b3o6b4obo3bo2b
o3bo6b2ob2o3b2ob3o5bobo3b2ob3o2b4o3bob2o$4b2obob2ob2o2b2o2b6obo11bob2o
5bo2bob2obobo2bob3o4b2ob2o4b3ob2o6bo3b2o4bobob3o8bo4b3o2b2o3bo2b2o4b3o
b3o3bo2b2o3bobo$5bobobobob2o4b2o2bobobob2o2b3o3b2ob2ob2o4bobo2bo4bobo
5bo3bo2bobo3bobo3bo6bo2bobob2o2bo2bobobo2b4obobo4bobo4bob4obo7bo2b2o3b
o2bo$5bobobobo3bob2obo3bo4b4o4bo5bo2bobo2bob2obob4obo4b2obo2bo2bo2bobo
2bobobobobo3bo2bob2o3bo3bo8bo2bobo5b4o2bo4bob4o7b2obob2o$6bo3bo2b2o3bo
bob2o4bo5b2o4b2obo2bobob2obo2b2o4bob2obobo2bo2bobob2ob2o3bobo3bobobobo
4b4obobo9bobob6o4b2o2b3obo5bo6bobo$11b2o2b3o2b2o6b5obo6bo2b2o2bo3bo2bo
3b3o2bob2o2b2o4bo2bo7bo2b4ob2o2bob3o4b2obobo5bobo2bo7bobo2b2o4bob5o6bo
bo$14bo2bobo3b3o6bobobo4bo6bo3bob2ob2o5bo3bobo8bob5ob2obo8bobo3b2o3bob
obo4b2obobob4ob2obobo2bo3b2obo3b2o5bo$15b2o2bob2o2bo4bo4b2o5b6ob2obobo
2bo2bobobo3bobo9bobo2bobo2bob4obobobob2o2b3o2bobo7bobobo2bobo2bo2b2o
10bo2bo$19b2obo7b2o12bo2bobobo3b2o2b2ob2o5bo19b2obo2bob2o3bobo2bo4b2o
8b2o9b2o15b2o!

Posted: **February 14th, 2020, 10:09 pm**

Extrementhusiast wrote: February 14th, 2020, 9:13 pmObviously reducible:

Code: Select all

x = 162, y = 27, rule = B3/S23
19b2obo7b2o12bo2bobobo3b2o2b2ob2o5bo19b2obo2bob2o3bobo2bo4b2o8b2o9b2o
15b2o$15b2o2bob2o2bo4bo4b2o5b6ob2obobo2bo2bobobo3bobo9bobo2bobo2bob4ob
obobob2o2b3o2bobo7bobobo2bobo2bo2b2o10bo2bo$14bo2bobo3b3o6bobobo4bo6bo
3bob2ob2o5bo3bobo8bob5ob2obo8bobo3b2o3bobobo4b2obobob4ob2obobo2bo3b2ob
o3b2o5bo$11b2o2b3o2b2o6b5obo6bo2b2o2bo3bo2bo3b3o2bob2o2b2o4bo2bo7bo2b
4ob2o2bob3o4b2obobo5bobo2bo7bobo2b2o4bob5o6bobo$6bo3bo2b2o3bobob2o4bo
5b2o4b2obo2bobob2obo2b2o4bob2obobo2bo2bobob2ob2o3bobo3bobobobo4b4obobo
9bobob6o4b2o2b3obo5bo6bobo$5bobobobo3bob2obo3bo4b4o4bo5bo2bobo2bob2obo
b4obo4b2obo2bo2bo2bobo2bobobobobo3bo2bob2o3bo3bo8bo2bobo5b4o2bo4bob4o
7b2obob2o$5bobobobob2o4b2o2bobobob2o2b3o3b2ob2ob2o4bobo2bo4bobo5bo3bo
2bobo3bobo3bo6bo2bobob2o2bo2bobobo2b4obobo4bobo4bob4obo7bo2b2o3bo2bo$
4b2obob2ob2o2b2o2b6obo11bob2o5bo2bob2obobo2bob3o4b2ob2o4b3ob2o6bo3b2o
4bobob3o8bo4b3o2b2o3bo2b2o4b3ob3o3bo2b2o3bobo$5bo2bo2b2ob4o4b2obobob2o
6bo14b2o4bo2bo5bobob5o3bobobo2b3o6b4obo3bo2bo3bo6b2ob2o3b2ob3o5bobo3b
2ob3o2b4o3bob2o$5b2o4b2obo6b3o6bo4b2o8b2obobobob4o4bo2b2ob2obo3bob2obo
bobo4bo2bobo4b5o7bob2o7bo4bo3bob2obo2b4obo2bobobo4bobobo$4bobobo2b2obo
b4o3bo9b2o8bo2bobo4bo3b5obobobobob2o3bo2bo2bobob2ob4ob4o6b6obobo8b2o3b
ob2o2bo3b2o3bobo2bobo2b4obo2bo$4bo3bo5bobo2bobobo2bo16b3o2bobobob2o5bo
bobobobobobo5bob2o2bob2o4bo4b3o2bo3bo2bo2bo3b2o4bo4bo2b2o2b2o2b3o2b4o
2bobo4bobo$5b2obo3b2obo4b2o2b3o19b2obob2obob3o4b2obobobo2b6obo2b2o5bo
2bo2bo4bo2bo5bob2obo2bo2bo2b2o4bo2b2obobo3b2o4b2obo2bobo2b2o$o3bo3bo3b
2o8b2o21bo3bo9bo2bo3bo3bobo7bobo2b5obobobob4ob2obo3b2o4b2obobob2o2bo2b
2obo5b2obo2bo2bo3bob2obobo$5b2obo3b2obo4b2o2b3o19b2obob2obob3o4b2obobo
bo2b6obo2b2o5bo2bo2bo4bo2bo5bob2obo2bo2bo2b2o4bo2b2obobo3b2o4b2obo2bob
o2b2o$4bo3bo5bobo2bobobo2bo16b3o2bobobob2o5bobobobobobobo5bob2o2bob2o
4bo4b3o2bo3bo2bo2bo3b2o4bo4bo2b2o2b2o2b3o2b4o2bobo4bobo$4bobobo2b2obob
4o3bo9b2o8bo2bobo4bo3b5obobobobob2o3bo2bo2bobob2ob4ob4o6b6obobo8b2o3bo
b2o2bo3b2o3bobo2bobo2b4obo2bo$5b2o4b2obo6b3o6bo4b2o8b2obobobob4o4bo2b
2ob2obo3bob2obobobo4bo2bobo4b5o7bob2o7bo4bo3bob2obo2b4obo2bobobo4bobob
o$5bo2bo2b2ob4o4b2obobob2o6bo14b2o4bo2bo5bobob5o3bobobo2b3o6b4obo3bo2b
o3bo6b2ob2o3b2ob3o5bobo3b2ob3o2b4o3bob2o$4b2obob2ob2o2b2o2b6obo11bob2o
5bo2bob2obobo2bob3o4b2ob2o4b3ob2o6bo3b2o4bobob3o8bo4b3o2b2o3bo2b2o4b3o
b3o3bo2b2o3bobo$5bobobobob2o4b2o2bobobob2o2b3o3b2ob2ob2o4bobo2bo4bobo
5bo3bo2bobo3bobo3bo6bo2bobob2o2bo2bobobo2b4obobo4bobo4bob4obo7bo2b2o3b
o2bo$5bobobobo3bob2obo3bo4b4o4bo5bo2bobo2bob2obob4obo4b2obo2bo2bo2bobo
2bobobobobo3bo2bob2o3bo3bo8bo2bobo5b4o2bo4bob4o7b2obob2o$6bo3bo2b2o3bo
bob2o4bo5b2o4b2obo2bobob2obo2b2o4bob2obobo2bo2bobob2ob2o3bobo3bobobobo
4b4obobo9bobob6o4b2o2b3obo5bo6bobo$11b2o2b3o2b2o6b5obo6bo2b2o2bo3bo2bo
3b3o2bob2o2b2o4bo2bo7bo2b4ob2o2bob3o4b2obobo5bobo2bo7bobo2b2o4bob5o6bo
bo$14bo2bobo3b3o6bobobo4bo6bo3bob2ob2o5bo3bobo8bob5ob2obo8bobo3b2o3bob
obo4b2obobob4ob2obobo2bo3b2obo3b2o5bo$15b2o2bob2o2bo4bo4b2o5b6ob2obobo
2bo2bobobo3bobo9bobo2bobo2bob4obobobob2o2b3o2bobo7bobobo2bobo2bo2b2o
10bo2bo$19b2obo7b2o12bo2bobobo3b2o2b2ob2o5bo19b2obo2bob2o3bobo2bo4b2o
8b2o9b2o15b2o!

"Martin's hyperfountain", I suppose?

Posted: **February 14th, 2020, 11:12 pm**

Freywa wrote: February 14th, 2020, 10:09 pm
Extrementhusiast wrote: February 14th, 2020, 9:13 pmObviously reducible:
Code: Select all
x = 162, y = 27, rule = B3/S23...
"Martin's hyperfountain", I suppose?

Yowzers. Before too much time is spent on optimization, does anyone know of an application that actually needs such a ridiculously isolated spark?

Seems like there might be some explosive reaction where the extra spark makes it expand at lightspeed for a couple of ticks, then vanish by the time the next spark arrives. Are there any open problems that have been waiting for a p5 hyperfountain?

Posted: **February 15th, 2020, 1:28 am**

Here's a reduction:

Code: Select all

x = 54, y = 27, rule = B3/S23
19b2obo7bo2bo$15b2o2bob2o2bo4b4o$14bo2bobo3b3o18bo2bo2bo$11b2o2b3o2b2o
6b8o8b7o$6bo3bo2b2o3bobob2o4bo6bo$5bobobobo3bob2obo3bo4b5o8b5o2b2o$5bo
bobobob2o4b2o2bobobob2o11b2ob2obo2bo$4b2obob2ob2o2b2o2b6obo7bo15bo$5bo
2bo2b2ob4o4b2obobob2o2bo2bob2o2bo3b2obob2o$5b2o4b2obo6b3o6bo4bo3bobobo
3b3o3bo$4bobobo2b2obob4o3bo9bobobobobob4o3bobo$4bo3bo5bobo2bobobo2bo5b
ob2ob2obobo3bo2b2ob2o$5b2obo3b2obo4b2o2b3o3b3o7bo2bo$o3bo3bo3b2o8b2o5b
o3b7ob2obo$5b2obo3b2obo4b2o2b3o3b3o7bo2bo$4bo3bo5bobo2bobobo2bo5bob2ob
2obobo3bo2b2ob2o$4bobobo2b2obob4o3bo9bobobobobob4o3bobo$5b2o4b2obo6b3o
6bo4bo3bobobo3b3o3bo$5bo2bo2b2ob4o4b2obobob2o2bo2bob2o2bo3b2obob2o$4b
2obob2ob2o2b2o2b6obo7bo15bo$5bobobobob2o4b2o2bobobob2o11b2ob2obo2bo$5b
obobobo3bob2obo3bo4b5o8b5o2b2o$6bo3bo2b2o3bobob2o4bo6bo$11b2o2b3o2b2o
6b8o8b7o$14bo2bobo3b3o18bo2bo2bo$15b2o2bob2o2bo4b4o$19b2obo7bo2bo!

Posted: **August 13th, 2024, 10:48 pm**

vilc wrote: August 13th, 2024, 6:02 pm - force stable regions (which can be connected to the base still-life); a blank margin around these is often useful

What is the idea behind forcing stable regions connected to the base SL? What would be an example to illustrate this item?

vilc wrote: August 13th, 2024, 6:02 pm If you find some good-looking partials that you can't solve, consider posting them along with your LLS config file, that would be very helpful.

This partial was found with LLS while trying to find a conversion from xs14_6ikm93z01 to xs22_0c88m596z321346:

Code: Select all

#C ./lls input.txt -p "<41"
x = 13, y = 14, rule = B3/S23
3bo$4o3bo2$7b2o$2b2o3bo$2bo$3bo5bo2bo$2b2o3b2o3bo$bo10bo$b3o3bo2b2o$4b
o2bobo$ob2o$2obobo$4b2o!

input.txt wrote:

Code: Select all

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 1 1 1 0 0 0 * * * * * * * * * * 0 0 0
0 0 0 0 0 0 0 * * * * * * * * * * 0 0 0
0 0 0 0 0 0 0 * * * * * * * * * * 0 0 0
0 0 1 1 0 0 0 * * * * * * * * * * 0 0 0
0 0 1 0 0 0 0 * * * * * * * * * * 0 0 0
0 0 0 1 0 0 0 * * * * * * * * * * 0 0 0
0 0 1 1 0 0 0 * * * * * * * * * * 0 0 0
0 1 0 0 0 0 0 * * * * * * * * * * 0 0 0
0 1 1 1 0 0 0 * * * * * * * * * * 0 0 0
0 0 0 0 1 0 0 * * * * * * * * * * 0 0 0
1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
* 1 1 1 * * * * * * * * * * * * * * * *
* * * * 1 * * * * * * * * * * * * * * *
1 * 1 1 * * * * * * * * * * * * * * * *
1 1 * 1 * 1 * * * * * * * * * * * * * *
* * * * 1 1 * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
* 1 1 1 * * * * * * * * * * * * * * * *
* * * * 1 * * * * * * * * * * * * * * *
1 * 1 1 * * * * * * * * * * * * * * * *
1 1 * 1 * 1 * * * * * * * * * * * * * *
* * * * 1 1 * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
* 1 1 1 * * * * * * * * * * * * * * * *
* * * * 1 * * * * * * * * * * * * * * *
1 * 1 1 * * * * * * * * * * * * * * * *
1 1 * 1 * 1 * * * * * * * * * * * * * *
* * * * 1 1 * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
* 1 1 1 * * * * * * * * * * * * * * * *
* * * * 1 * * * * * * * * * * * * * * *
1 * 1 1 * * * * * * * * * * * * * * * *
1 1 * 1 * 1 * * * * * * * * * * * * * *
* * * * 1 1 * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
* 1 1 1 * * * * * * * * * * * * * * * *
* * * * 1 * * * * * * * * * * * * * * *
1 * 1 1 * * * * * * * * * * * * * * * *
1 1 * 1 * 1 * * * * * * * * * * * * * *
* * * * 1 1 * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
* 1 1 1 * * * * * * * * * * * * * * * *
* * * * 1 * * * * * * * * * * * * * * *
1 * 1 1 * * * * * * * * * * * * * * * *
1 1 * 1 * 1 * * * * * * * * * * * * * *
* * * * 1 1 * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
* 1 1 1 * * * * * * * * * * * * * * * *
* * * * 1 * * * * * * * * * * * * * * *
1 * 1 1 * * * * * * * * * * * * * * * *
1 1 * 1 * 1 * * * * * * * * * * * * * *
* * * * 1 1 * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * 0 0 0 0 * * * * * * * * * * * *
* * * 0 0 0 0 0 0 * * * * * * * * * * *
0 0 0 0 0 1 1 0 0 0 * * * * * * * * * *
0 0 0 0 1 0 0 1 0 0 * * * * * * * * * *
0 1 0 0 1 1 0 1 0 0 * * * * * * * * * *
0 1 1 1 0 0 1 0 0 0 * * * * * * * * * *
0 0 0 0 1 0 0 0 0 * * * * * * * * * * *
1 0 1 1 0 0 0 0 * * * * * * * * * * * *
1 1 0 1 0 1 0 0 * * * * * * * * * * * *
0 0 0 0 1 1 0 0 * * * * * * * * * * * *

Several other partials:

Code: Select all

x = 93, y = 43, rule = B3/S23
66bobo$20bo24bo19bo$2bo25bo13bo17bo5bo19bo$2bo3bo13b2o3b2o15bo3b2o13bo
4b2o13bobo2bo4bo$bob2obo15bobobo14bob2obo14bob3o16b2ob2o3bo$3b2o18bo
19b2o4bo14b2o17b2o5bo$8b2o18bo19bobo17bo2bo16bo$bo5b3o11bo5b2o12bo5b2o
12bo5b2ob2o9bo5b2obo$b3o17b3o4bobo10b3o4bo12b3o17b3o3bo3bo$4bo3bo15bo
2bobo14bo4bo14bo4bo14bo2bobo$ob2o16bob2o16bob2o5bo10bob2o16bob2o6bo$2o
bobo14b2obobo14b2obobo14b2obobo14b2obobo3bo$4b2o18b2o18b2o18b2o18b2o
17$3bo39bo19bo19bo$4o6b3o7b3o17b4o16b4o3bo12b4o3bo$7bo20b2o17bo19bo$7b
o19b2obo16bo19b2o18b2o$2b2o3bobo12b2o3bo14b2o3b2ob2o10b2o3bo14b2o3bo$
2bo4bob2o11bo4b2o13bo5bo3bo9bo4bo14bo$3bo9bo9bo3b2o14bo4bo14bo3b2obo
12bo5bo2bo$2b2o4b2o2bo9b2o8bo9b2o8bo9b2o3b2o13b2o3b2o3bo$bo5b2o2b2o8bo
5bo3b2o8bo6b3obo8bo5bo2b2o9bo10bo$b3o4bo12b3o3bobobobo7b3o3bo6bo6b3o3b
o13b3o3bo2b2o$4bo19bo2bobo14bo5bo13bo4bo14bo2bobo$ob2o16bob2o16bob2o
16bob2o16bob2o$2obobo14b2obobo14b2obobo14b2obobo14b2obobo$4b2o18b2o18b
2o18b2o18b2o!

Posted: **August 14th, 2024, 6:56 am**

confocaloid wrote: August 13th, 2024, 10:48 pm
vilc wrote: August 13th, 2024, 6:02 pm - force stable regions (which can be connected to the base still-life); a blank margin around these is often useful
What is the idea behind forcing stable regions connected to the base SL? What would be an example to illustrate this item?

The general idea is not to force but to allow : doing this extends the search space. In general, if you can extend the search space in an interesting way without increasing too much the search time, try to. Some examples of components using stable regions close to the base still-life :

Code: Select all

x = 203, y = 70, rule = B3/S23
2bo$obo$b2o9bobo$13b2o$13bo7$20bo$7bo13bo5bo$5bobo11b3o4bo$6b2o18b3o$
47bo$45b2o$46b2o2$29bo$29bobo22bo$29b2o22bo$43bo9b3o$43bobo$43b2o3$4bo
bo$5b2o$5bo$197bo$141bo54bo$141bobo52b3o$141b2o$201bo$26b2o172bo$27bo
117bo54b3o$26bo117bo32b2ob2ob2o$26b2o100b2ob2o11b3o30bo3bobo$28bob2o
96bo3bo45bobo2bobo12b2o$28b2obo9b2o86bobo45b2ob2o2b2o12bobo$40b2o86b2o
b2o9b2o54bo$27bob2o11bo99bobo$27b2obo111bo4$141b2o$140b2o$142bo39bo$
182b2o$9b2o117b3o50bobo$2bo5bobo119bo$2b2o6bo118bo57b3o$bobo183bo$188b
o2$170b3o$172bo$171bo17b2o$188b2o$190bo6$180b2o$179bobo$181bo!

The first reaction was found by May13 and uses a snake bridge to build an egyptian walk (the only known way to convert a snake to egyptian walk to my knowledge). The second was found by me, using a bookend saved 30 gliders over the former recipe.

confocaloid wrote: August 13th, 2024, 10:48 pm This partial was found with LLS while trying to find a conversion from xs14_6ikm93z01 to xs22_0c88m596z321346:
Code: Select all
#C ./lls input.txt -p "<41"
x = 13, y = 14, rule = B3/S23
3bo$4o3bo2$7b2o$2b2o3bo$2bo$3bo5bo2bo$2b2o3b2o3bo$bo10bo$b3o3bo2b2o$4b
o2bobo$ob2o$2obobo$4b2o!

This partial and the associated input file have some flaws in my opinion, especially compared to some other partials you provide below. First, it takes a long time (9 ticks) to complete. This slows down LLS searches and makes it less likely to find a replacement pattern for the active region on the right. A good workaround for this might be to reduce the margin around the still-life to two cells and to advance the top by two generations. Furthermore, the big active region is too sparse : it's low population hides a high complexity and therefore a lack of simple predecessors. This path looks worth exploring, but only after spending a lot of time on developping simpler ideas.

confocaloid wrote: August 13th, 2024, 10:48 pm Several other partials:

Code: Select all

x = 93, y = 43, rule = B3/S23
66bobo$20bo24bo19bo$2bo25bo13bo17bo5bo19bo$2bo3bo13b2o3b2o15bo3b2o13bo
4b2o13bobo2bo4bo$bob2obo15bobobo14bob2obo14bob3o16b2ob2o3bo$3b2o18bo
19b2o4bo14b2o17b2o5bo$8b2o18bo19bobo17bo2bo16bo$bo5b3o11bo5b2o12bo5b2o
12bo5b2ob2o9bo5b2obo$b3o17b3o4bobo10b3o4bo12b3o17b3o3bo3bo$4bo3bo15bo
2bobo14bo4bo14bo4bo14bo2bobo$ob2o16bob2o16bob2o5bo10bob2o16bob2o6bo$2o
bobo14b2obobo14b2obobo14b2obobo14b2obobo3bo$4b2o18b2o18b2o18b2o18b2o
17$3bo39bo19bo19bo$4o6b3o7b3o17b4o16b4o3bo12b4o3bo$7bo20b2o17bo19bo$7b
o19b2obo16bo19b2o18b2o$2b2o3bobo12b2o3bo14b2o3b2ob2o10b2o3bo14b2o3bo$
2bo4bob2o11bo4b2o13bo5bo3bo9bo4bo14bo$3bo9bo9bo3b2o14bo4bo14bo3b2obo
12bo5bo2bo$2b2o4b2o2bo9b2o8bo9b2o8bo9b2o3b2o13b2o3b2o3bo$bo5b2o2b2o8bo
5bo3b2o8bo6b3obo8bo5bo2b2o9bo10bo$b3o4bo12b3o3bobobobo7b3o3bo6bo6b3o3b
o13b3o3bo2b2o$4bo19bo2bobo14bo5bo13bo4bo14bo2bobo$ob2o16bob2o16bob2o
16bob2o16bob2o$2obobo14b2obobo14b2obobo14b2obobo14b2obobo$4b2o18b2o18b
2o18b2o18b2o!

The most promising partial here seems to be the first one on the first row. It has two small regions, including a spark predecessor, and last for only 4 ticks. Following this lead allowed me to complete the component quite quickly, this will be an occasion to make a concrete walkthrough on LLS syntheses.

I started with an input file like this one, in order to find similar results :

Code: Select all

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * 0 0 0 * * * * * * * * * *
* 0 0 0 0 0 0 * * * * * * * *
0 0 0 1 0 0 0 0 * * * * * * *
0 0 0 1 1 1 0 0 * * * * * * *
0 0 0 0 0 0 1 0 0 * * * * * *
0 0 1 0 1 1 0 0 0 0 * * * * *
0 0 1 1 0 1 0 1 0 0 * * * * *
0 0 0 0 0 0 1 1 0 0 * * * * *

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
0 0 0 1 * * * * * * * * * * *
0 0 0 1 1 1 * * * * * * * * *
0 0 0 0 0 0 1 * * * * * * * *
0 0 1 0 1 1 0 * * * * * * * *
0 0 1 1 0 1 0 1 * * * * * * *
0 0 0 0 0 0 1 1 * * * * * * *

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
0 0 0 1 * * * * * * * * * * *
0 0 0 1 1 1 * * * * * * * * *
0 0 0 0 0 0 1 * * * * * * * *
0 0 1 0 1 1 0 * * * * * * * *
0 0 1 1 0 1 0 1 * * * * * * *
0 0 0 0 0 0 1 1 * * * * * * *

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
0 0 0 1 * * * * * * * * * * *
0 0 0 1 1 1 * * * * * * * * *
0 0 0 0 0 0 1 * * * * * * * *
0 0 1 0 1 1 0 * * * * * * * *
0 0 1 1 0 1 0 1 * * * * * * *
0 0 0 0 0 0 1 1 * * * * * * *

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * 0 0 0 0 * * * * *
* * * * * 0 0 0 0 0 0 * * * *
* * 0 0 0 0 0 1 1 0 0 0 * * *
* 0 0 0 0 0 1 0 0 1 0 0 * * *
0 0 0 1 0 0 1 1 0 1 0 0 * * *
0 0 0 1 1 1 0 0 1 0 0 0 * * *
0 0 0 0 0 0 1 0 0 0 0 * * * *
0 0 1 0 1 1 0 0 0 0 * * * * *
0 0 1 1 0 1 0 1 0 0 * * * * *
0 0 0 0 0 0 1 1 0 0 * * * * *

After some searches with various population constraints, I found this interesting pattern :

Code: Select all

x = 10, y = 11, rule = B3/S23
5bo$4o$b5o$9bo$6bobo$bo4b2o$b3o$4bo$ob2o$2obobo$4b2o!

The region on the right is nearly stable and looks familiar. It is produced when a glider hits a snake (or a long^n snake of course) :

Code: Select all

x = 9, y = 3, rule = B3/S23
ob2o2bobo$2obo2b2o$7bo!

I only had to solve the top. spark_search.py gave no result, so I went back to LLS. After exploring a little more and finding nothing better at this generation, I decided to look for a predecessor of my result and separate it into two regions. On my first attempt, I obtained this :

Code: Select all

x = 11, y = 13, rule = B3/S23
bo$bo$bo3b2o$2o2b2o$bo2bo5bo$bo2b2o3bo$6bobo$bo4b2o$b3o$4bo$ob2o$2obob
o$4b2o!

The top left part of generation one looks a little like this xs13 :

Code: Select all

x = 7, y = 6, rule = B3/S23
2b2o$bobo$o$b2o$3bob2o$3b2obo!

I only kept three cells of it, to leave the search space open and ran the final search using this file :

Code: Select all

* * * * 0 0 * * * * * * * * *
* * * * 0 0 * * * * * * * * *
* * * * 0 0 * * * * * * * * *
* * * * 0 0 * * * * * * * * *
* * * * 0 1 0 0 * * * * 1 * *
* * * * 0 0 1 1 * * * 1 * * *
* 0 0 0 0 0 0 0 1 0 1 * * * *
0 0 0 1 0 0 0 0 1 1 * * * * *
0 0 0 1 1 1 0 0 0 * * * * * *
0 0 0 0 0 0 1 0 0 * * * * * *
0 0 1 0 1 1 0 0 0 0 * * * * *
0 0 1 1 0 1 0 1 0 0 * * * * *
0 0 0 0 0 0 1 1 0 0 * * * * *

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * 0 0 0 * *
* * * * * * * * * 0 0 1 0 0 0
* 0 0 0 0 0 0 0 1 0 1 0 0 0 0
0 0 0 1 0 0 0 0 1 1 0 0 0 0 0
0 0 0 1 1 1 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 1 0 0 0 0 0 0 0 0
0 0 1 0 1 1 0 0 0 0 0 0 0 0 0
0 0 1 1 0 1 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 1 1 0 0 0 0 0 0 0

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
0 0 0 1 * * * * * * * * * * *
0 0 0 1 1 1 * * * * * * * * *
0 0 0 0 0 0 1 * * * * * * * *
0 0 1 0 1 1 0 * * * * * * * *
0 0 1 1 0 1 0 1 * * * * * * *
0 0 0 0 0 0 1 1 * * * * * * *

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
0 0 0 1 * * * * * * * * * * *
0 0 0 1 1 1 * * * * * * * * *
0 0 0 0 0 0 1 * * * * * * * *
0 0 1 0 1 1 0 * * * * * * * *
0 0 1 1 0 1 0 1 * * * * * * *
0 0 0 0 0 0 1 1 * * * * * * *

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
0 0 0 1 * * * * * * * * * * *
0 0 0 1 1 1 * * * * * * * * *
0 0 0 0 0 0 1 * * * * * * * *
0 0 1 0 1 1 0 * * * * * * * *
0 0 1 1 0 1 0 1 * * * * * * *
0 0 0 0 0 0 1 1 * * * * * * *

* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * * * * * * * * * *
* * * * * * 0 0 0 0 * * * * *
* * * * * 0 0 0 0 0 0 * * * *
* * 0 0 0 0 0 1 1 0 0 0 * * *
* 0 0 0 0 0 1 0 0 1 0 0 * * *
0 0 0 1 0 0 1 1 0 1 0 0 * * *
0 0 0 1 1 1 0 0 1 0 0 0 * * *
0 0 0 0 0 0 1 0 0 0 0 * * * *
0 0 1 0 1 1 0 0 0 0 * * * * *
0 0 1 1 0 1 0 1 0 0 * * * * *
0 0 0 0 0 0 1 1 0 0 * * * * *

I quickly obtained this :

Code: Select all

x = 12, y = 13, rule = B3/S23
6b2o$o$6bo$3o2bobo$2bobo6bo$5b2o3bo$7bobo$2bo4b2o$2b3o$5bo$bob2o$b2obo
bo$5b2o!

I noticed the likeness with the same xs13 as before, tried it as a replacement, added a glider for stabilisation, replaced the burning fuse with the snake+glider collision and obtained :

Code: Select all

x = 15, y = 15, rule = B3/S23
9bo$8bo$8b3o$o$6b2o$3o2bobo$2bobo$5b2o$7bob3obo$2bo4b2ob3o$2b3o7b3o$5b
o$bob2o$b2obobo$5b2o!

On the left, I noticed a tail shape - like part of an eater. I tried the 2G collision, it almost worked, so I added a glider for stabilisation, then another on the left for cleanup, and the final step was complete :

Code: Select all

x = 31, y = 19, rule = B3/S23
21bo$21bobo$4bo16b2o$5b2o$4b2o3$15b2o$14bobo8bo$6b3o4bo11bobo$8bo5b2o
9b2o$b2o4bo8bob2o$obo8bo4b2obo$2bo8b3o$14bo$10bob2o$10b2obobo13b2o$14b
2o12b2o$30bo!

The rest was only looking for a few components to build the xs13 :

Code: Select all

x = 172, y = 39, rule = B3/S23
70bo$69bo$69b3o11$107bo$105bobo54bo$106b2o4bobo47bobo$5bo106b2o31bo16b
2o$6bo106bo32b2o$4b3o103bo34b2o$bo108b2o$b2o106bobo$obo4bo36b2o15bo52b
2o40b2o$5b2o38bo15bobo51bo39bobo8bo$6b2o36bo16b2o51bo32b3o4bo11bobo$
44b2o68b2o33bo5b2o9b2o$58bo57bob2o22b2o4bo8bob2o$bo7b2o30bo14b2o53bo4b
2obo21bobo8bo4b2obo$b3o4b2o31b3o13b2o52b3o29bo8b3o$4bo5bo33bo69bo40bo$
ob2o36bob2o66bob2o37bob2o$2obobo34b2obobo12b2o50b2obobo35b2obobo13b2o$
4b2o38b2o11b2o55b2o39b2o12b2o$59bo111bo$66b2o$65b2o$67bo$72b3o$72bo$
73bo!

Posted: **August 14th, 2024, 9:20 am**

confocaloid wrote: August 13th, 2024, 10:48 pm What is the idea behind forcing stable regions connected to the base SL? What would be an example to illustrate this item?

There's a couple of ways I think about this:

Forcing a stable region makes it so that at least some of the "pieces" in the reaction which cause our desired transformation are easy ones.
There's only so many gliders you can fit together to hit the target (close to) simultaneously. With that in mind, it makes sense for the construction to be done in stages, and for things to remain in control between stages, it makes sense for each stage to leave a stable result behind. Therefore, we can expect that the final step for our desired transformation will make use of some stable scaffolding nearby.

Anyway, with all this discussion about applying LLS to synthesis problems recently, I thought I should share the script I've been using to prepare LLS input files for the last few years. This may not be useful to people since May13 recently shared a script for the same purpose, but here it is anyway:

Code: Select all

# llssynthesis.py
import golly as g
import string

gens = int(g.getstring("How many generations should it take the left pattern to turn into the right?","5"))

selrect = g.getselrect()
cells = g.getcells(selrect)

if selrect[2]%2 == 1:
    g.exit("The pattern should have an even width")

alphabet = list(string.ascii_lowercase)
x_count = 0
y_count = 0

out = ""
for y in range(selrect[3]):
    for x in range(selrect[2]//2):
        if g.getcell(selrect[0]+x,selrect[1]+y)%6 == 0:
            out += "* "
        elif g.getcell(selrect[0]+x,selrect[1]+y) in (1,3):
            out += "1 "
        elif g.getcell(selrect[0]+x,selrect[1]+y) in (2,5):
            out += "0 "
        elif g.getcell(selrect[0]+x,selrect[1]+y) == 4:
            out += (alphabet[y_count%26] + str(x_count) + " ")
        x_count += 1
    out = out[:-1]
    out += "\n"
    x_count = 0
    y_count += 1
    
out += "\n"
y_count = 0   
for y in range(selrect[3]):
    for x in range(selrect[2]//2):
        if g.getcell(selrect[0]+x,selrect[1]+y) == 4:
            out += (alphabet[y_count%26] + str(x_count) + " ")
        elif g.getcell(selrect[0]+x,selrect[1]+y) == 3:
            out += "1 "
        elif g.getcell(selrect[0]+x,selrect[1]+y) == 5:
            out += "0 "
        else:
            out += "* "
        x_count += 1
    out = out[:-1]
    out += "\n"
    x_count = 0
    y_count += 1

for z in range(gens-2):
    out += "\n"
    for y in range(selrect[3]):
        for x in range(selrect[2]//2):
            out += "* "
        out = out[:-1]
        out += "\n"
        
out += "\n"
for y in range(selrect[3]):
    for x in range(selrect[2]//2,selrect[2]):
        if g.getcell(selrect[0]+x,selrect[1]+y)%6 == 0:
            out += "* "
        elif g.getcell(selrect[0]+x,selrect[1]+y) == 1:
            out += "1 "
        elif g.getcell(selrect[0]+x,selrect[1]+y) == 2:
            out += "0 "
    out = out[:-1]
    out += "\n"
    
g.setclipstr(out)

It's designed to be applied to a LifeHistory pattern like the following:

Code: Select all

#C An input I used while searching for the 77P6H1V1 synthesis
x = 68, y = 34, rule = LifeHistory
15BA18B2F30.2F$14BA19BF32.F$14B3A17B$34B$17BED4.11B$11B3A2BED6.20B$5B
2A8BE2D7.14B2A4B$6BA7BE4D7.14BA5B$6BAB2ABABE6D7.13BAB2A3B$3B2ABABAB2A
BE7D7.9B2ABA2BA4B$3B2AB2A5BE8D7.8B2ABAB2A5B$13BA9D7.12BA2B2A4B$3B5A4B
AB10D6.7B5A2B3A5B$ABABA3BA2BA2B4E7D5.4BABABA3BAB3A2B2A2B$2A5BA2BA3BA
4E7D4.4B2A5BA2BA3BAB2A2B$8B2A4B3A3E7D2.DE11B2A6BABA2B$5BA11BA3E8DE9BA
8BA4BA2B$4BABA7B3ABA2E7DE2BA6BABA7B3AB3A2B$5BABA5BA2BABA2E6DE3BABA5BA
BA5BA2BA3BA2B$6BA6BA2BAB2AE5DE4B2A7BA6BA2B2ABA4B$14B2A6BA3E2BA19B2A9B
$21BA6BA25B3A3B$20BA3B2A2BA25B3A4B$19BA4BA28B3A6B$18BA6BA26BA4B3A3B$
18BABA3B2A26BABAB2ABA3B$15BA3BABABA25BA3BABA7B$14BABA4BAB5A20BABA4BAB
5AB$15BABA3BA5BA21BABA3BA5BAB$16BA3B2AB2A25BA3B2AB2A4B$21BAB2A30BAB2A
4B$20BA33BA8B$19BA33BA9B4.F$19B2A32B2A8B3.2F!

The left half of your selection is interpreted as the initial conditions, and the right half is interpreted as your desired pattern. Here are what the different LifeHistory states correspond to:

State 0 and 6 are "don't care" cells. I tend to use state 6 to mark the boundary of the pattern.
State 1 are cells that must be on in the first generation
State 2 are cells that must be off in the first generation
State 3 are cells that must be on in the first and second generation
State 4 are cells that must be stationary over the first and second generation
State 5 are cells that must be off in the first and second generation

States 3-5 are only meant to be used for the left half. Running the script copies the LLS input file to your clipboard.

Posted: **August 15th, 2024, 12:42 am**

confocaloid wrote: August 10th, 2024, 2:47 pm An unsolved idea of a conversion from xs14_69q4goz023 to xs22_g8ge9a4z1iu146:

Code: Select all

x = 47, y = 27, rule = B3/S23
29bo$30bo$28b3o5$6bo2b2o$2b2o2bo4b2o24bobo$2b2o3b3ob2o23b2o$2obo4bobo
2bo26b2o$2bob3obo2bobo17bo3bo$2obob2o2bo2b2o16b4obo2bo3bo$2o3bob2obo2b
o2bo16bob2o$bo2bo2b2o7bo15bo3b2ob2obo$3b3o5bo3bo16bo9bobobo$b2o6b5o18b
2o2bo2bo6bo$o3bo3bo3bo2bo17bobo3bobo$4b2o3bobo3bo17b4ob2ob3o$6bo2b3o4b
o23bobo$bo4b5ob4o15bo6b2o4bo$obo27bobo4b2o3bo2bo$o2bo26bo2bo5bobo2b2o$
b2o2bo25b2o2bo6b4o$2bob2o12b2o12bob2o$2bo15bobo11bo$b2o15bo12b2o!

I got several lower-population partials for the same target still life, but so far nothing that looks like an easy path to a solution. Several partials have a (pre-)block in a specific location (top row):

Code: Select all

x = 210, y = 76, rule = B3/S23
6bo$21bo$4b2o15bobobo$29bo$5bobobo2bo12bo17bo19bo19bo$2obo2bo3bo9bo3bo
2b2o12bo2b2obo13bo2b2obo13bo2b2obo$bob3ob2obo9b2o2bo15b2obo16b2obo16b
2obo$25bo2bo14b2o2bo15b2o2bobo13b2o2bo$8bo16bo19bo19bo19bo2bo$bo3bobob
o11bo3bo2b2o11bo3b2obo12bo3b2obo12bo3b2o$obo4bo12bobo4bo12bobo5b2o10bo
bo17bobo5b2o$o2bo16bo2bo4bo11bo2bo4bo11bo2bo4bobo9bo2bo5bo$b2o2bo15b2o
2bo15b2o2bo15b2o2bo15b2o2bo$2bob2o16bob2o16bob2o16bob2o16bob2o$2bo19bo
19bo19bo19bo$b2o18b2o18b2o18b2o18b2o14$7bo74bo$b2o3bo73bo$5bo14bo3b2ob
o52bo3bo82bo$o2bob4o16b4o11bo3b3o20bo16bo4bo11bo23bob2o12bo64bo$2bo2b
2o13bob2o2bo14bo5bo19bo13b2o3b2o15bobo35bobobo19b2o14b2o7bo9bo$2o2bo3b
2o18bo12bo2b2obo12bo2bobo3b2o12bo3bo13bo2b3o13bo2bo2bobo11bo3b3o13bo
24bo4bo10bob3obobo$5bobobo10bo3bo15b2obo6bo9bo3b2o3bo11bobo17bobob4ob
2o9b3o2bobobo11bo2bo3bo11bobobobo13bob2obo3bo9b3o3bob2o$ob3obo2b2o9bob
2o2b2o3bo11bobob2o2bo9b2ob2ob3o11b3o16bobobo6bo10bo2b2o14b2o2bobobo11b
2o4b2o12b2o3bo2b2o12bo4bo$3bobo2b2obo11b2o2bobo2bo13bo4bo11bo5bo17bo
15b2o3bo17bo3bo12b2o18bo6bo15bo4bo11bo$4bob2o2b2o13bobo2bo14b2o4bo14b
2o2bo15b2o3bo13bobo18bobobo14bobo18bobo16b2obo15bobo$bo4b2o13bo3b3o13b
o5b2o12bo3b3obo11bo3b3ob2o10bo3b2o14bo4bo3bo10bo3b3o13bo3b2obo12bo6bo
12bo4bobo$obo6bo10bobo5bobo9bobo5bo2bo8bobo7bo9bobo7bo9bobo4bo12bobo6b
3o8bobo6bo10bobo17bobo4bo12bobo4bo$o2bo4b3o9bo2bo4bo11bo2bo5b2o9bo2bo
5bo10bo2bo5bo10bo2bo16bo2bo16bo2bo5bo10bo2bo4bo11bo2bo5bo10bo2bo$b2o2b
o15b2o2bo15b2o2bo15b2o2bo15b2o2bo15b2o2bo15b2o2bo15b2o2bo15b2o2bo15b2o
2bo15b2o2bo$2bob2o16bob2o16bob2o16bob2o16bob2o16bob2o16bob2o16bob2o16b
ob2o16bob2o16bob2o$2bo19bo19bo19bo19bo19bo19bo19bo19bo19bo19bo$b2o18b
2o18b2o18b2o18b2o18b2o18b2o18b2o18b2o18b2o18b2o12$4b2o$4bo3bo2bo22bobo
$2bobo4bo25bo26bo30bo$2bo2bob3o23bo3bo24bo3bo$2b2o5bob2o21bo5b3o19b2o
2bo4bo21b2ob2o$2b3o2b3o22bo4bo27bo3b2o$3bo3b2o6bo17bo6bo21b2o3b2o22b3o
2bo3bo$3bobo2bobo21bob3obobo3bo17b2o32bo5bo$2b2o4b3ob3obo15b2o5bo3bo
18b2obobo3bo20bo2bo2bobo$4bobo4bobo21b2obobo2bo20bo5b2o20bo5bobo$3bo3b
3o5bo17b3o3b3o21b3obo24bo3b2o$5b2o2b2o3b2o19bo4bo24bo3bo23bob2ob2o$bo
5bobob2obo16bo4b2o2bob2o17bo5bo2b2o18bo4bob2o$obo4b3o2bo17bobo5b2obo
18bobo5b2o19bobo$o2bo26bo2bo26bo2bo25bo2bo$b2o2bo25b2o2bo25b2o2bo24b2o
2bo$2bob2o26bob2o26bob2o25bob2o$2bo29bo29bo28bo$b2o28b2o28b2o27b2o!

The LLS input file generated from this pattern, appended after the RLE:

Code: Select all

x = 100, y = 20, rule = B3/S23
3$20b14o$20b14o$20b14o$20b14o$20b14o$20b14o$20b14o$20b14o10bo$23b11o9b
obo$24b10o9bo2bo$bo19bo3b9o7bob3o15bo19bo$obo17bobo4b7o6bobo17bobo17bo
bo$o2bo16bo2bo4b6o6bo2bo16bo2bo16bo2bo$b2o2bo15b2o2bo15b2o2bo15b2o2bo
15b2o2bo$2bob2o16bob2o16bob2o16bob2o16bob2o$2bo19bo19bo19bo19bo$b2o18b
2o18b2o18b2o18b2o!

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
* * * * * * * * * * * * * * 0 0 0 0 0 0
* * * * * * * * * * * * * * 0 0 0 0 0 0
* * * * * * * * * * * * * * 0 0 0 0 0 0
* * * * * * * * * * * * * * 0 0 0 0 0 0
* * * * * * * * * * * * * * 0 0 0 0 0 0
* * * * * * * * * * * * * * 0 0 0 0 0 0
* * * * * * * * * * * * * * 0 0 0 0 0 0
* * * * * * * * * * * * * * 0 0 0 0 0 0
0 0 0 * * * * * * * * * * * 0 0 0 0 0 0
0 0 0 0 * * * * * * * * * * 0 0 0 0 0 0
0 1 0 0 0 * * * * * * * * * 0 0 0 0 0 0
1 0 1 0 0 0 0 * * * * * * * 0 0 0 0 0 0
1 0 0 1 0 0 0 0 * * * * * * 0 0 0 0 0 0
0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 1 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
1 * 1 * * * * * * * * * * * * * * * * *
1 * * 1 * * * * * * * * * * * * * * * *
* 1 1 * * 1 * * * * * * * * * * * * * *
* * 1 * 1 1 * * * * * * * * * * * * * *
* * 1 * * * * * * * * * * * * * * * * *
* 1 1 * * * * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
1 * 1 * * * * * * * * * * * * * * * * *
1 * * 1 * * * * * * * * * * * * * * * *
* 1 1 * * 1 * * * * * * * * * * * * * *
* * 1 * 1 1 * * * * * * * * * * * * * *
* * 1 * * * * * * * * * * * * * * * * *
* 1 1 * * * * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
1 * 1 * * * * * * * * * * * * * * * * *
1 * * 1 * * * * * * * * * * * * * * * *
* 1 1 * * 1 * * * * * * * * * * * * * *
* * 1 * 1 1 * * * * * * * * * * * * * *
* * 1 * * * * * * * * * * * * * * * * *
* 1 1 * * * * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
1 * 1 * * * * * * * * * * * * * * * * *
1 * * 1 * * * * * * * * * * * * * * * *
* 1 1 * * 1 * * * * * * * * * * * * * *
* * 1 * 1 1 * * * * * * * * * * * * * *
* * 1 * * * * * * * * * * * * * * * * *
* 1 1 * * * * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* 1 * * * * * * * * * * * * * * * * * *
1 * 1 * * * * * * * * * * * * * * * * *
1 * * 1 * * * * * * * * * * * * * * * *
* 1 1 * * 1 * * * * * * * * * * * * * *
* * 1 * 1 1 * * * * * * * * * * * * * *
* * 1 * * * * * * * * * * * * * * * * *
* 1 1 * * * * * * * * * * * * * * * * *

* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * * * * * * * * * * * * * * * * * *
* * * 0 0 0 * * * * * * * * * * * * * *
* * 0 0 0 0 0 * * * * * * * * * * * * *
* 0 0 0 1 0 0 0 * * * * * * * * * * * *
0 0 0 1 0 1 0 0 0 * * * * * * * * * * *
0 0 0 1 0 0 1 0 0 * * * * * * * * * * *
0 1 0 1 1 1 0 0 0 * * * * * * * * * * *
1 0 1 0 0 0 0 0 * * * * * * * * * * * *
1 0 0 1 0 0 0 0 * * * * * * * * * * * *
0 1 1 0 0 1 0 0 * * * * * * * * * * * *
0 0 1 0 1 1 0 0 * * * * * * * * * * * *
0 0 1 0 0 0 0 0 * * * * * * * * * * * *
0 1 1 0 0 0 0 * * * * * * * * * * * * *

edit 2: here are two other partials/variants:

Code: Select all

x = 38, y = 18, rule = B3/S23
5bo5bo21bo$4bo25bobo3bo$4bo4b2o19bo2bobo$4bo2b2o19bo3b3o$5b2o20b3o5bob
o$36bo$8b2o3bo18b2o2bo$2o2b2o2bo5bo9b2o2b2o2bo3bo$2o3bo3bo2b2o10b2o3bo
3bo$4bo3b2o2bobo13bo3b2o$4b2o22b2o$bo23bo9bo$obo5b4o12bobo5b3obo$o2bo
20bo2bo8bo$b2o2bo19b2o2bo7bo$2bob2o5bobo12bob2o$2bo8bo14bo6b3o$b2o7bo
14b2o!

edit 3: no longer unsolved, see viewtopic.php?p=192325#p192325

ConwayLife.com

Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete

Re: Incomplete search patterns - try to complete