Thread for your unsure discoveries

[mniemiec]

Glider + xs20_0giligz122qi43 = Glider + LWSS: ...

This is a common reaction; whenever a glider hits a pre-block on the edge of an object (e.g. half an aircraft carrier), it turns into a LWSS.

[Pyry Virtanen]

Here is an 8x9 diehard that lasts 889 generations.

Code: Select all

x = 9, y = 8, rule = B3/S23
bob4o$bo2bobobo$8bo$o$o$o3bo$4bo$4b3o!

This version has 18 cells, but there is a 9x9 variant with 17 cells.
This is the first pattern I have posted, and I might not have done it correctly,
my apologies. I found it from a Catagolue soup so it might be a rediscovery.

Edit: I tried to make the pattern playable, I hope it works now. Also I'm
curious to know if this pattern breaks any records?

Edit 2: The previous question was trying to mean: Is this the longest lasting
known diehard that fits into an 8x9 bounding box (or even 9x9, for example)?
Or does anyone even care or keep track of things like these?

Edit 3: I found a 7x9 version, at the cost of having a higher population (namely 20).
Sorry for the number of edits.

Code: Select all

x = 9, y = 7, rule = B3/S23
bob4o$bo2bobobo$8bo$o$o2bobo$o2bobo$4b3o!

[squareroot12621]

You can use [code][/code] tags to make it playable.

Code: Select all

x = 9, y = 8, rule = B3/S23
bob4o$bo2bobobo$8bo$o$o$o3bo$4bo$4b3o!

[Stepan Babintsev]

Also I'm curious to know if this pattern breaks any records?

viewtopic.php?f=2&t=5616 There are some really long dieharts, some of them are above 10^1000 ticks.
Anyways, I don't know what is the longest diehart for 8*9 bounding box.

[Pyry Virtanen]

Here are two more diehards I thought might be worth sharing.
The first one has just 15 cells and lasts 1068 ticks. I encountered it
in two different soups.

Code: Select all

x = 19, y = 7, rule = B3/S23
13bo3bo$13b3o2bo$bo15b2o$obo$bo$9b2o$9bo!

The second one is the longest lasting 6x6 diehard I have seen so far.
It lasts 254 ticks.

Code: Select all

x = 6, y = 6, rule = B3/S23
b2o$2o$o$bo2b2o$b4o$2b2o!

[dvgrn]

The second one is the longest lasting 6x6 diehard I have seen so far.
It lasts 254 ticks.

Code: Select all

x = 6, y = 6, rule = B3/S23
b2o$2o$o$bo2b2o$b4o$2b2o!

That looks like it ought to have a 6x6 predecessor, but it doesn't -- I tried the same bounding box in JLS, and also 6x6 boxes offset by one cell orthogonally or diagonally. The closest match seems to be a smaller-population predecessor which is the only solution in a 6x7 bounding box with an extra column on the left:

Code: Select all

x = 7, y = 6, rule = B3/S23
obobo$b2o$3bo2bo$bo4bo$2bo2bo$3b2o!

[Pyry Virtanen]

The second one is the longest lasting 6x6 diehard I have seen so far.
It lasts 254 ticks.

Code: Select all

x = 6, y = 6, rule = B3/S23
b2o$2o$o$bo2b2o$b4o$2b2o!

That looks like it ought to have a 6x6 predecessor, but it doesn't -- I tried the same bounding box in JLS, and also 6x6 boxes offset by one cell orthogonally or diagonally. The closest match seems to be a smaller-population predecessor which is the only solution in a 6x7 bounding box with an extra column on the left:

Code: Select all

x = 7, y = 6, rule = B3/S23
obobo$b2o$3bo2bo$bo4bo$2bo2bo$3b2o!

Yes, I also tried to find a 6x6 predecessor to it (manually), but failed.
Nice to hear that you can confirm that it doesn't have one.

