LeapLife (B2n3/S23-q)

[yujh]

I hate saying sentences because I don't want to start arguing with other members.

Code: Select all

RLE

Sad you didn't included my hardworked p2/s...

I will, immediately after I finished my hardworked BokaBB-LtL implementation draft in Random Posts.

Seems like FWK is interested in making collections now.

[Hunting]

I'm cross-posting JP21's spartan spaceship eaters from the Sandbox:

Code: Select all

x = 135, y = 26, rule = B2n3/S23-q
39b2o$39b2o62b2o27b2o$103b2o27b2o5$2o9b2o13b2o28b2o19b2o7b2o28b2o$2o9b
2o13b2o28b2o19b2o7b2o28b2o4$8bo21b3o9b3o15b3o9b3o15b3o9b3o15b3o9b3o$4b
3ob2o22bo9bo19bo9bo19bo9bo19bo9bo$3bo5b2o22bo7bo21bo7bo21bo7bo21bo7bo$
3bo2bo26bo7bo21bo7bo21bo7bo21bo7bo$bo5bo22bo5b3o5bo15bo5b3o5bo15bo5b3o
5bo15bo5b3o5bo$bob2o3bo22b3o7b3o17b3o7b3o17b3o7b3o17b3o7b3o$bo6bo23bo
3bobo3bo19bo3bobo3bo19bo3bobo3bo19bo3bobo3bo$4bo27bo2bo3bo2bo19bo2bo3b
o2bo19bo2bo3bo2bo19bo2bo3bo2bo$3b2o2b2o23bo3bobo3bo19bo3bobo3bo19bo3bo
bo3bo19bo3bobo3bo$2bo6bo25bo3bo25bo3bo25bo3bo25bo3bo$3b2obo27b2o3b2o
23b2o3b2o23b2o3b2o23b2o3b2o$7b2o24bobo3bobo21bobo3bobo21bobo3bobo21bob
o3bobo$34b3ob3o23b3ob3o23b3ob3o23b3ob3o$34b2o3b2o23b2o3b2o23b2o3b2o23b
2o3b2o!

EDIT: Kittyst found a faster symmetrical eater for the 2c/7. It's useless though.

Code: Select all

x = 21, y = 23, rule = B2n3/S23-q
2o17b2o$2o17b2o8$3b3o9b3o$5bo9bo$6bo7bo$6bo7bo$3bo5b3o5bo$4b3o7b3o$5bo
3bobo3bo$5bo2bo3bo2bo$5bo3bobo3bo$8bo3bo$7b2o3b2o$6bobo3bobo$7b3ob3o$
7b2o3b2o!

EDIT: I ran Kittyst on the "smallest spaceship of every speed" collection. Fortunately it found yet another eater for FWKnightship's 2c/6.

Code: Select all

x = 17, y = 46, rule = B2n3/S23-q
$4b2o5b2o$4b2o5b2o24$5bo5bo$5b2o3b2o$4bo2bobo2bo$5bobobobo$5bo5bo$5bo
5bo$bobo2b2ob2o2bobo$o2bo9bo2bo$o15bo2$2o13b2o$4o9b4o$bob2o7b2obo$bobo
2bo3bo2bobo$2o3bo5bo3b2o$4bo2bobo2bo2$6b2ob2o$6b2ob2o$6bobobo!

[yujh]

I'm cross-posting JP21's spartan spaceship eaters from the Sandbox:

Code: Select all

x = 135, y = 26, rule = B2n3/S23-q
39b2o$39b2o62b2o27b2o$103b2o27b2o5$2o9b2o13b2o28b2o19b2o7b2o28b2o$2o9b
2o13b2o28b2o19b2o7b2o28b2o4$8bo21b3o9b3o15b3o9b3o15b3o9b3o15b3o9b3o$4b
3ob2o22bo9bo19bo9bo19bo9bo19bo9bo$3bo5b2o22bo7bo21bo7bo21bo7bo21bo7bo$
3bo2bo26bo7bo21bo7bo21bo7bo21bo7bo$bo5bo22bo5b3o5bo15bo5b3o5bo15bo5b3o
5bo15bo5b3o5bo$bob2o3bo22b3o7b3o17b3o7b3o17b3o7b3o17b3o7b3o$bo6bo23bo
3bobo3bo19bo3bobo3bo19bo3bobo3bo19bo3bobo3bo$4bo27bo2bo3bo2bo19bo2bo3b
o2bo19bo2bo3bo2bo19bo2bo3bo2bo$3b2o2b2o23bo3bobo3bo19bo3bobo3bo19bo3bo
bo3bo19bo3bobo3bo$2bo6bo25bo3bo25bo3bo25bo3bo25bo3bo$3b2obo27b2o3b2o
23b2o3b2o23b2o3b2o23b2o3b2o$7b2o24bobo3bobo21bobo3bobo21bobo3bobo21bob
o3bobo$34b3ob3o23b3ob3o23b3ob3o23b3ob3o$34b2o3b2o23b2o3b2o23b2o3b2o23b
2o3b2o!

