Random posts

[MathAndCode]

Mostly in conduit finding, you're fine anywhere else

Ah, thank you for clarifying.
If the part about no one knowing how to program has something to do with my only finding conduits by hand, I should clarify that I am aware of Bellman, but Bellman appears to only work on Windows, I have a Mac, and I don't want to download an emulator because I don't feel like downloading unnecessary things in general, and from what I hear, Bellman searches can take long enough without an emulator, so I am going to follow the principle of comparative advantage.
As for the part about overhauling fifty years of investigation, I think that people overestimate the magnitude of the changes that I want to make. I do not want to get rid of Herschel conduits. I merely do not want to have to put any elementary conduit that I find into a composite Herschel conduit in order for it to be recognized, and I don't like seeing regions that I feel are more conduit-worthy investigated less than regions that are less conduit-worthy. I have no problem with the existence of elementary Herschel conduits or even composite Herschel conduits. In fact, I have used elementary Herschel conduits here, and I have used composite Herschel conduits there and here. In fact, for the latter example, instead of going through all of the elementary conduits and checking to see which emitted gliders in addition to another output object, I just decided to start with a Herschel and reflect its first natural glider even though the former may have allowed a solution (to that particular part of the problem) with a smaller bounding box or other advantage.
Personally, I feel that part of the problem may be that when debating the merits of other active regions, the other user typically bases his/her stance on only the conduits that have already been found, while I also include the partial conduits that I have found that I feel are promising when I take my stance. If this continues to cause contention, I'll probably bite the bullet and start running slow Bellman searches.

the recent Sir Robin "gliderless gun" thing

I think that you're confusing my idea that the twin centuries produced by a twin bees shuttle could be turned into an x66 with something else.

[Hunting]

the part about no one knowing how to program

Really, so you do actually think no one ever figured out to divide a spaceship into multiple parts and construct them seperately?

[MathAndCode]

Really, so you do actually think no one ever figured out to divide a spaceship into multiple parts and construct them seperately?

Since my working on conduits is causing so much contention, most of my effort goes into partials that no one with Bellman tries to complete, and I only understand seven catalysts, I'm going to stop working on conduit research. (I have already deleted the Elementary Conduits Collection from my computer.) Hopefully, that will stop this arguing.

[wwei23]

Yeah, I agree with MathAndCode on the elementary conduit thing. Let's start with the original sixteen Herschel conduits. Okay, now let's break them up into their elementary conduits. Starting from any one of these conduits, it is possible to get an input from any one conduit to any other conduit, through some sequence of intermediate conduits. Now, if we keep adding conduits to this list, we should maintain the condition that it's possible to get from any one conduit to any other conduit through some sequence of conduits. If you can get to at least one conduit in the old list, and you can get to your new conduit from at least one conduit in the old list, then this implies that you can get there from any conduit, and get to any conduit. This set of conditions implies that you will be able to get to a Herschel if you need to, but you don't HAVE to go to a Herschel if it's not needed. I also did the math for eater 2s. For D2_x, there are 542798236792 soups for eater 2s in Catagolue right now, and there are 6990 eater 2s. This implies that there is one eater 2 for approximately 77663539 soups. Not bad, considering I've ran almost six times as many soups for 1x256X2+1, with apgsearch 1.x. Surely, an eater 2's worth a try, isn't it?
EDIT:
https://m.youtube.com/watch?v=7-9wXQpzESo

[Hunting]

B2c3a rules are so unbelievably boring...

Code: Select all

