Search Requests Thread

[Anivec]

Here’s a thread for requesting for searches because people might not have the time nor resources to get good search results.

[pipsqueek]

I request for a search of all 9-cell patterns to see which one last the longest.

[Anivec]

I’d like to run a catforce search on this, but I obviously don’t know how to use catforce.

Code: Select all

x = 29, y = 22, rule = LifeHistory
17.A$16.A.A$16.A.3A$13.2A.A4.A$4.A8.A.A.A.A.A$3.A.A9.A.A.2A$3.A.A8.A.
A$.3A.2A8.A$A21.2A$.3A.2A5.3A6.A.A$3.A.2A4.A3.A5.2A$10.A5.A8.2A$10.A5.
A8.A.A$10.A5.A10.A$11.A3.A11.2A$12.3A5$22.2A$22.2A!

[Moosey]

I request for a search of all 9-cell patterns to see which one last the longest.

There are 9-cell patterns lasting arbitrarily long:

Code: Select all

x = 1173, y = 1172, rule = B3/S23
2bo$obo$b2o1168$1171b2o$1171b2o!

You couldn't exhaustively search all 9-cell patterns, anyway, since there's a (countable) infinity of them.


A search of 9-mcps patterns could be doable, I suppose? Not sure how large the search space is off the top of my head.

[confocaloid]

Maybe someone could double-check and extend the following:

Code: Select all

1 polyplets of size 1, 1 patterns with MCPS <= 1, 1 patterns with MCPS = 1
2 polyplets of size 2, 3 patterns with MCPS <= 2, 2 patterns with MCPS = 2
5 polyplets of size 3, 11 patterns with MCPS <= 3, 8 patterns with MCPS = 3
22 polyplets of size 4, 50 patterns with MCPS <= 4, 39 patterns with MCPS = 4
94 polyplets of size 5, 285 patterns with MCPS <= 5, 235 patterns with MCPS = 5
524 polyplets of size 6, 1939 patterns with MCPS <= 6, 1654 patterns with MCPS = 6
3031 polyplets of size 7, 14605 patterns with MCPS <= 7, 12666 patterns with MCPS = 7
18770 polyplets of size 8, 115597 patterns with MCPS <= 8, 100992 patterns with MCPS = 8

The first column is the number of polyplets with n cells; it agrees with OEIS A030222 up to n = 8. Second and third columns seem to agree with previous manual enumeration (see quote below) up to n = 4. I did not continue past n = 8 as the Python script I used for this is extremely inefficient.

Edit: I got the following line for n = 9:

Code: Select all

118133 polyplets of size 9, 938666 patterns with MCPS <= 9, 823069 patterns with MCPS = 9

A search of 9-mcps patterns could be doable, I suppose? Not sure how large the search space is off the top of my head.

Did anyone enumerate all distinct patterns with a given MCPS for smaller values? I just tried to enumerate patterns up to MCPS=4 manually and got 1, 2, 8, 38 respectively, but I might have missed/double-counted some patterns.

Code: Select all

x = 79, y = 39, rule = LifeHistory
A3$A3.A$A2.A3$A2.A3.A3.A3.A4.A4.A$A2.B2.A3.B3.A4.A4.B3.2A$A2.A2.A3.A
4.A2.A4.A4.A3$A2.A2.A3.A3.A3.A3.A$A2.B2.B2.A3.B3.A3.B3.2A2.2A2.A$A2.A
2.B2.A3.A3.B3.B3.A3.B3.2A$A2.A2.A2.A3.A3.A3.A3.A3.A3.A3$A3.A4.A4.A3.A
3.A3.A$.A3.A3.A3.A3.B3.A3.B4.2A3.BA3.A4.A3.A3.A4.A4.A4.A4.A2.A.A$A3.B
3.A3.A3.A3.B3.B4.A4.A4.A.A2.2A2.A3.A4.A4.A3.2A3.AB4.B$A3.A3.A3.A3.A3.
A3.A4.A4.A4.A4.A3.2A2.A4.A3.2A4.A4.A4.A$53.A2.A3$2A$2A3$7.A2.A17.A$A.
A3.A4.A4.A5.A.A4.B$.A5.A4.A2.A.A5.B6.A$A5.A4.A4.A5.A6.A3$3.A5.A5.A$2.
A5.B5.B$.A5.A5.B$A5.A5.A!