EDIT: Kittyst found a faster symmetrical eater for the 2c/7. It's useless though.

Code: Select all

x = 21, y = 23, rule = B2n3/S23-q
2o17b2o$2o17b2o8$3b3o9b3o$5bo9bo$6bo7bo$6bo7bo$3bo5b3o5bo$4b3o7b3o$5bo
3bobo3bo$5bo2bo3bo2bo$5bo3bobo3bo$8bo3bo$7b2o3b2o$6bobo3bobo$7b3ob3o$
7b2o3b2o!

EDIT: I ran Kittyst on the "smallest spaceship of every speed" collection. Fortunately it found yet another eater for FWKnightship's 2c/6.

Code: Select all

x = 17, y = 46, rule = B2n3/S23-q
$4b2o5b2o$4b2o5b2o24$5bo5bo$5b2o3b2o$4bo2bobo2bo$5bobobobo$5bo5bo$5bo
5bo$bobo2b2ob2o2bobo$o2bo9bo2bo$o15bo2$2o13b2o$4o9b4o$bob2o7b2obo$bobo
2bo3bo2bobo$2o3bo5bo3b2o$4bo2bobo2bo2$6b2ob2o$6b2ob2o$6bobobo!

Where can I download Kittyst v1.2?
Done.

[Hunting]

I'm cross-posting JP21's spartan spaceship eaters from the Sandbox:

Code: Select all

x = 135, y = 26, rule = B2n3/S23-q
39b2o$39b2o62b2o27b2o$103b2o27b2o5$2o9b2o13b2o28b2o19b2o7b2o28b2o$2o9b
2o13b2o28b2o19b2o7b2o28b2o4$8bo21b3o9b3o15b3o9b3o15b3o9b3o15b3o9b3o$4b
3ob2o22bo9bo19bo9bo19bo9bo19bo9bo$3bo5b2o22bo7bo21bo7bo21bo7bo21bo7bo$
3bo2bo26bo7bo21bo7bo21bo7bo21bo7bo$bo5bo22bo5b3o5bo15bo5b3o5bo15bo5b3o
5bo15bo5b3o5bo$bob2o3bo22b3o7b3o17b3o7b3o17b3o7b3o17b3o7b3o$bo6bo23bo
3bobo3bo19bo3bobo3bo19bo3bobo3bo19bo3bobo3bo$4bo27bo2bo3bo2bo19bo2bo3b
o2bo19bo2bo3bo2bo19bo2bo3bo2bo$3b2o2b2o23bo3bobo3bo19bo3bobo3bo19bo3bo
bo3bo19bo3bobo3bo$2bo6bo25bo3bo25bo3bo25bo3bo25bo3bo$3b2obo27b2o3b2o
23b2o3b2o23b2o3b2o23b2o3b2o$7b2o24bobo3bobo21bobo3bobo21bobo3bobo21bob
o3bobo$34b3ob3o23b3ob3o23b3ob3o23b3ob3o$34b2o3b2o23b2o3b2o23b2o3b2o23b
2o3b2o!

EDIT: Kittyst found a faster symmetrical eater for the 2c/7. It's useless though.

Code: Select all

x = 21, y = 23, rule = B2n3/S23-q
2o17b2o$2o17b2o8$3b3o9b3o$5bo9bo$6bo7bo$6bo7bo$3bo5b3o5bo$4b3o7b3o$5bo
3bobo3bo$5bo2bo3bo2bo$5bo3bobo3bo$8bo3bo$7b2o3b2o$6bobo3bobo$7b3ob3o$
7b2o3b2o!

EDIT: I ran Kittyst on the "smallest spaceship of every speed" collection. Fortunately it found yet another eater for FWKnightship's 2c/6.

Code: Select all

x = 17, y = 46, rule = B2n3/S23-q
$4b2o5b2o$4b2o5b2o24$5bo5bo$5b2o3b2o$4bo2bobo2bo$5bobobobo$5bo5bo$5bo
5bo$bobo2b2ob2o2bobo$o2bo9bo2bo$o15bo2$2o13b2o$4o9b4o$bob2o7b2obo$bobo
2bo3bo2bobo$2o3bo5bo3b2o$4bo2bobo2bo2$6b2ob2o$6b2ob2o$6bobobo!

Where can I download Kittyst v1.2?

Not released yet. I'm working on it.

[yujh]

I'm cross-posting JP21's spartan spaceship eaters from the Sandbox:

