(Fun writing) Let's prefer CGOL has just been discovered!

[Disaster16439]

I already have one, but it needed a simulation prorgam to run. Can anyone help me?

I improved Disaster a bit, so now it is 1.3 times faster than C++. I made one that generates random 24x24 patterns. It uses HASH-576 tech, to upload to a database called Dissearch and confirm it is actually random. I just updated it to get 1x576 and 2x288 symmetries.

Dissearch.dis 3141.59 MB (download)

OOC: I'm deciding that this is not inline with our progression. C++ is compiled, with extreme optimization, directly to MACHINE CODE, which Disaster, no matter the interpereter/compiler, cannot really surpass. Also, please be a bit considerate with the search programs; This is meant to be a sort of apgsearch, and will be emulated by real apgsearch; please provide a working stdin soup script so we can actually upload hauls.

I don't mean to come off as rude here, I'm just saying that I expect a soup-searcher to take pretty long to develop, and that we shouldn't be elevating Disaster to above C++, which has decades of optimization in its compilers.

Edit: can you also provide the syntax of Disaster? (I really like making interpereters)

But none pf the pther search programs are actur Written. Also, Disaster doesn't exist. Disaster is also compiled

[hotcrystal0]

Something weird:

Code: Select all

x = 10, y = 10, rule = B3/S23
2o$b2o$o3$7b2o$6bobo$6bo2bo$6bobo$7bo!

Observe how the ant is perturbed, but then goes back to normal.

[Para]

But none pf the pther search programs are actur Written. Also, Disaster doesn't exist. Disaster is also compiled

OOC: Oh, I assumed that it was bytecode interpereted or something. Still, a compiled language should not be faster than C++, because a C++ compiler has been optimized over many decades and versions, please don't just jump to faster than it.

I'm asking for a stdin script because I want there to be a rule where any discoveries found by a soupsearcher should actually show up in a real haul found by apgsearch, uploaded to Catagolue. Therefore we need a stdin script so we can upload to, say, rediscoveringcgol_stdin.

I'll delete these response posts once a consensus is reached about this issue.

[Para]

Sorry for doubleposting, but here's the Fandom:
https://funwritingletsprefercgolhasjust ... fandom.com

[Quantum-mechanics]

I want to call ant to glide ant or glider, because it’s glide symmetric.
I want to call this kind of ant to animals, because it is moving.

[Para]

I want to call ant to glide ant or glider, because it’s glide symmetric.
I want to call this kind of ant to animals, because it is moving.

Sorry, there is already established terminology for these objects, and there isn't much hope of changing them now. (Also, don't rename stuff to its real-life name, please!)
You can make your own terminology, just be aware that it won't be in the slightest way common or official, so it's a bit of a futile exercise.

I don't want to discourage you from trying new things, we're all just people trying our best to discover. If you put some work in, you'll definitely get to name something of your own one day!

[Quantum-mechanics]

Inspired by Blueman`s Burger, I`m putting steaks together something I got:

Code: Select all

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

this is cheeseburger

Code: Select all

x = 5, y = 5, rule = B23/S3
2b2ob$bo2bo$obobo$o2bob$b2o!

I`ll name that bun.

Code: Select all

x = 5, y = 4, rule = B3/S23
b2o2b$o2bob$bo2bo$2b2o!

And bread.

Code: Select all

x = 7, y = 13, rule = B3/S23
5bo$4bobo$3bo2bo$2bob2o$bobo$o2bo$b2ob2o$3bo2bo$3bobo$b2obo$o2bo$obo$bo!

fire

Code: Select all

x = 10, y = 10, rule = B3/S23
5bo$4bobo$3bo2bo$2bob2ob2o$bobo2bo2bo$o2bo2bobo$b2ob2obo$3bo2bo$3bobo$
4bo!

and wood
------------------------------------------------------------------------------------------------------
Let`s start making some ant transmutations (ATs)!
Like:

Code: Select all

x = 7, y = 6, rule = B3/S23
o$b2o$2o$4b3o$6bo$5bo!

That is for the square.

Code: Select all