I think it would be doable to exhaustively go through every single
6x6 pattern in order to find the longest lasting diehard of that bounding box
(maybe someone has aiready done something like this).

[dvgrn]

I think it would be doable to exhaustively go through every single
6x6 pattern in order to find the longest lasting diehard of that bounding box
(maybe someone has aiready done something like this).

I don't recall that there's any closer match than F_rank's work on 6x6 toruses in 2018. 6x6 patterns in an unbounded universe don't reduce the number of cases nearly as much as 6x6 patterns on a torus, but we can still knock off a factor of 8 ... ish ... from the 2^36 = 68.7 billion case count.

Is there an easy way to enumerate just the unique not-seen-before patterns inside 6x6, getting rid of rotations and reflections and translations (e.g., 5x5 patterns that show up four times per orientation in a 6x6 box)?

Seems like doing anything like octohashing/octodigesting each new configuration and checking against a hashtable ... would take a lot of gigabytes and ultimately end up being much slower than just running all 2^36 configurations as fast as possible, and recording the ones that die out.

I'd say you should feel free to start a thread to pursue this further, if you're interested. There are bound to be some clever shortcuts that I'm not thinking of offhand.

[Pyry Virtanen]

6x6 patterns in an unbounded universe don't reduce the number of cases nearly as much as 6x6 patterns on a torus, but we can still knock off a factor of 8 ... ish ... from the 2^36 = 68.7 billion case count.

When I think about it more carefully, it might be too early to do 6x6 before 3x3, 4x4 and 5x5 bounding boxes, because running billions of patterns is too much work for a single computer and would take way too long. It would need to be a collaborative effort.

Here are some thoughts about what the longest lasting diehards in those smaller bounding boxes might be.

I think the 3x3 solution is the following hexomino, lasting nine ticks.

Code: Select all

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

The 4x4 solution might be the Z-hexomino, which lasts 45 ticks, but this just guessing. I wouldn't be surprised if someone found a 4x4 predecessor for it (I tried by hand) or even a 4x4 predecessor for the standard 130-tick diehard. Speaking of which, here is a 4x5 predecessor for the standard diehard. It lasts 133 ticks.

Code: Select all

x = 5, y = 4, rule = B3/S23
5o$ob2o$b2o$4o!

This makes me think there are many 5x5 patterns that evolve into the standard diehard. One of those might be the 5x5 solution, though something better probably exists.

The 3x3 search is doable by hand, and 4x4 should be doable by a laptop with a well-written program. I haven't yet bothered writing such a program, partly because gliders make it more difficult for the program to determine when a pattern has stabilized. I don't know how long the 5x5 case would take on a single PC, probably quite long.

[hotdogPi]

Keep in mind that there's a switch engine known in 5×5, if you're checking for stabilization.

[dvgrn]

I don't know how long the 5x5 case would take on a single PC, probably quite long.

Nah, 5x5 is only 2^25 = 33 million cases, even without any cleverness using symmetry or translations to reduce the number of patterns to run. A well-written program will run though that many cases in a fairly reasonable amount of time.

Even a not-so-well-written program can feed patterns into apgsearch for censusing. This was done a while back for LeapLife patterns, so that code could certainly be adapted for plain vanilla Life. EDIT: Aha, right, that's already been done also.

Looking through the results of a search for "5x5" on the forums, it seems like several people must already have run through all the 5x5s at some point. Not sure if any of them were looking for diehards, though... apgsearch 5.x collects diehards automatically, but I don't think it will do that for 5x5 stdin soups (they'll probably be below the minimum threshold, anyway).

[Naszvadi]

c/5d clean(er) puffer, glide-symmetric, using 5 engines. Leaves TL and 2 beehives per halfperiod. Probably known, and also 1000th post.

Code: Select all