Code: Select all

x = 135, y = 26, rule = B2n3/S23-q
39b2o$39b2o62b2o27b2o$103b2o27b2o5$2o9b2o13b2o28b2o19b2o7b2o28b2o$2o9b
2o13b2o28b2o19b2o7b2o28b2o4$8bo21b3o9b3o15b3o9b3o15b3o9b3o15b3o9b3o$4b
3ob2o22bo9bo19bo9bo19bo9bo19bo9bo$3bo5b2o22bo7bo21bo7bo21bo7bo21bo7bo$
3bo2bo26bo7bo21bo7bo21bo7bo21bo7bo$bo5bo22bo5b3o5bo15bo5b3o5bo15bo5b3o
5bo15bo5b3o5bo$bob2o3bo22b3o7b3o17b3o7b3o17b3o7b3o17b3o7b3o$bo6bo23bo
3bobo3bo19bo3bobo3bo19bo3bobo3bo19bo3bobo3bo$4bo27bo2bo3bo2bo19bo2bo3b
o2bo19bo2bo3bo2bo19bo2bo3bo2bo$3b2o2b2o23bo3bobo3bo19bo3bobo3bo19bo3bo
bo3bo19bo3bobo3bo$2bo6bo25bo3bo25bo3bo25bo3bo25bo3bo$3b2obo27b2o3b2o
23b2o3b2o23b2o3b2o23b2o3b2o$7b2o24bobo3bobo21bobo3bobo21bobo3bobo21bob
o3bobo$34b3ob3o23b3ob3o23b3ob3o23b3ob3o$34b2o3b2o23b2o3b2o23b2o3b2o23b
2o3b2o!

EDIT: Kittyst found a faster symmetrical eater for the 2c/7. It's useless though.

Code: Select all

x = 21, y = 23, rule = B2n3/S23-q
2o17b2o$2o17b2o8$3b3o9b3o$5bo9bo$6bo7bo$6bo7bo$3bo5b3o5bo$4b3o7b3o$5bo
3bobo3bo$5bo2bo3bo2bo$5bo3bobo3bo$8bo3bo$7b2o3b2o$6bobo3bobo$7b3ob3o$
7b2o3b2o!

EDIT: I ran Kittyst on the "smallest spaceship of every speed" collection. Fortunately it found yet another eater for FWKnightship's 2c/6.

Code: Select all

x = 17, y = 46, rule = B2n3/S23-q
$4b2o5b2o$4b2o5b2o24$5bo5bo$5b2o3b2o$4bo2bobo2bo$5bobobobo$5bo5bo$5bo
5bo$bobo2b2ob2o2bobo$o2bo9bo2bo$o15bo2$2o13b2o$4o9b4o$bob2o7b2obo$bobo
2bo3bo2bobo$2o3bo5bo3b2o$4bo2bobo2bo2$6b2ob2o$6b2ob2o$6bobobo!

Where can I download Kittyst v1.2?

Not released yet. I'm working on it.

So has to use it(I don’t really understand)

[Hunting]

Where can I download Kittyst v1.2?

Not released yet. I'm working on it.

So has to use it(I don’t really understand)

It's still in development, I will release it soon. Understand now?

[yujh]

Not released yet. I'm working on it.

So has to use it(I don’t really understand)

It's still in development, I will release it soon. Understand now?

Ye p

[JP21]

Why am I always so lucky and unlucky???

Code: Select all

x = 11, y = 13, rule = B2n3/S23-q
2bobo$3b2o$3bo6$3o$2bo$bo6b2o$8bobo$8bo!

Edit:

Code: Select all

x = 11, y = 14, rule = B2n3/S23-q
8bo$6b2o$7b2o6$9bo$8b2o$8bobo$3o$2bo$bo!

Edit:

Code: Select all

x = 15, y = 19, rule = B2n3/S23-q
6bo$7bo$5b3o6$14bo$12b2o$13b2o3$9bo$8b2o$8bobo$3o$2bo$bo!

[Hunting]

I will put them into the synthesis database. But not now.

So while bubblegum continue to submit apgsearch hauls, let's do wild speculations.

come here!!

EDIT:

Speculation #1: When will LeapLife get to the leaderboard?

A: 42 billon objects.

According to Catagolue there are 3.3 objects from one soup. From April 8th to April 13rd, bubblegum submitted 45 hauls - an average of 9 hauls per day. One regular bubblegum-haul consists of 5000000 soups, that is, 16500000 objects. So bubblegum can contribute 148500000 everyday.

We needs 42000000000 objects to get to the leaderboard, and we already have more than 19000000000 objects as well - 23000000000 objects left. So LeapLife will show up on the Census page of Catagolue after - 155 days!