x = 8, y = 5, rule = B3/S23
2bo$obo$b2o3bo$5bo$5b3o!

And for the repeater!

Code: Select all

x = 7, y = 7, rule = B3/S23
bo$2bo$3o2$4b3o$6bo$5bo!

And that`s for the four sets of repeaters!
And why four sets of repeaters don`t have a name

What? B23/S3?

[b-engine]

...
And that`s for the four sets of repeaters!
And why four sets of repeaters don`t have a name

I decide to name the common sets of 4 as they're so common that it's non-sense for them being unnamed.

Code: Select all

x = 98, y = 30, rule = B3/S23
30bo26b2o$4bo24bobo25b2o$4bo24bobo63bo$4bo25bo12b2o50b2o$14b3o9b2o5b2o
7bo2bo12b2o17b2o17b2o$3o3b3o5bobo8bo2bo3bo2bo7b3o12b2o17b2o18bo$14b3o
9b2o5b2o$4bo25bo$4bo24bobo46b2o$4bo24bobo46b2o$30bo7$57b2o$57b2o$4b2o
23b2o$3bobo22bo2bo$3b2o23bobo11bo36bo$b2o12b3o8b2obo3bo9bo18b2o15bobo
$obo5b2o5bo2bo6bo2bo3bobo6bo2bo9b2o6b2o7b2o6b2o$2o5bobo5bo2bo6bobo3bo
2bo5b3o11b2o14bobo$7b2o7b3o7bo3bob2o7bo30bo$5b2o22bobo$4bobo21bo2bo$4b
2o23b2o28b2o$59b2o!

1. Target (4 repeaters)
2. Puff bomb (4 puffs, as you expect)
3. Rectangles I (4 squares)
4. Wall (4 bricks)
5. Pan (4 steaks)
6. Rectangles II (4 squares, again)

[lk050807]

Sorry for doubleposting, but here's the Fandom:
https://funwritingletsprefercgolhasjust ... fandom.com

Or if you find that too long you can use https://bit.ly/NewCGoLWiki

[hotcrystal0]

Two small-looking movers that do not appear to be known:

Code: Select all

x = 31, y = 12, rule = B3/S23
5bo2bo16b5o$4bo20bo4bo$4bo3bo16bo$4b4o18bo3bo$25b4o$b2o21bobo$2ob2o9b
o6b2ob3o$b4o3b2o2bo3bo3b2o2b2o$2b4ob3o9b2o2b2o$7b3o6bo3b2ob3o$7bo2b6o
7b2o$11bo!

Edit: WHAT

Code: Select all

x = 17, y = 20, rule = B3/S23
5bo2bo$4bo$4bo3bo$4b4o2$b2o$2ob2o9bo$b4o3b2o2bo3bo$2b4ob3o$7b3o6bo$7b
o2b6o$11bo6$10bo$9b2o$9bobo!

[Para]

(let's try resolving this in-character).

*snip*
PS: I'm also starting work on a program that will run millions of random patterns in hope to find something (Yes, it's inefficient, but some patterns can only be found this way).
*snip*

I already have one, but it needed a simulation program to run. Can anyone help me?

I improved Disaster a bit, so now it is 1.3 times faster than C++. I made one that generates random 24x24 patterns. It uses HASH-576 tech, to upload to a database called Dissearch and confirm it is actually random. I just updated it to get 1x576 and 2x288 symmetries.

Dissearch.dis 3141.59 MB (download)

Unfortunately, there must have been something up with your benchmarks, because after installing the latest version of the Earthquake Disaster compiler, it's still (only about 1.6x now!) slower than C++. At any rate, it almost works, except the object identification system is a bit less rigorous (and performant) than I would like.

*snip*
PS: I'm also starting work on a program that will run millions of random patterns in hope to find something (Yes, it's inefficient, but some patterns can only be found this way).
*snip*

I already have one, but it needed a simulation progam to run. Can anyone help me?

This one is another promising lead, but again the object identification is a bit wack.

I wrote a new one (based off my bit-parallel rlife algorithm, rlife is included):
idob.cpp - 311 KB (download)