I think it's 39. You're missing this one.

Code: Select all

x = 3, y = 3, rule = B3/S23
obo$bo$bo!

[confocaloid]

Maybe someone could double-check (verify) and extend the following table?

Code: Select all

   |  2    3    4    5    6    7    8    9   10
---+-------------------------------------------
 2 |  1    .    .    .    .    .    .    .    .
 3 |  0    3    .    .    .    .    .    .    .
 4 |  1    2    6    .    .    .    .    .    .
 5 |  1    2    7   15    .    .    .    .    .
 6 |  1    4   22   67  200    .    .    .    .
 7 |  3   18   93  405 2048    ?    .    .    .
 8 |  3   43  268 1106 8452    ?    ?    .    .
 9 |  5   81  702 3730    ?    ?    ?    ?    .
10 |  ?    ?    ?    ?    ?    ?    ?    ?    ?

Assuming it is correct, it gives the number of still lives of any kind (strict, pseudo, quasi, constellations all included) with a specific bounding box, up to rotations and reflections. For example, according to the table, there are exactly 2048 distinct still lives with bounding box 7-by-6.

I also tried searching the main diagonal (1, 3, 6, 15, 200, ...) in the OEIS, and got no results.

Edit (2024-02-11): expanded table, assuming no bugs/errors:

Code: Select all

   |   2     3     4     5     6    7    8
---+--------------------------------------
 2 |   1     .     .     .     .    .    .
 3 |   0     3     .     .     .    .    .
 4 |   1     2     6     .     .    .    .
 5 |   1     2     7    15     .    .    .
 6 |   1     4    22    67   200    .    .
 7 |   3    18    93   405  2048 9244    .
 8 |   3    43   268  1106  8452    ?    ?
 9 |   5    81   702  3730 35800    ?    ?
10 |  10   150  1650 13126     ?    ?    ?
11 |  11   313  4358     ?     ?    ?    ?
12 |  21   722 12501     ?     ?    ?    ?
13 |  32  1624     ?     ?     ?    ?    ?
14 |  49  3457     ?     ?     ?    ?    ?
15 |  83  7259     ?     ?     ?    ?    ?
16 | 136 15494     ?     ?     ?    ?    ?
17 | 213     ?     ?     ?     ?    ?    ?
18 | 364     ?     ?     ?     ?    ?    ?
19 | 584     ?     ?     ?     ?    ?    ?
20 | 974     ?     ?     ?     ?    ?    ?

Update (2024-02-12): I counted 9244 still lives with bounding box 7x7, including one 28-bit (xs28_db8n9arz3123032) and six 27-bit (xs27_9f0f9arz3113032, xs27_9f0v1arz3123032, xs27_9f0v1qbz3123032, xs27_db0v1arz3123032, xs27_db8n9arz330321, xs27_rb8n9arz230321).
Update (2024-02-14): updated the table with f(11,4) = 4358, f(12,4) = 12501, f(15,3) = 7259, f(16,3) = 15494.
Update (2024-02-19): updated the table with f(10,5) = 13126, f(9,6) = 35800.

[confocaloid]

[...] double-check [...]

Crossposting another request for double-checking:

Is there a list of ways that two pentadecathlons can be placed such that their envelopes overlap but they otherwise do not influence each others' evolution?

I found 13 possibilities, but someone else should double-check this to see whether this is really correct:

Code: Select all