Well, it will be faster if someone else joins.

Speculation #2: What will be the next natural period in C1?

A: We already have p2, 3, 4, 5, 6, 8, 10, 12, 14, 15, 20, 26, 30 and 42.

Now I'm going to introduce a measurement of commonness. Let's say, that the commonness of the two-beehive p6 is 1, umm, Foobar. The other oscillators' commonness is their frequency divided by the two-beehive p6's frequency. For example, the commonness of the TL is around 73.5 Foobar.

The smallest unnatural composite period that is the product of two already-known oscillators is xp24. (To be continued...)

[bubblegum]

One regular bubblegum-haul consists of 5000000 soups, that is, 16500000 objects.

The standard unit of an apgluxe haul shall now be the bubblegum-haul, 5M soups.
A rule-bubblegum-haul is one bubblegum-haul worth of objects in said rule, par exemple, one LeapLife-bubblegum-haul is 16.5M objects.
For instance, I am now submitting 5 bubblegum-hauls to b2n3s23-q/C1, or 25M/haul, and so 5 LeapLife-bubblegum-hauls are being contributed to the census, or 82.5M objects/haul.

~apgluxe arithmetic lessons

Now I'm going to introduce a measurement of commonness. Let's say, that the commonness of the two-beehive p6 is 1, umm, Foobar. The other oscillators' commonness is their frequency divided by the two-beehive p6's frequency. For example, the commonness of the TL is around 73.5 Foobar.

Frequency class, calculated relative to the block, which has ~8B occurrences in b2n3s23-q/C1 at the time of writing.
For oscillators, the blinker, the TL, the tripole, the most common xp3, or the two beehives xp6_77w77 would all work fine, but I think the blinker is best suited for it.

[Hunting]

One regular bubblegum-haul consists of 5000000 soups, that is, 16500000 objects.

The standard unit of an apgluxe haul shall now be the bubblegum-haul, 5M soups.
A rule-bubblegum-haul is one bubblegum-haul worth of objects in said rule, par exemple, one LeapLife-bubblegum-haul is 16.5M objects.
For instance, I am now submitting 5 bubblegum-hauls to b2n3s23-q/C1, or 25M/haul, and so 5 LeapLife-bubblegum-hauls are being contributed to the census, or 82.5M objects/haul.

~apgluxe arithmetic lessons

(chewing bubblegum)

How many millons are there in a billon? ...Well, 1000 I guess.

Hopefully you'll submit enough hauls later so you can complete your daily 9 hauls. ...148.5M, roughly 6.5 days for one millon.

We need more <s>bubblegumer</s>apgsearchers.

EDIT:

Speculation #3: When will bubblegum take the blue and red sectors?

A: Who knows?

[bubblegum]

what's the leaplife portal?

[Hunting]

what's the leaplife portal?

A website I cre-Ated. That doesn't have any content yet. (Intended)

[Hunting]

p46 wick:

Code: Select all

x = 34, y = 4, rule = B2n3/S23-q:T36,0
4bo8bo8bo8bo$3bobo6bobo6bobo6bobo$2bo3bo4bo3bo4bo3bo4bo3bo$2b2ob2o4b2o
b2o4b2ob2o4b2ob2o!

[bubblegum]

Speculation #3: When will bubblegum take the blue and red sectors?

A: Who knows?

A: Run this script:

Code: Select all

from urllib.request import *
rule = "b2n3s23-q"
sym = "C1"
user = "bubblegum"
rank = 1
url = urlopen("https://catagolue.appspot.com/census/{}/{}".format(rule, sym)).read().splitlines()
url = [i.strip() for i in url]
count = url[url.index('<p align="center">The following census was compiled from') + 3:url.index("<p><b>Navigation:")]
count[0] = count[0][26:-16]
count[1] = count[1][30:-11]
a = ""
for i in count:
  if i == count[0]:
    f = True
  i = i.split("&#8201;")
  for j in i:
    a += j
  if f:
    o = int(a)
  else:
    s = int(a)
  a = ""
  f = False
r = o/s
url = url[url.index("series: [{type: 'pie', name: 'Objects contributed', data: [") + 1:url.index("]}]")]
order = []
for i in url:
  n, y, c, u = i.split(", ")
  if n[8:-1] == user:
    q = int(y[3:])
  order.append(int(y[3:]))
order.sort()
diff = order[-rank] - q
print(diff / r / 5000000)

For rank = 2, we get 19.196863697, which means that I will need to upload 20 bubblegum-hauls to take the blue sector, or 2 days at 2 * 5 bubblegum-hauls/day. For rank = 1, it's 549.716173754, which is 550 bubblegum-hauls or 55 days, assuming that EricABQ and Pavgran do not apgsearch LeapLife the next, uh, two months.