x = 42, y = 33, rule = B2cei3a4j5cinq6ak/S01c2-n3-aiky4aeijkn5ay6c
obobo3bobo3bo2bob2o2bobo3bo3bobo2b3o$3bobob3ob4obobo4b2o3bobobobo2b2ob
o$2o2b3o3bob2ob3o2b4o4b2o3b3o2b2obo$3o3bob2o4b2o2b4obo2b2o6bo4bobo$2ob
6obobob3o6bo5bobobo2b2o2bo$bo2bobo7b2o2b2o2b5obo2b2obob3o$bob6o2b4o2b
2ob4obo2b2o2b2obo$4ob4ob3ob2o2bo2b3obobo5bob2o4bo$3bo6b2obobob2o2bo2b
3obo9bo$2ob5ob3obo2bobobo2bo2b2obo2bo3b5o$b3o4bo2bo2b2o2bobo3b2o2b2o3b
2ob3o$3bo8bob5ob2obob3o2bobobo2b3o$ob3o3b4o2bo2bo2b3ob3ob2ob3o2bob2obo
$2b4o3bobo2bob3o3b7ob3obobobo$4bobob2ob4obobo2bo3b3o2bob2obob3o$4b2o3b
obo2bob2o2bobo3bo6bobo3bo$2o2bo7bo2bo2b4obo2b3o8bo2bo$4bob2o4bo2b3obob
ob2ob2ob3obo2b4obo$obobo4bo6b7o2b3o5bobob4o$3o4b5ob3ob3o6bo3bobob2ob2o
2bo$b4o4b2obo2b2obobo2b4o2b2o2b3o2bo2bo$obobo4b2o3b2obo2b2o2b4ob3o2bo
2bo$obo12b3obo3bob2o2b2ob4ob3o$o4bo4bobo2b2o2bobo2b3ob3o2bo3b2o$2o6bob
ob9o2b2o3b2ob2o5bo2bo$2bo3b2o2b2ob2o4b2o2bobobo2b2o2b2obo$2ob3o3b3ob3o
bo3b5ob2ob2o4b2o2bo$4bo3b2o2bo5bo3bob2ob2o2b2o2bo2bo2bo$o2bob3obobo2bo
b2obob2o2b2o4b9o$obo4b2o2bob2o3bo2bobobo4bob3ob3o$2o4b3o2b2o3b2obobob
2ob3obo2bo2bob2o$3ob2o3bob2o2b2ob4ob3o3bo2bob3o$2b4ob5ob2obo3b3o4bob2o
bob2obobobo!

[Schiaparelliorbust]

B2c3a rules are so unbelievably boring...

Code: Select all

x = 42, y = 33, rule = B2cei3a4j5cinq6ak/S01c2-n3-aiky4aeijkn5ay6c
obobo3bobo3bo2bob2o2bobo3bo3bobo2b3o$3bobob3ob4obobo4b2o3bobobobo2b2ob
o$2o2b3o3bob2ob3o2b4o4b2o3b3o2b2obo$3o3bob2o4b2o2b4obo2b2o6bo4bobo$2ob
6obobob3o6bo5bobobo2b2o2bo$bo2bobo7b2o2b2o2b5obo2b2obob3o$bob6o2b4o2b
2ob4obo2b2o2b2obo$4ob4ob3ob2o2bo2b3obobo5bob2o4bo$3bo6b2obobob2o2bo2b
3obo9bo$2ob5ob3obo2bobobo2bo2b2obo2bo3b5o$b3o4bo2bo2b2o2bobo3b2o2b2o3b
2ob3o$3bo8bob5ob2obob3o2bobobo2b3o$ob3o3b4o2bo2bo2b3ob3ob2ob3o2bob2obo
$2b4o3bobo2bob3o3b7ob3obobobo$4bobob2ob4obobo2bo3b3o2bob2obob3o$4b2o3b
obo2bob2o2bobo3bo6bobo3bo$2o2bo7bo2bo2b4obo2b3o8bo2bo$4bob2o4bo2b3obob
ob2ob2ob3obo2b4obo$obobo4bo6b7o2b3o5bobob4o$3o4b5ob3ob3o6bo3bobob2ob2o
2bo$b4o4b2obo2b2obobo2b4o2b2o2b3o2bo2bo$obobo4b2o3b2obo2b2o2b4ob3o2bo
2bo$obo12b3obo3bob2o2b2ob4ob3o$o4bo4bobo2b2o2bobo2b3ob3o2bo3b2o$2o6bob
ob9o2b2o3b2ob2o5bo2bo$2bo3b2o2b2ob2o4b2o2bobobo2b2o2b2obo$2ob3o3b3ob3o
bo3b5ob2ob2o4b2o2bo$4bo3b2o2bo5bo3bob2ob2o2b2o2bo2bo2bo$o2bob3obobo2bo
b2obob2o2b2o4b9o$obo4b2o2bob2o3bo2bobobo4bob3ob3o$2o4b3o2b2o3b2obobob
2ob3obo2bo2bob2o$3ob2o3bob2o2b2ob4ob3o3bo2bob3o$2b4ob5ob2obo3b3o4bob2o
bob2obobobo!