x = 133, y = 68, rule = B3/S23
3o27b3o27b3o27b3o27b3o$3o6bo20b3o6bo20b3o27b3o27b3o6bo$bo6b3o20bo7bo
21bo6b3o20bo29bo6b3o$bo5b5o19bo6bobo20bo6bobo20bo6b3o20bo5b2ob2o$bo29b
o7bo21bo6b3o20bo5bo3bo19bo4b3ob3o$obo27bobo6bo20bobo5b3o19bobo3bo5bo
17bobo3b3ob3o$39bo28b3o55b3ob3o$39bo28b3o24bo7bo22b3ob3o$obo27bobo5bob
o19bobo5bobo19bobo2bo7bo16bobo4b2ob2o$bo29bo7bo21bo6b3o20bo29bo6b3o$bo
5b5o19bo7bo21bo29bo4bo5bo18bo7bo$bo6b3o20bo29bo29bo5bo3bo19bo$3o6bo20b
3o27b3o27b3o5b3o19b3o$3o27b3o27b3o27b3o27b3o17$3o27b3o27b3o6bo20b3o27b
3o$3o27b3o6bo20b3o5b3o19b3o27b3o$bo7bo21bo6b3o20bo5bobobo19bo7bo21bo$b
o7bo21bo5bobobo19bo5bobobo19bo6b3o20bo6b3o$bo6bobo20bo5bobobo19bo6b3o
20bo5b2ob2o19bo6bobo$obo6bo20bobo5b3o19bobo6bo20bobo3b3ob3o17bobo5b3o$
9bo29bo56b3ob3o25b3o$9bo86b3ob3o25b3o$obo6bo20bobo27bobo6bo20bobo3b3ob
3o17bobo5b3o$bo6bobo20bo7bo21bo6b3o20bo5b2ob2o19bo6bobo$bo7bo21bo6b3o
20bo5bobobo19bo6b3o20bo6b3o$bo7bo21bo5bobobo19bo5bobobo19bo7bo21bo$3o
27b3o4bobobo18b3o5b3o19b3o27b3o$3o27b3o5b3o19b3o6bo20b3o27b3o$39bo16$
3o27b3o27b3o$obo27bobo27bobo$3o6bobo2bobo13b3o7bo4bo14b3o6b8o$3o2b2obo
2bo2bo2bob2o9b3o5b2ob4ob2o12b3o6bob4obo$3o6bobo2bobo13b3o7bo4bo14b3o6b
8o$3o27b3o27b3o$obo27bobo27bobo$3o27b3o27b3o!

[ElijahKen]

I would like a stable catalyst for a honey farm that will convert one of the beehives into a block like this:

Code: Select all

x = 27, y = 11, rule = LifeHistory
20bo6b$19bobo5b$19bobo5b$20bo6b$2bo24b$obo12b2o7b2ob$b2o11bo2bo5bo2bo$
15b2o7b2ob$27b$b2E16b2E6b$b2E16b2E6b!

Edit: Here is a good partial, the still lifes just need to be rebuilt:

Code: Select all

x = 13, y = 13, rule = LifeHistory
6bo$4bobo$5b2o3$5b2E$5b2E3$2b2C5b2C$bCbC5bC2bC$bC9b2C$2C!

Edit: Removed unnecessary information (and previous edits).

[CARuler]

i would like someone to search for a 3c/3 (using cfind) in the following rule:

Code: Select all

R2,C2,S1,8-9,B,N@74662e|R2,C2,S1-12,B1,N@74662e

[hotcrystal0]

Reposting this from Unproven Conjectures:

This is probably the wrong place to put this, but has anyone ever tried to find a P3 self-forcing patch? And if no, can someone try to find one?

[shuich01]

Many of the spaceship search scripts searches diagonal spaceships by orthogonal width (or height), and there seems to be a lack of powerful and effective search scripts for diagonal spaceships by diagonal width (or height).

[confocaloid]

[...] double-check [...]

Crossposting another request for double-checking: [...]

Crossposting another request for double-checking: the number of fully-specified isotropic cell conditions (i.e. equivalence classes of neighbourhood configurations, up to rotations and reflections) on the faces of the icosahedron, assuming that there are two cellstates and the neighbourhood of a triangular face consists of the entire icosahedron.

[...] There are 2^20 different two-state patterns. With isotropic rules, it is enough to look at equivalence classes of patterns "up to rotations and reflections". I counted 9436 of those, which agrees with OEIS A252704.

Suppose the entire icosahedron is taken as the neighbourhood (i.e. the neighbourhood of any cell includes 19 other cells). Up to symmetries, I counted 176896 "essentially different neighbourhood configurations". (Question: Can anyone either confirm or correct this number?) Assuming that is correct, there are 2^176896 different isotropic rulesets (for every fully-specified cell condition, one can choose whether "the" cell will be alive or dead in the next generation). [...]

[H. H. P. M. P. Cole]

After much searching I can conclude that this rule officially now has 50 NRSS. But can we do more?

Code: Select all