This script also works for any other rule/symmetry/user/rank.
par exemple, it will take carybe 95560.3910729 (95561) bubblegum-hauls to overtake AB in the b3s23/D8_1 census at the time of writing, which is up there below the topic.

[dvgrn]

I haven't started writing the classifier script for these constellations yet. Has any progress been made on that?

Sureeeeeeeeee, I'm working on it right now! I will come up with it soon.

Any progress on the OTT classification front? I'd like to have this code available for one-time turners in Life as well, so I might just go ahead and write it after I finish a couple of other items.

[Hunting]

I haven't started writing the classifier script for these constellations yet. Has any progress been made on that?

Sureeeeeeeeee, I'm working on it right now! I will come up with it soon.

Any progress on the OTT classification front? I'd like to have this code available for one-time turners in Life as well, so I might just go ahead and write it after I finish a couple of other items.

Ohhhhh no. I'm just about to complete it - wait!

I know I said that before, but I promise this time it's real. Since it's pretty late here in China I will surely release this top-priority project tommorrow.

I hate people beating me to the punch, since that ruins my hard work.

[Hunting]

I'm having trouble classifying turners.

Is the following approach correct @dvgrn?

• Run 4096 generations and get bounding box.
• Calculate where it would have been if there's no blocks.
• Classify with the offset mod 8.

Or is this correct?

• Select a wide box on the three rows the glider would have been without blocks after 4096 ticks
• Run and detect until the glider is in the row with the phase it would have been without blocks.
• Classify with the time mod 8

The first approach seems to be much easier to implement.

Are we classifying them using the lane shift or the delay?

[dvgrn]

The first approach seems to be much easier to implement.

Are we classifying them using the lane shift or the delay?

For 0-degree and 180-degree turners, collecting the lane shift would be nice, but maybe it's not necessary.

If you want to slow-salvo construct a LeapLife Demonoid, you can get along without 0-degree and 180-degree turners -- though ideally it would be good to have them. It might be easiest to write completely separate code for each orientation of turner.

For 90-degree turners there's no such thing as lane shift, because we can put the OTT wherever we want to get different output lanes. The only important things are the color and the timing mod 8. There are sixteen classes of 90-degree turners, so any method of separating 90-degree turners into those classes would be just fine.

... Not sure this will be helpful, but here's a possible way to think about the problem:

Code: Select all

x = 89, y = 49, rule = B2n3/S23-qHistory
28.2A$28.2A$37.2A$37.2A5$38.2A$38.2A10$B3.B$B.B.B.B$2BD.2B$2.D.D$B.2D
B$B.B.B.B54.A$2B2.2B56.A$60.3A13$87.2A$87.2A6$83.2A$77.2A4.2A$77.2A!

Let's say you have a 180-degree one-time turner (in the southeast, above), a glider aimed at the 180-degree turner, and a 90-degree turner that you want to classify (in the northwest). The red location is the place where the glider will reach at T=600.

Now, you're allowed to move both the 90-degree turner and the 180-degree turner northwest or southeast, wherever you want it. Under those conditions, that same 90-degree turner can equally well reach any of the four blue glider locations at T=600. It can also reach the halfway point between any two of those blue gliders -- but not the one-quarter or three-quarter points, or any other glider phase.

I.e., you can't get a different color or phase of output glider by just using these two turners. If you keep the same 180-degree OTT and substitute in some other 90-degree OTT, and you find that you can still reach this exact same set of locations at T=600, then the new OTT belongs in the same class as the original one.

[Hunting]

The first approach seems to be much easier to implement.

Are we classifying them using the lane shift or the delay?

For 0-degree and 180-degree turners, collecting the lane shift would be nice, but maybe it's not necessary.

If you want to slow-salvo construct a LeapLife Demonoid, you can get along without 0-degree and 180-degree turners -- though ideally it would be good to have them. It might be easiest to write completely separate code for each orientation of turner.

For 90-degree turners there's no such thing as lane shift, because we can put the OTT wherever we want to get different output lanes. The only important things are the color and the timing mod 8. There are sixteen classes of 90-degree turners, so any method of separating 90-degree turners into those classes would be just fine.

... Not sure this will be helpful, but here's a possible way to think about the problem:

Code: Select all

x = 89, y = 49, rule = B2n3/S23-qHistory
28.2A$28.2A$37.2A$37.2A5$38.2A$38.2A10$B3.B$B.B.B.B$2BD.2B$2.D.D$B.2D
B$B.B.B.B54.A$2B2.2B56.A$60.3A13$87.2A$87.2A6$83.2A$77.2A4.2A$77.2A!

