apgsearch v5.0

For general discussion about Conway's Game of Life.
etmoonshade
Posts: 9
Joined: May 8th, 2021, 11:48 pm

Re: apgsearch v5.0

Post by etmoonshade » May 9th, 2021, 9:32 pm

Dylan Chen wrote:
May 9th, 2021, 8:09 pm
etmoonshade wrote:
May 9th, 2021, 12:42 pm
62 cores * 1 virtual machine, 62 cores total: ~40k soups/second (s/s)
15 * 4, 60c: ~55k s/s (I think - didn't keep this data specifically)
7 * 8, 56c: ~75k s/s
So with my specific setup (an Epyc 7302 server at 32c/64t, running Hyper-V)
for your reference, the apgsearch running on my WSL / 4600H (6c12t) could reach 8k in single thread, and the multi-thread could reach 60k in total.
some tiny 1c1G server I rent from cloud (with AVX-512) could reach 9k+. you can check https://catagolue.hatsya.com/haul/b3s23 ... oud_Debian
each different number suffix stands for a 1c1G cloud server.

the haul size wouldn't be problem, it is not linear growing with the soup number. And the stability of Catagolue is fairly sound, it withstand 70 tiny server 'attack' in the size of 0.11billion soups.(haul size 53kB)
the interval I set for C1 is usually 2h+, and G1 is 0.5h.
Yup, I'm noticing that (I have a cheapo Azure VM doing ~8k/s,) but the 7302 has a pretty low clock (2.5GHz,) all things considered - I'm more surprised by how poorly the threads scale when they're on a single VM vs. multiples running on the same host. I get the feeling I have some tweaking to do...

As for the haul counts, thanks for the info - sorry if I'm focusing on this too much, I've just read a lot about people breaking stuff and I'm not 100% sure on the unspoken rules for doing something with multiple machines submitting hauls/etc. :)

Also, that haul suffix idea is clever, and I am totally stealing it. Eventually, next time I stop and rebuild everything. :D

Edit: I have powershell scripts now that do most of the build and setup for me on a VM server - would there be an appropriate place to release/post them (and presumably a second build script for a cloud server?) Would that even be useful for anyone?

Dylan Chen
Posts: 113
Joined: March 27th, 2020, 8:07 am
Contact:

Re: apgsearch v5.0

Post by Dylan Chen » May 9th, 2021, 9:58 pm

etmoonshade wrote:
May 9th, 2021, 9:32 pm
Edit: I have powershell scripts now that do most of the build and setup for me on a VM server - would there be an appropriate place to release/post them (and presumably a second build script for a cloud server?) Would that even be useful for anyone?
maybe the 'Scripts' sub-forum would suit that, it always good to share and backup, just in case.



From my humble experience of soup searching. the benchmark (of search speed) is mainly decided by the OS plantform. Linux > WSL > Cywin > VM. even different distribution would have 10% speed differency. Debian > Ubuntu.

If possible, it is more efficient for multi-thread machine to do spaceship search (rather than soup search). the soup search now can be do with GPU accelerate. G1 now produce tenfold soups than traditional C1.https://catagolue.hatsya.com/census/b3s23/G1
In this morning, a new elementary Knight spaceship has been found. it took 4 months of search and 45k of CPU hours. super mainframes would speed up the search process.
Tools should not be the limit.
Whether your obstacle is a script, an stdin, or Linux environment computing resouces.
check New rules thread for help.

User avatar
calcyman
Posts: 2447
Joined: June 1st, 2009, 4:32 pm

Re: apgsearch v5.0

Post by calcyman » May 9th, 2021, 10:00 pm

etmoonshade wrote:
May 9th, 2021, 9:32 pm
As for the haul counts, thanks for the info - sorry if I'm focusing on this too much, I've just read a lot about people breaking stuff
There's no need to worry about this. Every Catagolue downtime that's happened in the past has been from searching other cellular automata (not B3/S23).
and I'm not 100% sure on the unspoken rules for doing something with multiple machines submitting hauls/etc. :)
There aren't any unspoken rules. :)

No-one will complain if you submit lots of hauls with reasonable sizes (say, 10M -- 100M soups). If you're submitting 100M-soup hauls, then you'd need about 2000 CPU cores running continually to be able to saturate Catagolue's current safety limit of 'process <= 120 hauls every 12-minute update cycle'. And that doesn't actually cause anything to fail; it just means that the queue of unprocessed hauls will steadily grow.
What do you do with ill crystallographers? Take them to the mono-clinic!

etmoonshade
Posts: 9
Joined: May 8th, 2021, 11:48 pm

Re: apgsearch v5.0

Post by etmoonshade » May 9th, 2021, 11:31 pm

Dylan Chen wrote:
May 9th, 2021, 9:58 pm
From my humble experience of soup searching. the benchmark (of search speed) is mainly decided by the OS plantform. Linux > WSL > Cywin > VM. even different distribution would have 10% speed differency. Debian > Ubuntu.
Just a quick little update on this. Because I've been thinking "wow, that's kinda slow," I've been digging around for anything I could do to tune my system. Turns out that Microsoft decided to apply a "balanced" power plan by default to a server OS. I was absolutely livid when I finally figured that out.

On the upside, I went from:

Code: Select all

Overall Average soups/sec: 9217.16925
Total soups/sec: 73737.354
To:

Code: Select all

Overall Average soups/sec: 17471.580625
Total soups/sec: 139772.645
across 8 servers. And now I probably need to re-run tests with higher core counts per machine.

calcyman wrote:
May 9th, 2021, 10:00 pm
There aren't any unspoken rules. :)
And now I know there aren't any unspoken rules. :D
calcyman wrote:
May 9th, 2021, 10:00 pm
No-one will complain if you submit lots of hauls with reasonable sizes (say, 10M -- 100M soups).
That's kind of the guidance I was looking for, ultimately. Thanks again!

User avatar
GUYTU6J
Posts: 1430
Joined: August 5th, 2016, 10:27 am
Location: 拆哪!I repeat, CHINA! (a.k.a. 种花家)
Contact:

Re: apgsearch v5.0

Post by GUYTU6J » May 14th, 2021, 2:16 am

Suppose I'm piping the output RLE's from an external program to apgsearch with the separator "|". When apgseach pauses searching to upload a haul to catagolue, would the external program be paused as well? If not, for the purpose of some enumeration, part of the results will be lost.

If in the case above I have no prior knowledge about the number of results from an enumeration, how should I define the number of soups per haul?
This post was brought to you under the red flag of PRC and CPC.
英★特★纳★雄★耐★尔☭☭就★一★定★要★实★现!

河南加油!
中国奥运健儿加油!

Dylan Chen
Posts: 113
Joined: March 27th, 2020, 8:07 am
Contact:

Re: apgsearch v5.0

Post by Dylan Chen » May 14th, 2021, 2:54 am

GUYTU6J wrote:
May 14th, 2021, 2:16 am
Suppose I'm piping the output RLE's from an external program to apgsearch with the separator "|".
from the humble experience of running ROR_stdin. the apgsearch would not miss any input, thus we can 'assume' in each soup circle, external program would pause until this very soup got searched.

GUYTU6J wrote:
May 14th, 2021, 2:16 am
how should I define the number of soups per haul?
it may depend on various factors, search speed, search efficiency. btw, the haul size of ROR_stdin is so huge that easily exceed 1000kB, the haul size I set is 10000 (the minimal limit of stdin).
Tools should not be the limit.
Whether your obstacle is a script, an stdin, or Linux environment computing resouces.
check New rules thread for help.

User avatar
GUYTU6J
Posts: 1430
Joined: August 5th, 2016, 10:27 am
Location: 拆哪!I repeat, CHINA! (a.k.a. 种花家)
Contact:

Re: apgsearch v5.0

Post by GUYTU6J » May 14th, 2021, 3:34 am

Dylan Chen wrote:
May 14th, 2021, 2:54 am
GUYTU6J wrote:
May 14th, 2021, 2:16 am
If in the case above I have no prior knowledge about the number of results from an enumeration, how should I define the number of soups per haul?
it may depend on various factors, search speed, search efficiency. btw, the haul size of ROR_stdin is so huge that easily exceed 1000kB, the haul size I set is 10000 (the minimal limit of stdin).
Emm, you're not getting my point. I do not really care about time consumption here. Say the enumeration will yield 10,001 soups containing 25 single object each, and I set 10000 as the number of soups per haul, then the last 25 objects in the last soup will fail to be uploaded. I hope this kind of situation does not happen, but I don't see obvious methods except for uploading objects one by one (which needs bypassing the current minimum size of a haul).

---

Also, what is the current threshold for oversized/pathological patterns, especially linear growth patterns?
This post was brought to you under the red flag of PRC and CPC.
英★特★纳★雄★耐★尔☭☭就★一★定★要★实★现!

河南加油!
中国奥运健儿加油!

Dylan Chen
Posts: 113
Joined: March 27th, 2020, 8:07 am
Contact:

Re: apgsearch v5.0

Post by Dylan Chen » May 14th, 2021, 4:06 am

GUYTU6J wrote:
May 14th, 2021, 3:34 am
Say the enumeration will yield 10,001 soups containing 25 single object each, and I set 10000 as the number of soups per haul, then the last 25 objects in the last soup will fail to be uploaded.

the method I use is :

Code: Select all

fill_rle="x = 2, y = 2, rule = B3/S23 \n 2o$2o!"
 #block
use blocks to fill the soup limit (reach 10000)
Tools should not be the limit.
Whether your obstacle is a script, an stdin, or Linux environment computing resouces.
check New rules thread for help.

User avatar
LaundryPizza03
Posts: 1350
Joined: December 15th, 2017, 12:05 am
Location: Unidentified location "https://en.wikipedia.org/wiki/Texas"

Re: apgsearch v5.0

Post by LaundryPizza03 » May 17th, 2021, 11:19 am

With the latest version of apgsearch, I got a strange error when trying to run a B0 rule:

Code: Select all

Rule b0136s0124 cannot be iterated 1 x 2^0 generations.

Code: Select all

x = 4, y = 3, rule = B3-q4z5y/S234k5j
2b2o$b2o$2o!
LaundryPizza03 at Wikipedia

The latest edition of new-gliders.db.txt and oscillators.db.txt have 31531 spaceships and 1293 oscillators from outer-totalistic rules. You are invited to help!

User avatar
yujh
Posts: 2385
Joined: February 27th, 2020, 11:23 pm
Location: Toronto, On, Canada
Contact:

Re: apgsearch v5.0

Post by yujh » June 23rd, 2021, 5:56 am

Excuse me, is there a place to tell me how to search for other types of rules like LTL?

lemon41625
Posts: 331
Joined: January 24th, 2020, 7:39 am
Location: 小红点 (if you know where that is)

Re: apgsearch v5.0

Post by lemon41625 » June 24th, 2021, 5:46 am

yujh wrote:
June 23rd, 2021, 5:56 am
Excuse me, is there a place to tell me how to search for other types of rules like LTL?
Just input the rulestring

Code: Select all

./apgluxe --rule <rulestring> ...
For example, for Minibugs (R2,C2,S6-9,B7-8,NM)

Code: Select all

./apgluxe --rule r2b7t8s7t10 ...
Download CAViewer: https://github.com/jedlimlx/Cellular-Automaton-Viewer

Supports:
BSFKL, Extended Generations, Regenerating Generations, Naive Rules, R1 Moore, R2 Cross and R2 Von Neumann INT
And some others...

User avatar
yujh
Posts: 2385
Joined: February 27th, 2020, 11:23 pm
Location: Toronto, On, Canada
Contact:

Re: apgsearch v5.0

Post by yujh » June 24th, 2021, 5:48 am

lemon41625 wrote:
June 24th, 2021, 5:46 am
yujh wrote:
June 23rd, 2021, 5:56 am
Excuse me, is there a place to tell me how to search for other types of rules like LTL?
Just input the rulestring

Code: Select all

./apgluxe --rule <rulestring> ...
For example, for Minibugs (R2,C2,S6-9,B7-8,NM)

Code: Select all

./apgluxe --rule r2b7t8s7t10 ...
Tried that one. Thanks anyways. What is apgtables? How can I throw them into apgsearch?

lemon41625
Posts: 331
Joined: January 24th, 2020, 7:39 am
Location: 小红点 (if you know where that is)

Re: apgsearch v5.0

Post by lemon41625 » June 24th, 2021, 6:19 am

yujh wrote:
June 24th, 2021, 5:48 am
Tried that one. Thanks anyways. What is apgtables? How can I throw them into apgsearch?
The apgtable is basically a Golly ruletable but they allow custom neighbourhoods. So for example, I can have an apgtable called Test.rule.
Place the file in the same directory as apgsearch and then

Code: Select all

./apgluxe --rule Test.rule ...
Download CAViewer: https://github.com/jedlimlx/Cellular-Automaton-Viewer

Supports:
BSFKL, Extended Generations, Regenerating Generations, Naive Rules, R1 Moore, R2 Cross and R2 Von Neumann INT
And some others...

User avatar
yujh
Posts: 2385
Joined: February 27th, 2020, 11:23 pm
Location: Toronto, On, Canada
Contact:

Re: apgsearch v5.0

Post by yujh » June 30th, 2021, 8:08 am

Sorry for this again, how do I ./recompile a HROT rule? I don't know what these mean, e.g. g4r2b000008s00000c

User avatar
LaundryPizza03
Posts: 1350
Joined: December 15th, 2017, 12:05 am
Location: Unidentified location "https://en.wikipedia.org/wiki/Texas"

Re: apgsearch v5.0

Post by LaundryPizza03 » July 13th, 2021, 11:35 pm

Apgsearch got stuck while searching B35678/S03678. The only viable explanation is that it's because of a soup containing only a whitespace breeder. I'm not sure why such objects don't get passed as zz_QUADRATIC.

Code: Select all

x = 5, y = 5, rule = B35678/S03678
2bo$b3o$5o$b3o$2bo!

Code: Select all

x = 4, y = 3, rule = B3-q4z5y/S234k5j
2b2o$b2o$2o!
LaundryPizza03 at Wikipedia

The latest edition of new-gliders.db.txt and oscillators.db.txt have 31531 spaceships and 1293 oscillators from outer-totalistic rules. You are invited to help!

User avatar
LaundryPizza03
Posts: 1350
Joined: December 15th, 2017, 12:05 am
Location: Unidentified location "https://en.wikipedia.org/wiki/Texas"

Re: apgsearch v5.0

Post by LaundryPizza03 » July 13th, 2021, 11:51 pm

yujh wrote:
June 30th, 2021, 8:08 am
Sorry for this again, how do I ./recompile a HROT rule? I don't know what these mean, e.g. g4r2b000008s00000c
Those six numbers after the b and the s are hexadecimal encodings of the birth and survival conditions, where the nth place represents the next state of a cell with that many live neighbors. The ordering is big-endian, which means that the lowest neighbor counts are at the end with the last bit representing n=1. In this case, expanding the hexadecimal digits reveals that the rule is R2,C4,S3-4,B4.

Code: Select all

x = 64, y = 64, rule = g4r2b000008s00000c
.2A.A.A.2A.A2.5A2.A5.5A.3A3.A2.2A.A2.A.2A.A.2A3.3A$3.A.A2.3A.4A3.A.2A
.A.A2.8A.A5.5A2.A.A3.4A.2A$2.A.2A2.A4.A.A3.2A.2A7.A2.2A.3A.3A2.4A2.3A
2.2A3.2A$3.A3.A.A4.2A2.2A.2A2.2A2.A2.A8.2A.A2.A2.2A4.4A.2A$.2A.3A.A.
3A.2A.2A.5A.2A.3A4.A2.2A.3A2.2A.A.3A.2A2.4A$A2.3A2.A2.A2.A2.4A.2A2.A.
A.2A.A.A3.A.A.2A.A.2A2.5A.A.3A$.A2.A4.3A3.A.A4.3A3.2A3.A4.5A.2A2.A2.A
.2A.A3.A2.A$4A.A5.5A2.3A2.A2.A2.A2.2A3.A.A4.2A2.4A2.3A.3A$2A.7A4.2A2.
A2.A.A3.2A.5A.A.2A5.2A.5A.A2.A3.3A$2A3.A.6A.A2.A2.7A.A.2A.2A.A.A.4A.A
6.A2.A.A.3A.A$A2.4A.3A.2A.2A.2A.2A4.4A.A.2A2.A.2A2.A.3A10.A2.A$.4A.A.
A2.4A.A.2A.A.A.A2.A.A2.3A.A2.A6.4A.A5.2A$2.A7.A3.A2.A3.3A2.3A4.A.A.A.
2A7.2A2.A2.3A2.3A$2A.A.A2.A3.A3.3A.A.3A2.A4.A.A3.2A4.2A4.A2.3A3.2A.A$
5A.A2.2A2.A.A.A5.A2.A.A2.A3.4A3.A3.A.A.A.2A.2A.A.2A$.6A4.A.3A.A2.A.2A
.2A.A.A3.2A.A4.2A7.A.2A2.2A$2A.A4.3A.A2.A.4A.A3.A3.A.2A2.A2.A4.3A.A.
7A.2A2.A$2.A4.A.A.3A3.5A.A.2A3.A3.A.A2.A3.A.A3.4A2.A6.2A$A.A2.2A3.3A.
A.4A3.A2.4A3.2A2.2A4.A6.2A.2A2.A.3A$3A2.2A.A4.2A.2A2.2A.A3.2A.A.2A2.A
.2A.A.2A5.2A.3A2.A2.A.A$6.4A.A3.A2.2A.A.2A4.2A.A.3A2.2A3.A.2A4.2A2.2A
3.A.A$.A.2A.A3.A.A2.A5.2A.A7.A2.A2.5A.A3.3A.A.A3.3A$2A.4A2.A3.A3.A.A.
A3.A.4A.2A.3A3.A3.2A.A.3A7.A.2A$5.A2.A4.A5.2A2.A.A2.A2.3A.A.4A2.A.2A
3.3A2.4A3.2A$5.A3.A.A.2A.3A.A2.6A.2A.2A4.2A5.A2.A2.A7.A$A.A3.A2.2A2.
4A.A3.A.A4.2A2.2A2.A.2A.A.3A.6A.2A2.4A$5.4A.2A2.A.3A.2A2.A2.A.2A.A6.A
.A.2A.A.A4.5A2.4A$2.2A.2A2.A.2A.2A.A.4A.A2.4A.A2.A.A.4A3.A.A3.A2.A.2A
.A2.A$3A.3A3.A3.A.A6.2A.3A.A.4A.A.A.4A2.A2.4A.2A.A2.A$2.3A.2A4.2A3.2A
.A.2A6.3A.A2.A2.2A.2A.A2.2A2.7A.A.A$2.A2.A.2A.A.2A.A.2A3.2A.A4.3A.2A
2.A2.2A2.3A2.2A3.A2.2A.A.A$2.4A2.2A.A.A3.A.6A5.2A.3A.A4.A4.2A.A.A4.2A
2.A.A$A4.3A.A.A.6A3.2A2.A2.2A5.A.2A4.A4.A.7A.4A$.2A2.A.7A.2A.A.2A.3A
2.2A.A.A3.4A.A2.2A2.2A.A.2A.7A$A5.A2.A.2A3.3A2.A3.5A.2A.2A.2A3.A4.A2.
3A2.A3.A.2A$.A2.A.A6.A.3A.5A.3A.A2.3A2.2A2.2A3.A2.2A2.A2.A2.2A$A.A.A
3.A.A.A.5A2.A.3A.4A.A.A.2A2.A2.4A.A2.9A.2A$3.A4.3A.5A.2A3.3A.8A.A.3A.
A.2A.2A2.2A.3A.5A$.A2.2A.A2.A3.A2.2A3.A2.3A.4A.7A3.A.A4.2A.A2.A.3A.A$
4A7.A.A.2A2.2A3.A.2A2.A2.3A.2A5.A.A.3A4.2A3.A2.A$5A4.2A.4A10.A.A.2A.
2A3.2A.A2.7A.2A.5A.2A$2.A3.A.A.2A3.A.A2.A.3A4.A3.3A4.2A.A4.A5.2A6.A$
3.4A2.A3.3A.A.A6.A.A4.A.A2.A.A.7A.A2.A.3A.A2.2A$2.3A.5A.3A2.2A2.A.3A
2.3A2.A2.A4.6A6.6A3.A$5.A.6A.A.A.A3.A2.A.A2.3A.A3.A.2A.2A.2A.A2.4A.A.
4A$2A.2A.A.A3.2A.A.2A7.2A.3A.2A.A2.A2.2A2.3A4.2A5.A.A$A.A3.2A.4A2.A.
2A2.2A.3A.A.A.4A4.5A8.3A.A.5A$2.A3.A3.2A.3A2.A4.A.3A.A2.A.A.A.2A2.2A
2.5A.A.A.A.2A2.2A$A3.A4.A.2A.2A.A2.3A3.3A.A2.4A.3A3.3A.A.A2.2A.A.3A$A
2.A.2A.2A2.2A4.2A.2A3.A.2A.2A2.A2.A2.A5.2A.A.A.2A.A4.2A$6A2.A2.A.A.A
3.A2.3A2.A.4A.2A.A3.7A.A2.A.2A.A.2A2.A$.A.A.A.2A3.A.A.A2.A.4A.A.2A.3A
5.2A2.2A3.3A.2A.5A$2.A.A3.7A2.A.A.3A2.3A.2A2.2A.2A4.A.5A3.A.3A3.A.A$.
A.A.A.A2.3A3.3A5.A3.2A.A2.7A.3A.4A3.6A.2A.A$A2.2A3.A.A2.4A7.3A5.3A.A
2.A2.4A2.A4.3A.7A$A5.A.A.A.2A.A2.A.2A.2A.A2.2A8.2A.2A3.A.A5.2A3.4A$.A
.2A.3A.A.2A.3A.A2.3A.2A2.5A.A.A5.A.4A.A3.A3.A.A.A$A3.4A.A.A.2A3.3A4.A
.2A2.A.3A.A.2A.A.4A2.A.2A.A2.2A.3A$A4.2A.A.2A.A6.A2.A2.2A.2A.4A6.A.2A
4.A.A3.4A2.A$3.3A2.3A3.A3.A8.2A.2A3.A.2A.4A.4A.4A2.A2.A3.A$.A.A.A5.6A
.3A2.2A3.A.2A7.3A.A2.4A3.A4.A.A$2A3.A3.2A.7A3.3A2.2A.A.A3.A.A.3A.A.2A
.A.2A5.3A.A$A.A.2A3.2A.A4.2A2.A.4A2.A4.A.2A3.4A.2A.A2.A3.A2.2A.2A$.A
4.3A2.2A.A.A.2A.A4.A2.A2.3A.A2.A.2A.3A4.2A.A2.4A.A!

Code: Select all

x = 64, y = 64, rule = R2,C4,S3-4,B4
.2A.A.A.2A.A2.5A2.A5.5A.3A3.A2.2A.A2.A.2A.A.2A3.3A$3.A.A2.3A.4A3.A.2A
.A.A2.8A.A5.5A2.A.A3.4A.2A$2.A.2A2.A4.A.A3.2A.2A7.A2.2A.3A.3A2.4A2.3A
2.2A3.2A$3.A3.A.A4.2A2.2A.2A2.2A2.A2.A8.2A.A2.A2.2A4.4A.2A$.2A.3A.A.
3A.2A.2A.5A.2A.3A4.A2.2A.3A2.2A.A.3A.2A2.4A$A2.3A2.A2.A2.A2.4A.2A2.A.
A.2A.A.A3.A.A.2A.A.2A2.5A.A.3A$.A2.A4.3A3.A.A4.3A3.2A3.A4.5A.2A2.A2.A
.2A.A3.A2.A$4A.A5.5A2.3A2.A2.A2.A2.2A3.A.A4.2A2.4A2.3A.3A$2A.7A4.2A2.
A2.A.A3.2A.5A.A.2A5.2A.5A.A2.A3.3A$2A3.A.6A.A2.A2.7A.A.2A.2A.A.A.4A.A
6.A2.A.A.3A.A$A2.4A.3A.2A.2A.2A.2A4.4A.A.2A2.A.2A2.A.3A10.A2.A$.4A.A.
A2.4A.A.2A.A.A.A2.A.A2.3A.A2.A6.4A.A5.2A$2.A7.A3.A2.A3.3A2.3A4.A.A.A.
2A7.2A2.A2.3A2.3A$2A.A.A2.A3.A3.3A.A.3A2.A4.A.A3.2A4.2A4.A2.3A3.2A.A$
5A.A2.2A2.A.A.A5.A2.A.A2.A3.4A3.A3.A.A.A.2A.2A.A.2A$.6A4.A.3A.A2.A.2A
.2A.A.A3.2A.A4.2A7.A.2A2.2A$2A.A4.3A.A2.A.4A.A3.A3.A.2A2.A2.A4.3A.A.
7A.2A2.A$2.A4.A.A.3A3.5A.A.2A3.A3.A.A2.A3.A.A3.4A2.A6.2A$A.A2.2A3.3A.
A.4A3.A2.4A3.2A2.2A4.A6.2A.2A2.A.3A$3A2.2A.A4.2A.2A2.2A.A3.2A.A.2A2.A
.2A.A.2A5.2A.3A2.A2.A.A$6.4A.A3.A2.2A.A.2A4.2A.A.3A2.2A3.A.2A4.2A2.2A
3.A.A$.A.2A.A3.A.A2.A5.2A.A7.A2.A2.5A.A3.3A.A.A3.3A$2A.4A2.A3.A3.A.A.
A3.A.4A.2A.3A3.A3.2A.A.3A7.A.2A$5.A2.A4.A5.2A2.A.A2.A2.3A.A.4A2.A.2A
3.3A2.4A3.2A$5.A3.A.A.2A.3A.A2.6A.2A.2A4.2A5.A2.A2.A7.A$A.A3.A2.2A2.
4A.A3.A.A4.2A2.2A2.A.2A.A.3A.6A.2A2.4A$5.4A.2A2.A.3A.2A2.A2.A.2A.A6.A
.A.2A.A.A4.5A2.4A$2.2A.2A2.A.2A.2A.A.4A.A2.4A.A2.A.A.4A3.A.A3.A2.A.2A
.A2.A$3A.3A3.A3.A.A6.2A.3A.A.4A.A.A.4A2.A2.4A.2A.A2.A$2.3A.2A4.2A3.2A
.A.2A6.3A.A2.A2.2A.2A.A2.2A2.7A.A.A$2.A2.A.2A.A.2A.A.2A3.2A.A4.3A.2A
2.A2.2A2.3A2.2A3.A2.2A.A.A$2.4A2.2A.A.A3.A.6A5.2A.3A.A4.A4.2A.A.A4.2A
2.A.A$A4.3A.A.A.6A3.2A2.A2.2A5.A.2A4.A4.A.7A.4A$.2A2.A.7A.2A.A.2A.3A
2.2A.A.A3.4A.A2.2A2.2A.A.2A.7A$A5.A2.A.2A3.3A2.A3.5A.2A.2A.2A3.A4.A2.
3A2.A3.A.2A$.A2.A.A6.A.3A.5A.3A.A2.3A2.2A2.2A3.A2.2A2.A2.A2.2A$A.A.A
3.A.A.A.5A2.A.3A.4A.A.A.2A2.A2.4A.A2.9A.2A$3.A4.3A.5A.2A3.3A.8A.A.3A.
A.2A.2A2.2A.3A.5A$.A2.2A.A2.A3.A2.2A3.A2.3A.4A.7A3.A.A4.2A.A2.A.3A.A$
4A7.A.A.2A2.2A3.A.2A2.A2.3A.2A5.A.A.3A4.2A3.A2.A$5A4.2A.4A10.A.A.2A.
2A3.2A.A2.7A.2A.5A.2A$2.A3.A.A.2A3.A.A2.A.3A4.A3.3A4.2A.A4.A5.2A6.A$
3.4A2.A3.3A.A.A6.A.A4.A.A2.A.A.7A.A2.A.3A.A2.2A$2.3A.5A.3A2.2A2.A.3A
2.3A2.A2.A4.6A6.6A3.A$5.A.6A.A.A.A3.A2.A.A2.3A.A3.A.2A.2A.2A.A2.4A.A.
4A$2A.2A.A.A3.2A.A.2A7.2A.3A.2A.A2.A2.2A2.3A4.2A5.A.A$A.A3.2A.4A2.A.
2A2.2A.3A.A.A.4A4.5A8.3A.A.5A$2.A3.A3.2A.3A2.A4.A.3A.A2.A.A.A.2A2.2A
2.5A.A.A.A.2A2.2A$A3.A4.A.2A.2A.A2.3A3.3A.A2.4A.3A3.3A.A.A2.2A.A.3A$A
2.A.2A.2A2.2A4.2A.2A3.A.2A.2A2.A2.A2.A5.2A.A.A.2A.A4.2A$6A2.A2.A.A.A
3.A2.3A2.A.4A.2A.A3.7A.A2.A.2A.A.2A2.A$.A.A.A.2A3.A.A.A2.A.4A.A.2A.3A
5.2A2.2A3.3A.2A.5A$2.A.A3.7A2.A.A.3A2.3A.2A2.2A.2A4.A.5A3.A.3A3.A.A$.
A.A.A.A2.3A3.3A5.A3.2A.A2.7A.3A.4A3.6A.2A.A$A2.2A3.A.A2.4A7.3A5.3A.A
2.A2.4A2.A4.3A.7A$A5.A.A.A.2A.A2.A.2A.2A.A2.2A8.2A.2A3.A.A5.2A3.4A$.A
.2A.3A.A.2A.3A.A2.3A.2A2.5A.A.A5.A.4A.A3.A3.A.A.A$A3.4A.A.A.2A3.3A4.A
.2A2.A.3A.A.2A.A.4A2.A.2A.A2.2A.3A$A4.2A.A.2A.A6.A2.A2.2A.2A.4A6.A.2A
4.A.A3.4A2.A$3.3A2.3A3.A3.A8.2A.2A3.A.2A.4A.4A.4A2.A2.A3.A$.A.A.A5.6A
.3A2.2A3.A.2A7.3A.A2.4A3.A4.A.A$2A3.A3.2A.7A3.3A2.2A.A.A3.A.A.3A.A.2A
.A.2A5.3A.A$A.A.2A3.2A.A4.2A2.A.4A2.A4.A.2A3.4A.2A.A2.A3.A2.2A.2A$.A
4.3A2.2A.A.A.2A.A4.A2.A2.3A.A2.A.2A.3A4.2A.A2.4A.A!

Code: Select all

x = 4, y = 3, rule = B3-q4z5y/S234k5j
2b2o$b2o$2o!
LaundryPizza03 at Wikipedia

The latest edition of new-gliders.db.txt and oscillators.db.txt have 31531 spaceships and 1293 oscillators from outer-totalistic rules. You are invited to help!

Post Reply