# c/2o, c/3o, c/4o, 2c/4o, c/5o, c/6o, 2c/6o, c/7o, 2c/7o, c/8o, 2c/8o,
# c/9o, 2c/9o, c/10o, c/11o, 3c/11o, c/12o, 2c/12o, c/13o, 3c/13o, c/14o, 
# 4c/14o, c/15o, 3c/15o, 2c/16o, 3c/17o, 5c/17o, 4c/18o, 3c/19o, 5c/19o, 
# 6c/20o, 5c/21o, 4c/22o, 3c/23o, 5c/23o, 7c/23o, 3c/25o, 7c/25o, 4c/26o, 
# 8c/26o, 5c/27o, 7c/27o, 6c/28o, 5c/29o, 7c/29o, 9c/29o, 8c/30o, 10c/46o, 
# 9c/51o, 17c/91o, 18c/94o, 26c/132o, 31c/163o, 38c/180o, 54c/274o, 
# 201c/1049o, 232c/1152o, 664c/3250o, 935c/4605o, 947c/4691o
# two families of c/(1+2^(n+1)), n > 0
snip

With 50 NRSS out of the way I intend to do spaceship searches. Unfortunately my computer and my circumstances don't let me do anything beyond an overnight search, so I will display all my partials and qfind/rlifesrc search requests in this rule here.

- 3c/8o, width 10 odd-symmetric. Width-9 odd-symmetric partial:

Code: Select all

x = 17, y = 119, rule = B2ce3jny4j6ci7e8/S01e2ik3aejnr4air5iry6aci8
8bo$7bobo$6bo3bo$7bobo$8bo$bobo2bo3bo2bobo$bo13bo$o2bo9bo2bo$o7b
o7bo$o6bobo6bo$o3bo2bobo2bo3bo$o2bo2bo3bo2bo2bo$o3bo7bo3bo$o2bo9b
o2bo$o2bo3bobo3bo2bo$ob2obobobobob2obo$o6bobo6bo$o3b2o5b2o3bo$o7b
o7bo$o15bo$o4b2o3b2o4bo$o7bo7bo$o15bo$o7bo7bo$obobo2bobo2bobobo$
o2b2o3bo3b2o2bo$o3bo7bo3bo$o2b2o3bo3b2o2bo$o3bo3bo3bo3bo$o7bo7bo
$o2bobo5bobo2bo$obob2obobob2obobo$o2bobo5bobo2bo$obo3bo3bo3bobo$
o2bobo5bobo2bo$o4bobobobo4bo$o4bob3obo4bo$obo2b7o2bobo$o4bob3obo
4bo$o4bo5bo4bo$obo2bo5bo2bobo$o4bo5bo4bo$o4bo5bo4bo$obo2b3ob3o2b
obo$o2bo3bobo3bo2bo$ob2o3b3o3b2obo$o4b2o3b2o4bo$o2bobo5bobo2bo$o
5bo3bo5bo$obo2b7o2bobo$o2bo9bo2bo$o15bo$o2bo2b5o2bo2bo2$2bobo7bo
bo$2bobo2b3o2bobo$2b2o9b2o2$6b2ob2o$4bo3bo3bo$7b3o$7bobo$6bobobo
$3bo9bo$2bobo2bobo2bobo$2bo11bo$2bo2bo5bo2bo$2bobo7bobo$2bo3b5o3b
o$2bo11bo$2bo2bo5bo2bo$2bo4b3o4bo$2bo11bo$2bobo2b3o2bobo$2bo2b2o
3b2o2bo$2bo3bo3bo3bo$2bo2b7o2bo$b2o11b2o$bo3bobobobo3bo$bo4b5o4b
o$bo4bo3bo4bo$bobo3bobo3bobo$b3o2bo3bo2b3o$bo3b2o3b2o3bo$bo5bobo
5bo$bo2b2obobob2o2bo$bo13bo$bo6bo6bo$bo4bo3bo4bo$bo3bobobobo3bo$
bo5b3o5bo$bo3bo5bo3bo$bo2bobo3bobo2bo$bo3bo5bo3bo$bo6bo6bo$bo6bo
6bo$bo2bo7bo2bo$bo3bo5bo3bo$bo4bo3bo4bo$bo4bobobo4bo$bo3b2o3b2o3b
o$bo3bobobobo3bo$bo5b3o5bo$bo5bobo5bo$bo4bobobo4bo$2o3bo5bo3b2o$
2o2bobo3bobo2b2o$o4bobobobo4bo$o15bo$obob3o3b3obobo$o2bo3b3o3bo2b
o$o2b2o2b3o2b2o2bo$o2bob7obo2bo$o6bobo6bo$obo4bobo4bobo$o15bo$o5b
obobo5bo$obo3bobobo3bobo$o2b3obobob3o2bo!