Let's say you have a 180-degree one-time turner (in the southeast, above), a glider aimed at the 180-degree turner, and a 90-degree turner that you want to classify (in the northwest). The red location is the place where the glider will reach at T=600.

Now, you're allowed to move both the 90-degree turner and the 180-degree turner northwest or southeast, wherever you want it. Under those conditions, that same 90-degree turner can equally well reach any of the four blue glider locations at T=600. It can also reach the halfway point between any two of those blue gliders -- but not the one-quarter or three-quarter points, or any other glider phase.

I.e., you can't get a different color or phase of output glider by just using these two turners. If you keep the same 180-degree OTT and substitute in some other 90-degree OTT, and you find that you can still reach this exact same set of locations at T=600, then the new OTT belongs in the same class as the original one.

So...

Can I consider the color as "lane mod 2"?

How to get the timing with program? I'm not sure.

[bubblegum]

Code: Select all

x = 89, y = 49, rule = B2n3/S23-qHistory
28.2A$28.2A$37.2A$37.2A5$38.2A$38.2A10$B3.B$B.B.B.B$2BD.2B$2.D.D$B.2D
B$B.B.B.B54.A$2B2.2B56.A$60.3A13$87.2A$87.2A6$83.2A$77.2A4.2A$77.2A!

Let's say you have a 180-degree one-time turner (in the southeast, above), a glider aimed at the 180-degree turner, and a 90-degree turner that you want to classify (in the northwest). The red location is the place where the glider will reach at T=600.

If you're wondering, here's said pattern at T=600:

Code: Select all

x = 92, y = 57, rule = B2n3/S23-qHistory
34.B$30.B2.3B3.2B$27.10B.4B$25.19B4.2B$25.25B$23.28B$23.27B$23.26B$22.
28B$21.29B$20.4B3.24B$19.4B6.21B$18.4B7.21B$17.4B9.18B$16.4B9.19B$15.
4B11.19B$14.4B13.19B$13.4B15.19B$12.4B16.15B.4B$11.4B15.16B3.4B$10.4B
16.14B6.4B$9.4B16.16B6.4B$8.4B18.14B8.4B$7.4B19.14B9.4B$B3.B.4B22.13B
9.4B$B.B.5B27.9B10.4B$2BD.4B30.5B13.4B$2.DBD2B32.3B15.4B$B.CD2B34.B17.
4B$B.ABA.B52.4B$2B2A2B54.4B$60.5B$61.5B$62.5B$63.5B$64.5B$65.5B$66.5B
$67.5B$68.5B$69.5B$70.5B$71.5B3.2B.B$72.17B$73.18B$74.17B$75.15B$76.15B
$77.15B$77.15B$78.14B$77.15B$77.14B$77.12B$81.7B$82.5B$85.B!

(I do remember that there was a command to set the gen. number, what happened to it?)

[Hunting]

I'm proud to announce my lastest search utility, OCAgar, a Python version of Random Agar. It's lacking a lot of features, of course, but it's still in development.

Note: Don't be too happy to see a lot of results - it cannot filter out repetitions. You can't recover the predecessor. Some "agars" may be spaceship streams

It discovered a lot of novel agars in LeapLife. Most importantly it found this p36 agar:

Code: Select all

x = 13, y = 13, rule = B2n3/S23-q:T16,16
3o5b3o$o2bo4bo2bo$o3bo3bo3bo$4bo7bo$2b3o5b3o4$3o5b3o$o2bo4bo2bo$o3bo3b
o3bo$4bo7bo$2b3o5b3o!

And this p12 wick:

Code: Select all

x = 13, y = 16, rule = B2n3/S23-q:T16,16
3b2o6b2o$3b2o6b2o$o7bo$4bo7bo$2o6b2o$2o6b2o$4bo7bo$o7bo$3b2o6b2o$3b2o
6b2o$o7bo$4bo7bo$2o6b2o$2o6b2o$4bo7bo$o7bo!