x = 87, y = 87, rule = B3/S23
73bo5bo$72bo7bo$75b4obo$71bo2bo3b2o$71bo2bo2b3o$71bo4bo$72bob3o$72b2ob
2o$68b3o4b2o$68b3o$66b2o$66b2o$66b2o$61b3o$59bo4b2o$58bo6bo$61b2obo$
60bo3b3o$60bo2b4o$60bobo$60b3o$58bo2b2o$59b2o2$81b4o$79b2o4b2o$79bo5b
2o$79bobob2o$79bo$79bo3bo$78bo4bo$75bo3b3o$75bo4b2o$74b2o$73bo$71b3o3$
70bo$65b5obo$65bo5b2o$64bo2bo3b2o$64bo$64bo2bob2o$64bo2bo$65b2o$65b2o
12$15bo5bo53b4o$14bo7bo50b2o4b2o$17b4obo50bo5b2o$13bo2bo3b2o51bobob2o$
13bo2bo2b3o51bo$13bo4bo54bo3bo$14bob3o22b4o27bo4bo$14b2ob2o20b2o4b2o
22bo3b3o$10b3o4b2o20bo5b2o22bo4b2o$10b3o26bobob2o10bo12b2o$8b2o29bo13b
obo11bo$8b2o29bo3bo10b2o9b3o$8b2o28bo4bo$3b3o29bo3b3o$bo4b2o27bo4b2o
22bo$o6bo26b2o23b5obo$3b2obo26bo25bo5b2o$2bo3b3o22b3o24bo2bo3b2o$2bo2b
4o49bo$2bobo53bo2bob2o$2b3o25bo27bo2bo$o2b2o20b5obo27b2o$b2o22bo5b2o
26b2o$24bo2bo3b2o$24bo$24bo2bob2o$24bo2bo$25b2o$25b2o!

[GUYTU6J]

Nothing, just two edge-shooters for the hexaplet R-pentomino backward predecessor seen at generation 60 of Herschel

Code: Select all

x = 21, y = 44, rule = B3/S23
5bo$6b2o$5b2o2$10bo$8b2o$bo7b2o$2b2o$b2o10$2bo2$o$o$o$bo16bobo$18b2o$
19bo3$5bo$3bobo$4b2o10bo$14b2o$15b2o6$2bo2$o$o$o$bo!

(8,1)c/57 puffer:

Code: Select all

x = 10, y = 26, rule = B3/S23
3bo$2b3o$2b3o2$b4o$b5o$2bob2o6$3b2o$3b2o5$3o$obo$3o$6b2o$5bob2o$5bo3bo
$6b3o$7bo!
#C [[ PASTEDELTA 8 1 PASTET EVERY 57 PASTE obo! 6 27 PASTE o! 3 -1 ]]

[Entity Valkyrie 2]

Um... LWSS...

Code: Select all

x = 4, y = 13, rule = B3/S23
3o$bobo$3bo$ob2o$2o7$2o$2o!

[C28]

U to P

Code: Select all

x = 20, y = 35, rule = B3/S23
8b2o8b2o$9bo8bo$9bob2o3bobo$10bo2bo2b2o$12b2o7$10b3o$10b3o$9bobo$9b2o
13$3b2o$3bo3b2o$2obo2bobo$obob3obobob2o$3bo3b2ob2obo$4b2o3bo$6b2obo$6b
obo!

the output clearence isn't too good

[HotWheels9232]

Code: Select all

x = 15, y = 6, rule = B3/S23
4bo5bo$ob2o7b2obo2$bo2bo5bo2bo$2bobo5bobo$3b2o5b2o!

MWSS edgeshooter, shown to make MWSS-on-MWSS 1

[wirehead]

kazyan g-to-block factory can output glider with a pentadecathon

Code: Select all