- c/16o, width-5 odd-symmetric. Width-4 odd-symmetric partial:

Code: Select all

x = 7, y = 47, rule = B2ce3jny4j6ci7e8/S01e2ik3aejnr4air5iry6aci8
3bo3$o5bo$o5bo$o2bo2bo$obobobo$ob3obo$o2bo2bo2$3bo$2bobo$2b3o$2b
obo$2b3o$2bobo$2b3o$2b3o$2b3o$2bobo$bobobo3$3bo$2b3o$2bobo$2bobo
$2b3o$2bobo$2b3o$2b3o$2b3o$2bobo$2b3o$2bobo$bobobo2$2b3o$2bobo$3b
o$3bo$3bo$obobobo$3bo$2bobo$bo3bo$bo3bo!

- 2c/5o, width-13 odd-symmetric (rlifesrc). Width-12 odd-symmetric partial:

Code: Select all

x = 19, y = 20, rule = B2ce3jny4j6ci7e8/S01e2ik3aejnr4air5iry6aci8
7bobobo$6bo5bo$7bobobo$bobobo7bobobo$b2o4b5o4b2o$bo7bo7bo$bo2bobob3ob
obo2bo$bobo2bo5bo2bobo$bo2b3o5b3o2bo$bo5b2ob2o5bo$bo2b2o2bobo2b2o2bo$
bobobob5obobobo$bo2b3ob3ob3o2bo$bo5bo3bo5bo$2ob2obo5bob2ob2o$obobo2b2o
b2o2bobobo$o3bo3bobo3bo3bo$4bob2o3b2obo$o17bo$8bobo!

- c/19o, c/21o, c/23o, c/25o, c/27o, c/29o, width-2 odd-symmetric

I will shift my focus and I may intend to do an oscillator collection for this rule, unfortunately it is also slow to apgsearch due to many 'Failed to detect periodic behaviour' problems. I will try submitting a haul today and see what I can do.

I propose calling this rule Mealworld.

[DroneBetter]

some things in Day & Night that I think would be promising

no 2c/7d is known in Day & Night, and the highest symmetric diagonal width searched up to is 23 half-diagonals (took 17498s in rlifesrc to obtain this partial)

Code: Select all

..oo.oooo...
.ooo.oooooo..
oooo.o.ooo..o.
ooo.o.ooooo.o..
...o.ooo.oooo...
ooo.o.o.ooo.o....
oo.ooo.oooo.......
ooooo.oo...o...o...
oooo.oo..oo.oo.oo...
.oooooo.ooo..oooo....
.o.oooo.oo.oo.........
....o..o..o.oo.ooo.....
 .oooo..o.oooooo.o......
  ......oo.oooo...o......
   ......o..oooo..........
    ...ooo.oo.o..ooo.oo....
     ...oo.o....o....oo.....
      .....oo..o.ooo..ooo....
       ......o.o.o.o.oo.o.....
        .......o.ooo.oo.ooo....
         .............o..oo.....
          .....oo.oo..o....ooooo.
           ....ooooooo..o..ooo.o..
            .....o......ooo.o.ooo..
             ....ooo..oo...o.oo.oo..
              .....oo..o..o.oo..ooo..
               ....oo..o.o..oo........
                .....oo.o..oo.o.oo.o...
                 ....ooo.ooooo.oo.oo....
                  ...oo.ooo.oooo..oo.....
                   ..o.oo..o.oooo.ooooo...
                    .ooo....oooo..o.oooo...
                     ..ooo.oo.o..o..ooo.o...
                      ..oo.o....o.oooo..o..o.
                       ..o..oooo.o.o.o....ooo.
                        ...oooo..ooo....o.ooo..
                         .....oooo..o.o..oo..oo.
                          ....ooooo..oo..o....o??
                           ...ooo...ooo..oo.oo.??
                            ...o.......oo..o..o??
                             ...oo.o...o.ooo..o??
                              ......ooo.oo.o..o??
                               ...ooo.o.o....????
                                .ooo...ooo.o.????
                                 .oo..o.....?????
                                  ..o.o...???????
                                   .oo.ooo???????
                                    .????????????
                                     ????????????