It took a bit of pipelining to stream the input from Disaster16439's SHA input to idob and then to Disaster's web server (which is fully functional!), but IT WORKS, and is quite a lot more performant than Dissearch. It even comes with the benefit of being able to read input from stdin. I suppose this should be called a collaboration?

Dependencies: make, rlife, g++, Earthquake, Python for configuring rlife.

The appropriate files, bundled with the Makefile and a few configuration scripts:
ssrc.zip - 4121 KB (download)

Just run make in any Unix terminal after navigating to the directory, and it should assemble itself.

Edit: HOW DID WE MISS THIS????

Code: Select all

x = 24, y = 24, rule = B3/S23
4o5bobo2bo2b2obo2bo$obo7bob3obo$bob7obo2b2ob2obobo$b2obob4o2bo2b2obo2b
o$bob5ob4o3bo3b4o$2o2bo2b6o2bob2obobo$3bo7bob4o3bo2bo$b3obo5b2o4b2obob
o$o4b3o2b2obo2b2ob2o$obo3bob3obob6o3bo$bobo3bo3b3ob6o$o2b3o3b6obo2b2ob
2o$6bo2bo2b4o6bo$ob2obobobo3b2obo2b4o$2o2bo4b2o2bobo4bo$2ob2o4b2ob4ob
3o$ob3ob3ob7o3bo$6b3o3bob5obo$o2b2ob3o4b2o2bobobo$bobob4o2bob3ob5obo$b
o5b2o3bob4obob2o$4obob2o2b4o3bob4o$bobo2bo2b2o3b2o2b3o2bo$2bob3ob3ob2o
4b2o3bo!

OOC: To actually upload to Cata, please use apgsearch with this stdin script, upload to rediscoveringcgol_stdin.

Code: Select all

#include <iostream>
#include <string>
#include <ctime>
#include <csignal>

using namespace std;

int soupsize;
int seed = time(NULL);
long numsoups = 0;

int main(int argc, char** argv){
    if(argc == 1){
        soupsize = 24;
    }
    else if(argc == 2){
        soupsize = stoi(argv[1]);
    }
    else if(argc == 3){
        soupsize = stoi(argv[1]);
        seed = stoi(argv[2]);
    }
    else{
        cout << "Argument format:\n" << argv[0] << " [soup size] [seed]\n";
        exit(1);
    }

    cout << "\nGenerating soups of size " << soupsize << "x" << soupsize << " with seed " << seed << ".\n";

    srand(seed);
    while(true){
        string soup = "x = 0, y = 0, rule = B3/S23\n";
        for(int row = 0; row < soupsize; row ++){
            for(int col = 0; col < soupsize; col ++){
                int randnum = rand() & 1;
                if(randnum){
                    soup += "o";
                }
                else{
                    soup += "b";
                }
            }
            soup += "$";
        }
        soup += "!\n";
        numsoups ++;
        if(numsoups % 25000 == 0){
            cout << "25000 soups completed, " << numsoups << " total.\n";
        }
        cout << soup;
    }
}

[hotcrystal0]

I know this is a doublepost, but here is a partial for a period-45 ant factory:

Code: Select all

 x = 24, y = 33, rule = B3/S23
13b2o$13bo$11bobo$7b2o2b2o$b2o4b2o$3o$2o$4b2o$4b2o4b2o$8b5o$7bo2bobo$
6bob2o4bobo$6bo3bo$6bob4o3b2o$7b3o4b2o$14bo$11b2o2$16b2o$5b2o9bo$6bo3b
2o5b3o$3b3o3b4o6b3o$3bo4bobo2bo8bo$8b2o2bobo4b2o2bo$12bobo3bo2b2o$15b
obob2o$16b3o2bobo$16bobobob2o$14bo5bo$15b2obobo$16bob2o$14bo$14b2o!

Easy!

Code: Select all