x = 56, y = 69, rule = LifeHistory
4$10.A$10.3A$13.A$12.2A5$15.A$14.3A$14.3A2$12.2A3.2A$12.2A3.2A3$14.2A
$14.A.A$13.A2.2A$15.2A$15.2A$16.A2$10.A5.A$10.A5.A$11.A3.A6.A$12.3A5.
A.A$21.2A5$28.BA$10.2A17.BA16.2A$11.A16.3AB5.2B8.A$8.3A18.4B3.5B3.BA.
A$8.A21.4B2.7B.B2A$31.8BA5B$32.6BABA5B$33.5BA2BA3B$34.5B2A4B$33.3B.6B
2D$29.2A.2BA6.2B2D$29.A.2BA.A3.5B$30.A2.BA.A2.2A4.A$31.A4.A3.A3.BAB$
29.A.5A.3A4.3B$28.A.A6.A5.2BA2B$28.A2.A2.3A6.BABAB$29.2A3.A7.7B$42.2B
3A2B$41.9B$41.9B$42.2B3A2B$42.7B$43.BABAB$43.2BA2B$44.3B$44.BAB$45.A!

This could conceivably be used as a memory cell: just need to find a way to insert a V spark with gliders instead of a continuously-running pentadecathon:

Code: Select all

x = 27, y = 31, rule = LifeHistory
4$20.2A$20.A$18.A.A$18.2A$12.A$11.A.A$11.A2.A$12.2A$16.2C$2.2A3.A8.2C
$2.A3.A.A$3.A3.A.A2.2A4.C$4.A4.A3.A3.C.C$2.A.5A.3A$.A.A6.A$.A2.A2.3A$
2.2A3.A!

[squareroot12621]

One-time use:

Code: Select all

x = 24, y = 23, rule = LifeHistory
19.2A$19.A$17.A.A$17.2A$11.A$10.A.A$10.A2.A$11.2A$15.2C$.2A3.A8.2C$.A
3.A.A$2.A3.A.A2.2A$3.A4.A3.A3.E$.A.5A.3A3.E.E$A.A6.A6.E.E$A2.A2.3A8.2E
$.2A3.A14.2E$21.E.E$21.E$14.2E$15.E$12.3E$12.E!

[wirehead]

One-time use:

Code: Select all

x = 24, y = 23, rule = LifeHistory
19.2A$19.A$17.A.A$17.2A$11.A$10.A.A$10.A2.A$11.2A$15.2C$.2A3.A8.2C$.A
3.A.A$2.A3.A.A2.2A$3.A4.A3.A3.E$.A.5A.3A3.E.E$A.A6.A6.E.E$A2.A2.3A8.2E
$.2A3.A14.2E$21.E.E$21.E$14.2E$15.E$12.3E$12.E!

Now we need to find which 2G collision produces an edgy V spark and insert it in there... I don't know any 2G collisions offhand, does anyone else know?

[dvgrn]

One-time use:

Code: Select all

x = 24, y = 23, rule = LifeHistory
19.2A$19.A$17.A.A$17.2A$11.A$10.A.A$10.A2.A$11.2A$15.2C$.2A3.A8.2C$.A
3.A.A$2.A3.A.A2.2A$3.A4.A3.A3.E$.A.5A.3A3.E.E$A.A6.A6.E.E$A2.A2.3A8.2E
$.2A3.A14.2E$21.E.E$21.E$14.2E$15.E$12.3E$12.E!

Now we need to find which 2G collision produces an edgy V spark and insert it in there... I don't know any 2G collisions offhand, does anyone else know?

Here we're getting to the "unsure" part of these unsure discoveries.

There are quite a lot of other memory cell mechanisms that don't require smashing two or three gliders together to read the state of the bit -- e.g., a beehive stopper, or a syringe attached to a demultiplexer, or a honeybit, or a plain boat-bit whose state is read by a passing MWSS, among other methods.

The good thing about this G-to-block factory of Kazyan's is that it's small, and has a different geometry from the old glider to block. By the time you patch together something that synchronizes two gliders to make a spark, it's suddenly very large and awkward compared to other ways of storing bits.