I believe LLSSS is an appropriate tool for w25s

Code: Select all

./rlife llsss --filters bcaf --rule 'B3678/S34678' 2c7d-f2b --left-edge odd '@bg:9'

this post by 2718281828 found the shortest w26e 2c/5, xq5_wkeujhfeu4osso4uefhjuekz443pl8y03d55d3y08lp344z04tkcvvtmy4mtvvckt4zy01029sy4s9201 (reproduced in in 5416s and 37.43GB RAM by LLSSS), which is 164 cells. Meanwhile, the smallest asymmetric is the w15a xq5_0oo46u07vi8ccz012kvebrra7qzwgosci5ad23zx35i41see8z8corrtbn631z03b8argzx466bk866cz0oksojfbg1hz04rt5110499b2zxc7f found in this post by AforAmpere at 202 cells. I would like to see what the shortest w16a looks like; maybe this minpop record is surpassable!

Code: Select all

./rlife llsss --filters bcaf --rule 'B3678/S34678' 2c5-f2b --left-edge bg '@bg:20'

it got pretty far for me before crashing at 59.89GiB RAM+swap used (my laptop has only 16GiB RAM)

Code: Select all

Random partial:
|                      |                      |          SS          | .................... | .................... |
| .................... | .................... | .................... | .................... | .................... |
| .................... | .................... | .................... | ........**.......... | .......****......... |
| ........**.......... | ........**.......... | .......****......... | .......***.**....... | ......**.*.**....... |
| ......******........ | .......***.**....... | .......**..***...... | ......**...****..... | .....***....****.... |
| .....*..**.**.*..... | ....**..**.***...... | ....**...*.*.**..... | ....**.....*****.... | ....**.**...****.... |
| ....***......*.*.... | ....***.*..*..**.... | ....***.*..*..**.... | ....**.*.*.****.*... | ...***.....***...... |
| ...*..**....****.... | .......**..*..**.... | ........*..******... | ....*..**..*.*..*... | ....*..*...***..**.. |
| ...*.*.**..***.**... | ......*.***.*..*.... | .....*****.**..*.... | .....**.**.*...**... | ....*****..*.**..... |
| .....*.**.***....... | .....********.*..... | .....**.*..*........ | .....*.****.**...... | .......****.*....... |
| .....**....***...... | ......*....***...... | .......*******...... | ........****........ | ......*.*****....... |
| .......***.**....... | .....*.******....... | .......******....... | .......*.*****...... | ......**..**.*...... |
| ......**.*****...... | .......*.****.*..... | ..........******.... | ......**..***.*..... | .....***..*****..... |
| ..........*****..... | .....*....******.... | ....**.*..****.*.... | ...**.*.*.*****..... | .....****..**.**.... |
| .....***.****.**.... | ....****.*****.*.... | ...**..*.********... | ...*...**.***..*.... | ....*....*.**....... |
| ....**.***.****..... | ...**.***.***.**.... | ...*.*.*****..*..... | ..****.****...*..... | ..**.*****..*....... |
| ...**.****.**....... | ...**.*.*.**........ | ...**.**.**..*...... | ...*.*****.*........ | ....******.......... |
| ...*....**.*........ | .......***..*....... | ....******.......... | ...*******.......... | ....******.*........ |
| .....****........... | .....*....*......... | ..........*......... | .......*..**........ | ......*...**........ |
| ....****.*.......... | ......**..**........ | ......***.**........ | .....***..**........ | ......*.*..*........ |
| ......**..***....... | ....*.**.**......... | .....**..**......... | .....*...**......... | .....*...*.......... |
| .....*.*.*.......... | ....****..*.*....... | ...***.*..*......... | ....**....**........ | ....***...***.*..... |
| ....**.*....*....... | ....**..*.**........ | ....*..*.**......... | ....*.*..***.***.... | .........**..*.**... |
| .....*....**.*.*.... | .....*.....**..**... | ....*....*..*****... | ........*.**.****... | ............****.*.. |
| .....*....*...***... | ..........*.*.***... | ............*..*.*.. | ...........*******.. | .........*....***... |
| .........**..****... | .............***.*.. | .........*..*.****.. | ..........**..*..... | ...........*.****... |
| .............***.*.. | ........*.*.*.****.. | .........*.*..**.... | .............*****.. | ......***..*.**.*... |
| .......**.*..*****.. | .......*.*.*..**.... | ......**.*.....**... | .....******...*.*... | ......*******.****.. |
| ......*.*..**.**.... | ......***.***.****.. | .....***********.... | .....*.*.*.**.*..... | ......***.***....... |
| .....*.**..*..***... | ....**.*...*...**... | ...***...*.*...**... | ...****..***.*..*... | ..******.*.*.*...... |
| ...**.******..***... | ...**..**..*...**... | ...****....*...**... | ..**..*..*..*.**.*.. | ...*.**.**..*.**.... |
| ...**.****.*.**..... | ...*********.*.*.... | ..*...****.*...*.*.. | .....**.*...*..**... | .....****....*.**... |
| ..******.**.*.***... | ..*.*.*.***.*.*.**.. | ....****.*...*.**... | ......****.....*.... | ...**..**..*....**.. |
| ...*.*.*....*..***.. | ....*.*..*.......*.. | .....***.*..**..**.. | ..***.**...*******.. |                      |
| ...***...*.*..*..*.. |                      |                      |                      |                      |