x = 35, y = 35, rule = B3/S23
4bo4bo$2b2ob4ob2o$4bo4bo14b2o$24bo$22bobo$18b2o2b2o$18b2o$2b3o4b3o$6o
2b6o$2b3o4b3o3b2o$15b2o6bo$19bo3bo$18bo4b2o$17bob4o$16b2o4bo4bo$17bo4b
o2b3o$18bo6bobo$19bo4b3o3$27b2o$16b2o9bo$17bo2bo2bo4b3o$14b3o6bo6b3o$
14bo4bo4bo8bo$19b2ob2obo4b2o2bo$25b2o2bo2b2o$26bo3b2o$26bo5bobo$26b2ob
obob2o$27bo3bo$26b2obobo$27bob2o$25bo$25b2o!

Failed reduction to it:

Code: Select all

x = 28, y = 29, rule = B3/S23
4bo4bo$2b2ob4ob2o$4bo4bo14b2o$24bo$22bobo$18b2o2b2o$18b2o$2b3o4b3o$6o
2b6o$2b3o4b3o3b2o$15b2o6bo$19bo3bo$18bo4b2o$17bob4o$16b2o4bo4bo$17bo4b
o2b3o$18bo6bobo$19bo4b3o3$8b2o$7bobo7bo7b2o$7bo8bobo6b2o$6b2o4b2obobo
$11bobobobobo$11bo4bob2o$12b3obo$14bobo$15bo!

[Para]

*snip*
Failed reduction to it:

Code: Select all

x = 28, y = 29, rule = B3/S23
4bo4bo$2b2ob4ob2o$4bo4bo14b2o$24bo$22bobo$18b2o2b2o$18b2o$2b3o4b3o$6o
2b6o$2b3o4b3o3b2o$15b2o6bo$19bo3bo$18bo4b2o$17bob4o$16b2o4bo4bo$17bo4b
o2b3o$18bo6bobo$19bo4b3o3$8b2o$7bobo7bo7b2o$7bo8bobo6b2o$6b2o4b2obobo
$11bobobobobo$11bo4bob2o$12b3obo$14bobo$15bo!

On the other hand, the perturber does complete this one:

Code: Select all

x = 64, y = 65, rule = B3/S23
13$38bo$37bobo$35b3obo$34bo4bob2o$34bobobobobo$29bo5b2obobo$29b3o7bobo
$32bo7bo$31bo$30bo$30b2o3b2o$34b2o10b3o$36bob3o4b5o$39b2o3b2o2b2o$31b
2o10b2o$8b2o22bo11b4o$9bo2b2o18bobo10b3o$9bobobo3bo15b2o4b2o5bo$10bo6b
3o19bo$20bo18b2obo2bo$6b2o11bo20bobobobo$5bo2bo10bo3bo17bo2bob2o$5bob
2o14bo23bo$4b2o16bo17bo5b2o4b2o$3bo3b2o30b3o10bobo$4b3o2bo4b3o22b4o11b
o$7b2obo2bo3bo4bo19b2o10b2o$6bo2bo2bo5bo4b2o5b3o4b2o2b2o3b2o$6b2o4bo5b
o3b2o5bo3bo3b5o4b3obo$12bo5bo3bobo3bo5bo3b3o10b2o$13bo3bo5b2o3bo5bo15b
2o3b2o$14b3o5b2o4bo5bo21bo$24bo4bo3bo2b2o17bo$30b3o3bobo7bo7bo$38bo6bo
bo7b3o$24bo13b2o6bobob2o5bo$23bo20bobobobobo$23bo3bo16b2obo4bo$27bo19b
ob3o$26bo20bobo$27b3o7bo10bo$29bo5bobo$36b2o6$45bo$46bo$44b3o!

[BokaBB]

...
And that`s for the four sets of repeaters!
And why four sets of repeaters don`t have a name

I decide to name the common sets of 4 as they're so common that it's non-sense for them being unnamed.

Code: Select all