That said, the stamp collection of all the ways that two gliders can collide can be found in Golly's Patterns/Life/Syntheses folder -- two-glider-collisions.rle. I think you may find that it will take three gliders to push an activating three-bit spark into that location, but I keep being wrong and missing good options when I look for things like that.

[confocaloid]

What are fastest (and/or) smallest known stable x5 pulse dividers?

Code: Select all

x = 189, y = 140, rule = LifeHistory
42.2A11.A6.2A16.2E$42.2A10.A.A4.A2.A15.E$54.A.A3.A.3A2.2A9.E.E$53.2A.
2A.A.A6.A9.2E$57.A.A3.2A3.A.A$53.2A.A2.4A.A4.2A$53.2A.A.A3.A10.3D$57.
A.A3.A11.D$58.A.A3.A9.D$59.A3.2A14.A$78.A.A$79.A2$50.2A$50.2A$35.2A$
34.A2.A$33.A.2A42.2A$33.A45.2A$32.2A$47.2A$47.A$48.3A$24.2A24.A5.2A$
25.A29.A.A$23.A31.A$23.5A14.2A10.2A$28.A13.A$25.3A12.A.A$24.A15.2A20.
A15.2A$24.4A33.A.A14.A.A60.2C$22.2A3.A3.2A28.A.A16.A59.C2.C20.2A$21.A
2.3A4.2A29.A17.2A58.C2.C20.A$21.2A.A41.2A73.2C22.3A$24.A41.A.A76.2C
20.A$24.2A42.A75.C.C$68.2A74.2C$70.A99.A$32.2A34.3A97.3A$33.A33.A99.A
$30.3A34.2A98.2A$30.A21.2A98.2A$53.A99.A$53.A.2A96.A.2A$54.A2.A23.D
72.A2.A23.D$55.2A24.D.D3.2E66.2A24.D.D3.2E$70.2A9.3D3.2E81.2A9.3D3.2E
$70.2A11.D86.2A11.D7$50.2A21.2A.A73.2A21.2A.A$51.A21.2A.3A72.A21.2A.
3A$51.A.A25.A71.A.A25.A$52.2A9.C9.2A.3A73.2A9.C9.2A.3A$62.C.C9.A.A85.
C.C9.A.A$62.C.C3.2A4.A.A85.C.C3.2A4.A.A$63.C4.2A5.A87.C4.2A5.A6$60.2A
98.2A$2.2A21.A22.3C9.A87.3D9.A$3.A21.2A23.C10.3A86.D10.3A$3.A.A7.2A
11.2A21.C13.A85.D13.A$4.2A6.3A3.A7.3A7.2A$9.A.2A4.4A5.2A8.2A$9.A2.A4.
A4.A2.2A$9.A.2A5.A3.A2.A$12.3A3.2A.A$3.2A8.2A32.2A$3.2A41.A.A$45.3A$
26.A.A16.2A$3.A23.2A19.2A$2.3A22.A19.3A$.A3.A$3.A$A5.A40.2A$A5.A22.2A
2.A.A11.2A$.A3.A23.2A2.A2.A$2.3A28.A.A3$22.2A$23.2A$22.A2$9.2A30.A.A$
7.A2.A31.2A$6.A7.3A3.A21.A$6.A6.A3.5A23.2A$6.A7.A3.2A.2A9.2A11.A.A70.
3A$7.A2.A3.A3.2A.3A8.2A13.A72.A$9.2A5.4A.2A24.2A70.A$18.4A$20.A6$108.
3A$110.A$109.A8$98.3A$100.A$99.A8$88.3A$90.A$89.A8$78.3A$80.A$79.A!

[Jormungant]

p32 reflector

Code: Select all