finally, I think 3c/7 antispace wickstretchers seem promising, since the stable staggered "castle wall" boundary between two antispace regions is spatial-period-3.

a brief history of discoveries:

• 2015-11-23: velcrorex, 584-cell w20e
• 2023-02-10: May13, LSSS & qfind. 676-cell w25o
• 2024-09-0(3,5): Darcy Li & me, qfind. 1013-cell w23o, first antispace wickstretcher (by manually cleaning out a spaceship partial's backend)
• 2025-04-30: me, qfind. 316-cell w22e

an antispace-eater to cancel the same width-17 strip, and two parasites that grow and shrink walls they move along (conserving or flipping the orientation of the staggers), would enable the construction of whiteships (in the manner of greyships). Has LLSSS been used to find bespoke components at 3c/7 before?

finally, more a request for advice (though I would be grateful for any completion): is any search algorithm better than *lifesrc for finding diagonal chequercrawlers in D&N (whose chequerboard dual is explosive but permits 'tunnel borers,' with backends much harder than frontends)? both *lifesrc and LLSSS get congested by their inability to deduplicate the search tree, but LLSSS gets congested in parallel and crashes.
here is a c/4d borer:

Code: Select all

x = 43, y = 43, rule = B1e2cn3acjkr4cny5einqy6ei7c/S01e2-ei3acjkr4-ejr5einqy6-cn7c8
6b2o$5b5o$4b2o3bo$4bo2bobo$2b2ob2obo$b2obo2bo2bo$2o2bobobobo$2obobob4o5b3o$bo2bob2obob4o3bo$b3o3b2obob3ob3o$5b3obob2obo2bo$8bob4obo3bo$8b5obobobobo$8b2obobobobobobo$8b3obobobob2ob3o$11bobobob2obo2b3o$7bobo2bobobob2obo2b3o$7bob2o2bobo2bobo5bob2o$7b3o2bob4o2bob4obo2bo$11bob2obo2bobo2bobo2bobo$12bo2bob2ob2o3b4obobo$13b2obo2b2obob3o2bobobo$14bo3bo2bob7o2bobo$14b2o2bo3bobo3bob2obobo$15b2ob2ob3obobobo4bobo$15b2obob3obobobob4obobo$16b2ob4o2bobobobo2bobobo$18bobobobobob2o4b2obobo$17bo2bob2obob5ob2obobo2b2o$17bobob2obob4ob2o2bobo3b2o$18bobo2bobo2bob2o2bobo$19bobobob2ob6obo$20bobo2bo3bob2obo$21bobobo2bo2bobo$22bobob3obobo$23bobobobobo$24bobobobo$25bobobo$26bobo$27bo2$28b2o$28b2o!

edit: after 68401s in rlifesrc, a back-to-front search revealed there can be no completion at w25s; I suppose that is the best way to circumvent congestion