x = 98, y = 30, rule = B3/S23
30bo26b2o$4bo24bobo25b2o$4bo24bobo63bo$4bo25bo12b2o50b2o$14b3o9b2o5b2o
7bo2bo12b2o17b2o17b2o$3o3b3o5bobo8bo2bo3bo2bo7b3o12b2o17b2o18bo$14b3o
9b2o5b2o$4bo25bo$4bo24bobo46b2o$4bo24bobo46b2o$30bo7$57b2o$57b2o$4b2o
23b2o$3bobo22bo2bo$3b2o23bobo11bo36bo$b2o12b3o8b2obo3bo9bo18b2o15bobo
$obo5b2o5bo2bo6bo2bo3bobo6bo2bo9b2o6b2o7b2o6b2o$2o5bobo5bo2bo6bobo3bo
2bo5b3o11b2o14bobo$7b2o7b3o7bo3bob2o7bo30bo$5b2o22bobo$4bobo21bo2bo$4b
2o23b2o28b2o$59b2o!

1. Target (4 repeaters)
2. Puff bomb (4 puffs, as you expect)
3. Rectangles I (4 squares)
4. Wall (4 bricks)
5. Pan (4 steaks)
6. Rectangles II (4 squares, again)

A repeater (Cyclic in real life) is called frying pan. Ya sure ya want to name that pattern pan?
Besides the 2 pairs of steaks that touch in there are actually a single pattern each, not just 2 steaks. To my understanding we haven't named that pattern yet. I have no will to play this game, so I'll let ya do so.

[b-engine]

A repeater (Cyclic in real life) is called frying pan. Ya sure ya want to name that pattern pan?
Besides the 2 pairs of steaks that touch in there are actually a single pattern each, not just 2 steaks. To my understanding we haven't named that pattern yet. I have no will to play this game, so I'll let ya do so.

I know. The repeater has "frying" in it's name, while the common set doesn't.
On the other hand, I think that 2 pairs of steak is named beef.

[Para]

A repeater (Cyclic in real life) is called frying pan. Ya sure ya want to name that pattern pan?
Besides the 2 pairs of steaks that touch in there are actually a single pattern each, not just 2 steaks. To my understanding we haven't named that pattern yet. I have no will to play this game, so I'll let ya do so.

I know. The repeater has "frying" in it's name, while the common set doesn't.
On the other hand, I think that 2 pairs of steak is named beef.

No. It's named burger. I think bluemanofgrapes said something about making a mover out of them at some point.

EDIT: A p9 SPARK emitter found using a combination of lk050807's eater program and customperturb:

Code: Select all

x = 18, y = 10, rule = B3/S23
8b2o2$4b2o6b2o$7b4o$3bobo6bobo$b3obobo2bobob3o$o3b2ob4ob2o3bo$b2o3bo4b
o3b2o$3b2o2bo2bo2b2o$3bob2o4b2obo!

[HerscheltheHerschel]

I wanna call the new p5 repeater "octacircle".

[Para]

I wanna call the new p5 repeater "octacircle".

Sure.

A P50 repeater using it:

Code: Select all

x = 60, y = 22, rule = B3/S23
6bo2bo$5bob2obo$6bo2bo$6bo2bo$5bob2obo$6bo2bo$58b2o$12b3o39b3o2bo$2o
43b3o9b2o$o2b3o4bo5bo20bo15bo$b2o7bo5bo5bo12b2ob2o3bo5bo3bo$6bo3bo5bo
3b2ob2o12bo5bo5bo7b2o$6bo15bo20bo5bo4b3o2bo$b2o9b3o43b2o$o2b3o39b3o$2o
$50bo2bo$49bob2obo$50bo2bo$50bo2bo$49bob2obo$50bo2bo!

Another ssrc result:

Code: Select all

x = 7, y = 7, rule = B3/S23
2b2o$3bobo$o5bo$2o3bo2$bobo$2bo!

[hotcrystal0]

A five-ant AT for an unnamed still life:

Code: Select all

x = 25, y = 21, rule = B3/S23
22bo$22bobo$22b2o6$21bo$21bobo$13bo7b2o$14b2o$13b2o5$2o$b2o3b2o$o6b2o
$6bo!

[HerscheltheHerschel]

A five-ant AT for an unnamed still life:

Code: Select all

x = 25, y = 21, rule = B3/S23
22bo$22bobo$22b2o6$21bo$21bobo$13bo7b2o$14b2o$13b2o5$2o$b2o3b2o$o6b2o
$6bo!