x = 66, y = 72, rule = LifeHistory
3$2.B23.2A$25.3B$5.2A.A.A.2A11.A3BA$5.A.2A.2A.A10.A4BA$9.A13.A.ABAB$
6.2A3.2A8.BABA.A9.A2.A3.2A$6.A.3A.A7.A4BA8.8A2.A$3.2A.A.B3.A.2AB3.A3B
A8.A8.2A$3.2A.AB2ABA2B3A5.3B7.A2BAB2ABAB$5.AB2.2AB4.BA4.2A9.3A.2A2B.
2A$3.2A.AB2A.5A3B4.2B5.4AB.B.A.A.A$3.2A.A2.A2B.A.B.2AB2.3AB3.B2A3B.BA
.2A.A$6.A.A2.BA.2B2AB.2BABAB4.B.A2B.A.A.A.2A$3.2A.A.A.A.3A.AB3.B3AB3.
2B2A.A2.A2.A2.A$3.A.A3.A.A2.A.A.11BAB.5A3.2A$11.A.A2.2A.9B.2BA$10.2A.
2A5.9BAB.5A3.2A$4.2B16.3B4.2B2A.A2.A2.A2.A$4.3A14.4B5.B.A2B.A.A.A.2A$
2.BA3B6.2A5.B.4B3.B2A3B.BA.2A.A$2.BA3BA4.A2BA3.3B.3BA3.4AB.B.A.A.A$3.
A2BA.A4.2B3.4B2.ABAB5.3A.2A2B.2A$5.A.A2BA3.2B2.5B2.2A2B3.A2BAB2ABAB$
6.A3BA2BA2BA6B3.4B3.A8.2A$7.3BAB.5BA5B3.4B3.8A2.A$7.3A3.3B4A4B4.4B4.A
2.A3.2A$8.2B2.A7BA3B5.4B$13.A3B3A5BA4.4B$14.B2ABA5B.3A3.3BA$16.7B5.A
3.ABAB$19.5B3.2A4.2A2B$22.2AB.A2.2A3.4B$16.ABA3.A3B.A.A.A3.4B$15.3BAB
.2B.B3A2.A.A3.4B$14.2A3.BA2B5.A.A.A4.4B$13.A2.B.A2.2B3A2BA2.A6.4B12.
2B$12.A.8A.A.A2.A10.3BA4B6.3B$12.A8.A.A2.2A12.ABA3B7.3A2B$10.2A.11A
17.2A2BD6.B3A2B$9.A2.A2.B.A2.A.B18.3BA6.B.3AB$9.2A2.AB3.AB21.2BA2BA2.
B3A.B$14.ABABA22.BD2BD4B3AB$15.BAB23.A2BDBA.2B3A$41.D2BCAB3.3B$41.2A
6B.2B$42.5B$41.7B$35.2A4.2B3A2B4.2A$36.A4.BA3BAB4.A$36.A.2A.BA3BAB.2A
.A$37.A2B.A5BA.2BA$39.5BA5B$38.A4BABA4BA$36.2B.A4BA4BA.2B$35.BAB2.BA
5BAB2.BAB$35.5BABA3BABA5B$34.3ABAB.BA3BAB.BAB3A$33.A.2A2B2.2B3A2B2.2B
2A.A$31.2B2A.A6.BAB6.A.2A2B$30.BAB3A7.A.A7.3ABAB$30.5B6.3A.3A6.5B$32.
BAB5.A7.A5.BAB$32.2B6.2A5.2A6.2B!

New batch of sparker-supported things, mostly pi hasslers:

p32 pi hassler

Code: Select all

x = 35, y = 33, rule = B3/S23
25bo5bo$24b3o3b3o$23bobobobobobo$22b2obobobobob2o$22bob4ob4obo$11b2o9b
5o3b5o$11b2o2$26b2ob2o$11b3o11bobobobo$11b3o12bo3bo$10bo3bo$10b2ob2o6$
20b2ob2o$20bo3bo$4bo3bo12b3o$3bobobobo11b3o$4b2ob2o2$22b2o$5o3b5o9b2o$
ob4ob4obo$2obobobobob2o$bobobobobobo$2b3o3b3o$3bo5bo!

And another one!

Code: Select all