Are they all like this? What is this rule anyway?

[Hunting]

B2c3a rules are so unbelievably boring...

Code: Select all

x = 42, y = 33, rule = B2cei3a4j5cinq6ak/S01c2-n3-aiky4aeijkn5ay6c
obobo3bobo3bo2bob2o2bobo3bo3bobo2b3o$3bobob3ob4obobo4b2o3bobobobo2b2ob
o$2o2b3o3bob2ob3o2b4o4b2o3b3o2b2obo$3o3bob2o4b2o2b4obo2b2o6bo4bobo$2ob
6obobob3o6bo5bobobo2b2o2bo$bo2bobo7b2o2b2o2b5obo2b2obob3o$bob6o2b4o2b
2ob4obo2b2o2b2obo$4ob4ob3ob2o2bo2b3obobo5bob2o4bo$3bo6b2obobob2o2bo2b
3obo9bo$2ob5ob3obo2bobobo2bo2b2obo2bo3b5o$b3o4bo2bo2b2o2bobo3b2o2b2o3b
2ob3o$3bo8bob5ob2obob3o2bobobo2b3o$ob3o3b4o2bo2bo2b3ob3ob2ob3o2bob2obo
$2b4o3bobo2bob3o3b7ob3obobobo$4bobob2ob4obobo2bo3b3o2bob2obob3o$4b2o3b
obo2bob2o2bobo3bo6bobo3bo$2o2bo7bo2bo2b4obo2b3o8bo2bo$4bob2o4bo2b3obob
ob2ob2ob3obo2b4obo$obobo4bo6b7o2b3o5bobob4o$3o4b5ob3ob3o6bo3bobob2ob2o
2bo$b4o4b2obo2b2obobo2b4o2b2o2b3o2bo2bo$obobo4b2o3b2obo2b2o2b4ob3o2bo
2bo$obo12b3obo3bob2o2b2ob4ob3o$o4bo4bobo2b2o2bobo2b3ob3o2bo3b2o$2o6bob
ob9o2b2o3b2ob2o5bo2bo$2bo3b2o2b2ob2o4b2o2bobobo2b2o2b2obo$2ob3o3b3ob3o
bo3b5ob2ob2o4b2o2bo$4bo3b2o2bo5bo3bob2ob2o2b2o2bo2bo2bo$o2bob3obobo2bo
b2obob2o2b2o4b9o$obo4b2o2bob2o3bo2bobobo4bob3ob3o$2o4b3o2b2o3b2obobob
2ob3obo2bo2bob2o$3ob2o3bob2o2b2ob4ob3o3bo2bob3o$2b4ob5ob2obo3b3o4bob2o
bob2obobobo!

Are they all like this? What is this rule anyway?

This rule is a random LLS result.

Yes, B3a is a very weak diamond-breaking rule. Without B3i it is horrible.

[Hunting]

LeapLife, start from a blinker, one cell at a time, I don't know where else to put this.

Code: Select all

x = 2, y = 1, rule = B2n3/S23-q
3o!
#C [[ PASTET 1 PASTE o! 2 -1 PASTET 2 PASTE o! 2 1 ]]

Code: Select all