I will call that still life "cis bed and tie".
Here is square and bed:

Code: Select all

x = 4, y = 5, rule = B3/S23
2b2o$2b2o2$4o$o2bo!

[hotcrystal0]

A five-ant AT for an unnamed still life

I will call that still life "cis bed and tie".
Here is block and bed:

Code: Select all

x = 4, y = 5, rule = B3/S23
2b2o$2b2o2$4o$o2bo!

Can this be called “bunk bed” then?

Code: Select all

x = 4, y = 5, rule = B3/S23
o2bo$4o2$4o$o2bo!

[HerscheltheHerschel]

A five-ant AT for an unnamed still life

I will call that still life "cis bed and tie".
Here is block and bed:

Code: Select all

x = 4, y = 5, rule = B3/S23
2b2o$2b2o2$4o$o2bo!

Can this be called “bunk bed” then?

Code: Select all

x = 4, y = 5, rule = B3/S23
o2bo$4o2$4o$o2bo!

Yes.

[HerscheltheHerschel]

found new infinite growth:

Code: Select all

x = 29, y = 28, rule = B3/S23
18bo$b3o8bo5bo$o3bo6bo7bo$b2o9b4o2b2o$3b2ob2o9b3o$5b2o11bobo$19bo7b2o
$19bo7b2o11$7b2o$7b2o7$15b2o$15b2o!

some eaters:

Code: Select all

x = 16, y = 16, rule = B3/S23
14bo$13bo$13b3o2$9b2o$4b2o2bo2bo$bo2bo4bobo$obobo5bo$bo2bob2o$4bo2bo$
5bo4bo$6b5o2$8bo$7bobo$8bo!

Code: Select all

x = 11, y = 11, rule = B3/S23
9bo$8bo$8b3o2$3bob2o$b3ob2o$o$b3ob2o$3bobo$3bobo$4bo!

found using my new perturber search program:
FRPS1-0.zip [Download (5.5 MB)]
and my infinite growth search program which I used to find my new infinite growth:
CPS1-0.zip [Download (5.5 MB)]

[hotcrystal0]

Using customperturb, I found this weird perturber that can eat a square:

Code: Select all

x = 13, y = 11, rule = B3/S23
4b2o$4b2o$11b2o$6b2obo2bo$5bobob3o$2o3bobo$o2bobob3o$b4obo3bo$6bo2b2o
$3bobo$3b2o!

Edit: while experimenting with it, I found this weird period-14 repeater consisting of two copies “munching on” each other:

Code: Select all

x = 13, y = 18, rule = B3/S23
8b2o$7bobo$2b2o2bo$2bo3bob4o$3b3obobo2bo$7bo3b2o$b3obobo$o2bo2bo$2o2b
2o$11b2o$6b2obo2bo$5bobob3o$2o3bobo$o2bobob3o$b4obo3bo$6bo2b2o$3bobo$
3b2o!

[Para]

found new infinite growth:

Code: Select all

x = 29, y = 28, rule = B3/S23
18bo$b3o8bo5bo$o3bo6bo7bo$b2o9b4o2b2o$3b2ob2o9b3o$5b2o11bobo$19bo7b2o
$19bo7b2o11$7b2o$7b2o7$15b2o$15b2o!

some eaters:

Code: Select all

x = 16, y = 16, rule = B3/S23
14bo$13bo$13b3o2$9b2o$4b2o2bo2bo$bo2bo4bobo$obobo5bo$bo2bob2o$4bo2bo$
5bo4bo$6b5o2$8bo$7bobo$8bo!

Code: Select all

x = 11, y = 11, rule = B3/S23
9bo$8bo$8b3o2$3bob2o$b3ob2o$o$b3ob2o$3bobo$3bobo$4bo!

found using my new perturber search program:
FRPS1-0.zip [Download (5.5 MB)]
and my infinite growth search program which I used to find my new infinite growth:
CPS1-0.zip [Download (5.5 MB)]

All are known, discovered around the early search program period (and ssrc immedately found the linear growth anyways). Can you please explain what makes your search program take up so much memory, as well as its methodology?