x = 90, y = 58, rule = LifeHistory
2$61.2B23.B$61.3B$59.2B2AB11.2A.A.A.2A$59.2B2ABA10.A.2A.2A.A$60.4B.A
13.A$44.2A3.A2.A9.A.4B8.2A3.2A$44.A2.8A8.AB2A2B7.A.3A.A$45.2A8.A8.B2A
2B3.2BA.A3.B.A.2A$47.A2BABABA2B7.3B5.2B3A3BABA.2A$45.2A.4A.2AB9.2B4.B
A4.3A2.BA$46.A.B.B.A.A4B5.2B4.AB6A.2ABA.2A$46.A.AB.2A.2A2B2A3.4B2.A2B
.B.B.2BA2.A.2A$45.2A.A.A.A.3A.A4.6B.A3BA.AB2.A.A$45.A2.A2.A2.A.3AB3.
2BA2B3.BA.ABA.A.A.A.2A$47.2A3.3A2B.A6BA5B.A.A2.A.A3.A.A$57.3A.3BABA3B
.2A2.A.A$47.2A3.3A2B.A6BA3B5.2A.2A$45.A2.A2.A2.A.3AB4.BAB16.2A$45.2A.
A.A.A.3A.A5.4B14.3B$46.A.AB.2A.2A2B2A3.4B.B5.2A6.A3BA$46.A.B.B.A.A4B
3.4B.3B3.B2AB4.A4BA$45.2A.4A.2AB5.4B2.4B3.2B4.A.ABAB$31.B5.B9.A2BABAB
A2B3.A3B2.5B2.2B3.BABA.A$30.3B3.3B6.2A8.A3.A3B3.2BA8BA4BA$28.3B2A3.2A
3B3.A2.8A3.B3A3.2B3A6B.A3BA$27.3B2A.A.A.2A3B2.2A3.A2.A4.4B4.B2AB2A5B
3.3B$27.2B3ABA.AB3A2B14.4B5.3AB3A5B2.2A$27.BA3B2A.2A3BAB13.4B4.A2B2AB
2A5B$17.2A8.BA5B.5BAB12.4B3.3A.2B3A5B$16.B2AB7.2BA4B.4BA2B11.4B3.A5.
2BA4B$17.3B7.7B.7B10.A3B4.2A3.5B$10.2B2.2B2.B2.2B4.5B2A.2A5B9.A3B3.2A
2.A.3A$5.ABA23BA.A.A.A4B8.B3A3.A.A.A.4A3.ABA$5.ABA9B3A12BA3.A4B8.4B3.
A.A2.2A2B.2B.3BAB$4.A11BA3BA7B2.3B3.3B9.4B4.A.A.A5.AB2A3.BA$5.11B2AB
2A7B3.B5.B9.4B6.A2.3A2BABA2.B.A2.A$6.21B15.8B10.A2.A.A.8A.A$9.B.15B
17.6B12.2A2.A.B8.A$20.3B.3B16.DA3B17.2A2B7A.2A$21.15B.B5.A4B18.B.A2.B
.A2.A2.A$20.21B2.3A23.AB3.AB2.2A$9.B5.B3.7B2AB2A11B28.ABABA$8.3B3.3B
2.7BA3BA11BA28.BAB$6.4BA3.A12B3A9BABA$5.4BA.A.A.A23BABA$5.5B2A.2A5B4.
2B2.B2.2B2.2B$5.7B.7B7.3B$5.2BA4B.4BA2B7.B2AB$5.BA5B.5BAB8.2A$5.BA3B
2A.2A3BAB$5.2B3ABA.AB3A2B$5.3B2A.A.A.2A3B$6.3B2A3.2A3B$8.3B3.3B$9.B5.
B!

It seems there are a lot of interactions to check, might be there is a more compact p32 or p64 gun out there...

Code: Select all