the program creates result files under the directory it is in. The format of filename is "class_subclass_id". The class is one of p (for periodic) or z (an apgsearch meme, meaning the period is unidentifiable). For p the subclass is the period. And for z the subclass is one of "CHAOTIC" (when the pattern density is over 0.4) and "HIGHPERIOD" (when it's sparser than CHAOTIC). The id is basically just a number to distinguish it from other patterns in the same subclass.

Here is the source code:

Code: Select all

import golly as g

# Parameters
xmax = 8
ymax = 8
soup_count = 16384
min_period = 5
max_period = 50
density = 37

# Initialization
g.setalgo("HashLife")
g.setbase(8)
g.setstep(5)
g.select([-1024, -1024, 2048, 2048])
g.setrule(g.getrule() + ":T" + str(xmax) + "," + str(ymax))
result_count = [0] * max_period
chaotic_count = 0
hipe_count = 0
g.autoupdate(True)
known = []

for i in range(soup_count):
	g.randfill(density)
	g.step()
	hashlist = []

	# Detect period
	for j in range(0, max_period):
		g.run(1)
		if g.hash(g.getselrect()) in hashlist:
			# Periodic
			if (j >= min_period) and not (min(hashlist) in known) and j != 32:
				result_count[j] += 1
				g.save("p_" + str(j) + "_" + str(result_count[j]) + ".rle", "rle")
				known.append(min(hashlist))
			break
		hashlist.append(g.hash(g.getselrect()))
	else:
		# Aperiodic
		if int(g.getpop()) / (xmax * ymax) > 0.4:
			# Density > 40%
			chaotic_count += 1
			g.save("z_CHAOTIC_" + str(chaotic_count) + ".rle", "rle")
		else:
			# Density < 40%
			hipe_count += 1
			g.save("z_HIGHPERIOD_" + str(hipe_count) + ".rle", "rle")

(The j != 32 clause on line 33 is just there to omit annoying single glider in the 8x8 search. Change the number when doing other searches.)

xmax and ymax specifies the size of the field. The soup_count specifies the number of soups to be run. Min_period and max_period are pretty much self-explanatory. Density specifies the density of the soup.

Oaky that's it for now. After a few modification that at least make the program make sense I will publish it properly.

[FWKnightship]

New 12c/24:

Code: Select all

x = 51, y = 51, rule = B2n3/S23-q
13bo$12b3o$14b2o$5b3o2bo2b4o18bo4bo$4bo2bo2b2o22b3o2b3o$3bo4b5ob3o16b
2o6b2o$3bo2b2o8bo15b4ob2ob4o$6bob2o7bo17bo4bo$3b2obo7b2o18bo6bo$2bobob
o4bo2bo3bo17bo2bo$2bo2b2o2b3ob2o2b3o10b3ob2o4b2ob3o$3bobobobob2o6b2o9b
o14bo$9bo3bob2ob4o10bo10bo$8b2o3bo4bo10b2obo10bob2o$8bobo5bobob2o$7bo
2bo2b2o3bob2o4b3o18b3o$7bo10bo3bo3bo22bo$9bo$7b2o9b2ob2o2b2o22b2o2$16b
13o$10bo3b2obo9bob2o3bo$4bo3b2ob2o2bo13bo2b2ob2o3bo$3b3ob2o5bobobob5ob
obobo5b2ob3o$2b2o3b2o2bob2ob2o9b2ob2obo2b2o3b2o$b4o2bo2bo23bo2bo2b4o$
4bo2bo29bo2bo$b2obo2b2o12b3o12b2o2bob2o$b2obob3o12bobo12b3obob2o$o3b2o
15bobo15b2o3bo$o4bo16bo16bo4bo$2b2o37b2o2$17b2o7b2o$17bobo5bobo$19b2o
3b2o$18b2o5b2o6$17bo9bo$15b3o9b3o$17bo9bo5$17bo9bo$17bo9bo!

12c/24 beehive puffer:

Code: Select all

x = 47, y = 32, rule = B2n3/S23-q
13bo19bo$12b3o17b3o$14b2o15b2o$5b3o2bo2b4o13b4o2bo2b3o$4bo2bo2b2o23b2o
2bo2bo$3bo4b5ob3o13b3ob5o4bo$3bo2b2o8bo13bo8b2o2bo$6bob2o7bo11bo7b2obo
$3b2obo7b2o15b2o7bob2o$2bobobo4bo2bo3bo9bo3bo2bo4bobobo$2bo2b2o2b3ob2o
2b3o7b3o2b2ob3o2b2o2bo$3bobobobob2o6b2o5b2o6b2obobobobo$9bo3bob2ob4o3b
4ob2obo3bo$8b2o3bo4bo9bo4bo3b2o$8bobo5bobob2o3b2obobo5bobo$7bo2bo2b2o
3bob2o3b2obo3b2o2bo2bo$7bo10bo3bobo3bo10bo$9bo27bo$7b2o9b2ob2ob2ob2o9b
2o2$16b15o$10bo3b2obo11bob2o3bo$4bo3b2ob2o2bo15bo2b2ob2o3bo$3b3ob2o5bo
bobo9bobobo5b2ob3o$2b2o3b2o2bob2ob2o11b2ob2obo2b2o3b2o$b4o2bo2bo25bo2b
o2b4o$4bo2bo31bo2bo$b2obo2b2o29b2o2bob2o$b2obob3o29b3obob2o$o3b2o35b2o
3bo$o4bo35bo4bo$2b2o39b2o!

12c/24 glider forerake:

Code: Select all

x = 47, y = 35, rule = B2n3/S23-q
12b3o17b3o$12bo2bo15bo2bo$6bo4b2o3bo13bo3b2o4bo$5b3o2b2obo2bo13bo2bob
2o2b3o$4b2o35b2o$3b4ob2o2bo2b2o13b2o2bo2b2ob4o$6bo4bo5bo11bo5bo4bo$3b
2obobo6b2o13b2o6bobob2o$3b2obo3bo3b2o15b2o3bo3bob2o$2bo3b2o3b2o3b4o7b
4o3b2o3b2o3bo$2bo4b3o4bo2bo2bo5bo2bo2bo4b3o4bo$4b2o3bobo3b2o4bo3bo4b2o
3bobo3b2o$9bo3b2o2b2o2bo3bo2b2o2b2o3bo$8bobo3b3obo9bob3o3bobo$7bo2bo2b
2o3bob2o3b2obo3b2o2bo2bo$7b3o8bobobobobobo8b3o$8bo10bobo3bobo10bo$7bo
10b2ob2ob2ob2o10bo$8bo29bo2$15b17o$9b3o2b2obob9obob2o2b3o$3b3ob2ob2obo
3bo3b5o3bo3bob2ob2ob3o$2bo2b2o3b2o9b5o9b2o3b2o2bo$bo3bo3bo3b2ob2o11b2o
b2o3bo3bo3bo$bo2bob2o14b3o14b2obo2bo$4b4obo11bobobo11bob4o$b2obo16bobo
bo16bob2o$obobo3bo13b3o13bo3bobobo$o2b2o2bo6bo8bo15bo2b2o2bo$bobobo7b
3o25bobobo$12b2obo$12b3o$12b3o$13b2o!

24c/48 glider backrake:

Code: Select all

x = 51, y = 58, rule = B2n3/S23-q
13bo$12b3o$14b2o$5b3o2bo2b4o18bo4bo$4bo2bo2b2o22b3o2b3o$3bo4b5ob3o16b
2o6b2o$3bo2b2o8bo15b4ob2ob4o$6bob2o7bo17bo4bo$3b2obo7b2o18bo6bo$2bobob
o4bo2bo3bo17bo2bo$2bo2b2o2b3ob2o2b3o10b3ob2o4b2ob3o$3bobobobob2o6b2o9b
o14bo$9bo3bob2ob4o10bo10bo$8b2o3bo4bo10b2obo10bob2o$8bobo5bobob2o$7bo
2bo2b2o3bob2o4b3o18b3o$7bo10bo3bo3bo22bo$9bo$7b2o9b2ob2o2b2o22b2o2$16b
13o$10bo3b2obo9bob2o3bo$4bo3b2ob2o2bo13bo2b2ob2o3bo$3b3ob2o5bobobob5ob
obobo5b2ob3o$2b2o3b2o2bob2ob2o9b2ob2obo2b2o3b2o$b4o2bo2bo11bo11bo2bo2b
4o$4bo2bo13b3o13bo2bo$b2obo2b2o12b3o12b2o2bob2o$b2obob3o27b3obob2o$o3b
2o33b2o3bo$o4bo12b2o5b2o12bo4bo$2b2o13bo9bo13b2o$17bo9bo$19bo5bo$18b2o
5b2o4$20b2ob2o$19bobobobo$18b3o3b3o$9b3o5b2obo3bob2o$8bo2bo6b2o5b2o$
11bo7bo5bo$11bo$8bobo5b3o7b3o$15bo3bo5bo3bo$15bo3bo5bo3bo$15bo3bo5bo3b
o$16b3o7b3o6$15bo$15bobo$15b2o!

[Hunting]

p76 agar (z_HIGHPERIOD_1):

Code: Select all

x = 18, y = 18, rule = B2n3/S23-q:T18,18
4bobo6bobo3$6bobo6bobo$2o4b2ob2o4b2o$6bobo6bobo$6bo8bo$4bobo6bobo$2b2o
b2o4b2ob2o$4bobo6bobo3$6bobo6bobo$2o4b2ob2o4b2o$6bobo6bobo$6bo8bo$4bob
o6bobo$2b2ob2o4b2ob2o!

[yujh]

p76 agar (z_HIGHPERIOD_1):

Code: Select all

x = 18, y = 18, rule = B2n3/S23-q:T18,18
4bobo6bobo3$6bobo6bobo$2o4b2ob2o4b2o$6bobo6bobo$6bo8bo$4bobo6bobo$2b2o
b2o4b2ob2o$4bobo6bobo3$6bobo6bobo$2o4b2ob2o4b2o$6bobo6bobo$6bo8bo$4bob
o6bobo$2b2ob2o4b2ob2o!

How can you even find this?