x = 2, y = 1, rule = B2n3/S23-q
3o!
#C [[ PASTET 1 PASTE o! 2 2 PASTET 2 PASTE o! 3 1 ]]

[Hunting]

paper->China, bamboo->China again, trade->Silk Road, no spaces after period or comma, Chinese-like mindset. I'm pretty good at identifying Chinese on other sites.

[Schiaparelliorbust]

paper->China, bamboo->China again, trade->Silk Road, no spaces after period or comma, Chinese-like mindset. I'm pretty good at identifying Chinese on other sites.

Yeah,the lack of spaces really does tip you off.

[ColorfulGalaxy]

Sorry, this one might be off-topic for that thread, so I may have to post this in Random Posts.

Code: Select all

x = 19, y = 22, rule = B/S012345678
6bobo$5bobobo$6bobo2$4b7o$4bo5bo$4b2o$5b2o11bo$6b2o10bo$7bo6b3obo$6b2o
6bobo$5b2o7bobobo$4b2o$4bo5bo$4b7o3$11b3o$5b5obobo$3o8bobo$obo2b5obob
o$obo8b3o!

This one is generally considered "infinity", but the last few digits could be "worked out".
For example, the last three digits in decimal could be "314".

[Moosey]

Pattonasnnuc ka'nn Febrartshindjlash

[Schiaparelliorbust]

Pattonasnnuc ka'nn Febrartshindjlash

Is that feleglibleg?

[MathAndCode]

It finally happened. I saw a long boat form and wasn't even remotely surprised. Now, in order to impress me, active regions will have to drop beacons or something rarer.
By the way, I saw a long barge form naturally earlier today (and was impressed).

[Moosey]

Pattonasnnuc ka'nn Febrartshindjlash

Is that feleglibleg?

lobeg

[goldenratio]

The West Indies countries have plagued me for years but it's time for me to finally remember all of them
st kitts and nevis
antigua and barbuda
grenada
dominica
st lucia
barbados
st vincent and the grenadines
trinidad and tobago
checks: YES I got them all

other isolated small island countries (which are the hardest to remember countries imo):
cape verde
sao tome and principe
maldives
seychelles
mauritius
comoros
palau
solomon islands
vanuatu
fiji
samoa
kiribati
micronesia
marshall islands
tuvalu
nauru
tonga

[Bullet51]

Code: Select all

x = 19, y = 22, rule = B/S012345678
6bobo$5bobobo$6bobo2$4b7o$4bo5bo$4b2o$5b2o11bo$6b2o10bo$7bo6b3obo$6b2o
6bobo$5b2o7bobobo$4b2o$4bo5bo$4b7o3$11b3o$5b5obobo$3o8bobo$obo2b5obob
o$obo8b3o!

This one is generally considered "infinity", but the last few digits could be "worked out".
For example, the last three digits in decimal could be "314".

The terminology for your idea is "p-adic convergence".

[yujh]

Code: Select all

 x = 0, y = 0, rule = B3/S23
3b2o$2bo2bo$2bo$bo$2bo$o3b2o$3o2b2o$8bo$4o$o4bo$2o3b2ob2o!

[wwei23]

Hi, my school put Discord on a custom block list, so...

[Schiaparelliorbust]

Hi, my school put Discord on a custom block list, so...

You're going to school? Where do you live? You don't need to say. Didn't they ever catch you looking at Discord?

[wwei23]

It means that it's blocked for everyone, not just me. And yes, I'm going to school.

[JP21]

It means that it's blocked for everyone, not just me. And yes, I'm going to school.

So you are using the school's internet?

[wwei23]

So you are using the school's internet?

Yes, because I don't have a choice.

[goldenratio]

P7 partial

That has very good fallback.

P7 partial

Code: Select all

rle

EDIT:

Code: Select all

rle

Each has excellent fallback.

Please stop

[wwei23]

Please stop

So, uh, where should I post P7 partials then? I'm already trying to only post the longer ones.