x = 151, y = 65, rule = LifeHistory
7$115.B5.B$114.3B3.3B$112.4BA3.A4B$111.3B.A.A.A.A.3B$111.3B.B2A.2AB.
3B$111.2B.3AB.B3A.2B$111.2B2A3B.3B2A2B$112.3ABAB.BAB3A$111.2A3B2A.2A
3B2A$111.3A2B2A.2A2B3A$112.2A2B.B.B.2B2A$113.4A3.4A$114.BAB3.BAB$115.
A.4BA$118.5B$7.2A2B12.2A2B12.2A2B12.2A2B12.2A2B12.2A2B12.2A2B12.2A3B
12.2B$6.4CB11.4CB11.4CB11.4CB11.4CB11.4CB11.4CB11.4C2B.4B6.3A$5.D2A.C
A10.D2A.CA10.D2A.CA10.D2A.CA10.D2A.CA10.D2A.CA10.D2A.CA10.D2A.CA2.3B
7.3BAB$8.AC14.AC14.AC14.AC14.AC14.AC14.AC14.AC3.2BD6.A3BAB$123.4B6.A.
A2BA$123.6B2.A2BA.A$123.BDBAD3BA3BA$123.2BACAB.BA3B$123.DABDBA3.3A$
123.B2AB2A2B.2B$124.2AB2A$123.7B$117.2A4.7B4.2A$118.A4.7B4.A$118.A.AB
.3BA3B.BA.A$119.2AB.2B3A2B.B2A$121.3B2AB2A3B$120.3B3AB3A3B$118.2B.3B
2AB2A3B.2B$117.BAB2.3B3A3B2.BAB$117.ABA6BA6BABA$116.A3BAB.7B.BA3BA$
115.A.2BAB2.7B2.BA2B.A$113.BA2B.A6.3B6.A.2BAB$112.BA3BA7.A.A7.A3BAB$
112.2BABA6.3A.3A6.ABA2B$114.BAB5.A7.A5.BAB$114.2B6.2A5.2A6.2B!

[HotWheels9232]

Here:

Code: Select all

x = 18, y = 14, rule = B3/S23
2bo$3bo$b3o4$16b2o$2o15bo$2o12b3o$14bo2$5b2o3b2o$5b2o2bo2bo$10b2o!

Other block placements might reduce the BB
My 500th post!

[dvgrn]

Here:

Code: Select all

x = 18, y = 14, rule = B3/S23
2bo$3bo$b3o4$16b2o$2o15bo$2o12b3o$14bo2$5b2o3b2o$5b2o2bo2bo$10b2o!

Other block placements might reduce the BB
My 500th post!

My apologies about moving this. Here's what I was worried about:

if everyone decided to post splitters in this way -- four small objects that serve as a one-time splitter for a glider, with just one splitter per post -- then we could very easily keep posting until we reached a million or more posts just on that one "Splitters with common SL" thread. Without some attempt at grouping or classification, it would quickly become very painful to find anything in that thread.

-- Basically it seemed worth trying to make sure that that post didn't start any trends. Splitters with four common objects are plentiful enough that it really only makes sense to post them in categorized groups... (at least in my opinion).

[HotWheels9232]

Here:

Code: Select all

x = 18, y = 14, rule = B3/S23
2bo$3bo$b3o4$16b2o$2o15bo$2o12b3o$14bo2$5b2o3b2o$5b2o2bo2bo$10b2o!

Other block placements might reduce the BB
My 500th post!

My apologies about moving this. Here's what I was worried about:

if everyone decided to post splitters in this way -- four small objects that serve as a one-time splitter for a glider, with just one splitter per post -- then we could very easily keep posting until we reached a million or more posts just on that one "Splitters with common SL" thread. Without some attempt at grouping or classification, it would quickly become very painful to find anything in that thread.

-- Basically it seemed worth trying to make sure that that post didn't start any trends. Splitters with four common objects are plentiful enough that it really only makes sense to post them in categorized groups... (at least in my opinion).

So if we found more similar ones, would this one be added?
My 502nd post!