Code: Select all
x = 1, y = 4, rule = B2ce3iny5i/S02c
o$o2$o!
Would search, but I'm going to the mall today soon.
Code: Select all
x = 1, y = 4, rule = B2ce3iny5i/S02c
o$o2$o!
Code: Select all
x = 17, y = 10, rule = B3/S23
b2ob2obo5b2o$11b4obo$2bob3o2bo2b3o$bo3b2o4b2o$o2bo2bob2o3b4o$bob2obo5b
o2b2o$2b2o4bobo2b3o$bo3b5ob2obobo$2bo5bob2o$4bob2o2bobobo!
You said you go to bed at 9 but you posted this past 11.Saka wrote:Possibly smallest apgcode for a spaceship? (xq8_b)10soups/secondCode: Select all
x = 1, y = 4, rule = B2ce3iny5i/S02c o$o2$o!
Would search, but I'm going to the mall today soon.
11 AM that iswwei23 wrote: You said you go to bed at 9 but you posted this past 11.
Code: Select all
x = 17, y = 10, rule = B3/S23
b2ob2obo5b2o$11b4obo$2bob3o2bo2b3o$bo3b2o4b2o$o2bo2bob2o3b4o$bob2obo5b
o2b2o$2b2o4bobo2b3o$bo3b5ob2obobo$2bo5bob2o$4bob2o2bobobo!
No, thisSaka wrote:Possibly smallest apgcode for a spaceship? (xq8_b)Code: Select all
ship
Code: Select all
x = 1, y = 4, rule = B2ce3i4t/S02c
o$o2$o!
Code: Select all
x = 16, y = 22, rule = B2cek3ai4t/S02c
15bo3$9b2obo3$15bo5$2obo7bo10$2obo!
Code: Select all
x = 5, y = 2, rule = B2cek3ai4t/S02c
2bo$o3bo!
Code: Select all
x = 26, y = 4, rule = B3-k4j/S23-c
4b3o$4bobo14bo2b2o$4b3o15b3o$3o20bo!
Code: Select all
x = 17, y = 10, rule = B3/S23
b2ob2obo5b2o$11b4obo$2bob3o2bo2b3o$bo3b2o4b2o$o2bo2bob2o3b4o$bob2obo5b
o2b2o$2b2o4bobo2b3o$bo3b5ob2obobo$2bo5bob2o$4bob2o2bobobo!
I'll try and search that soon, the most i found was that twin bees is almost a p122 shuttle:Saka wrote:c/27d and (1,2)c/31 in one rule... but lots of yls (One puffer but shows up a lot)Code: Select all
x = 26, y = 4, rule = B3-k4j/S23-c 4b3o$4bobo14bo2b2o$4b3o15b3o$3o20bo!
Code: Select all
x = 20, y = 29, rule = B3-k4j/S23-c
2o16b2o$2o16b2o9$3b3o$5bo$5bo$4bo2$4bo$5bo$5bo$3b3o9$2o16b2o$2o16b2o!
Just search D4_+1 for christ's sake! Those soups actually generate correctly and I'm pretty sure calcyman's getting extremely tired of this.wwei23 wrote:I managed to get a friend to help me with B3/S23 1x256X2+1, but both our computers are having a little trouble with Calcyman's raised minimum soups per haul. We have only managed to get one haul in. Anyone up for the challenge, and we will not give up. We are going to crack the bottom of the Liszt!
xp15_vtvz757zza9azaiaz06 has ONLY appeared in 1x256X2+1.drc wrote:Just search D4_+1 for christ's sake! Those soups actually generate correctly and I'm pretty sure calcyman's getting extremely tired of this.wwei23 wrote:I managed to get a friend to help me with B3/S23 1x256X2+1, but both our computers are having a little trouble with Calcyman's raised minimum soups per haul. We have only managed to get one haul in. Anyone up for the challenge, and we will not give up. We are going to crack the bottom of the Liszt!
Also, B3-k4j/S23-c hit a breeder ~2k soups in so I'm too scared to search it
Code: Select all
x = 9, y = 5, rule = B2ei3ikr4cj/S01c2-in3cijq4ckqrtz5cejnr6in7
4bo3$2b2ob2o$o2b3o2bo!
Code: Select all
x = 56, y = 10, rule = B2ei3ikr4cj/S01c2-in3cijq4ckqrtz5cejnr6in7
4bo$53b2o$3bo35b2o2b2o2b2o6bo$3b2o34bo3bo3bo4b3o$o3bo46bo$3b2o48bo$3bo
34bo3bo3bo3bo3b2o$55bo$4bo47bob2o$52bo!
Code: Select all
x = 56, y = 12, rule = B2ei3ikr4cj/S01c2-in3cijq4ckqrtz5cejnr6in7
4bo2$3bo$3b2o48b2o$o3bo34b2o2b2o2b2o6bo$3b2o34bo3bo3bo4b3o$3bo47bo$53b
o$4bo33bo3bo3bo3bo3b2o$55bo$52bob2o$52bo!
Stabilized:drc wrote:I'll try and search that soon, the most i found was that twin bees is almost a p122 shuttle:Code: Select all
x = 20, y = 29, rule = B3-k4j/S23-c 2o16b2o$2o16b2o9$3b3o$5bo$5bo$4bo2$4bo$5bo$5bo$3b3o9$2o16b2o$2o16b2o!
Code: Select all
x = 26, y = 39, rule = B3-k4j/S23-c
3bo18bo$2bobo16bobo$2bobo16bobo$b2ob2o14b2ob2o2$b2ob2o14b2ob2o$2bob2o
14b2obo$o24bo$2o22b2o7$6b2o$3b2ob2o$5bo3bobo$10bo2$10bo$5bo3bobo$3b2ob
2o$6b2o7$2o22b2o$o24bo$2bob2o14b2obo$b2ob2o14b2ob2o2$b2ob2o14b2ob2o$2b
obo16bobo$2bobo16bobo$3bo18bo!
If Calcyman's raised the minimum for ONLY this pseudo-symmetry, then maybe he's trying to tell you something -- and maybe you should listen. (Keep in mind that running Catagolue isn't free, either.)wwei23 wrote:10000000 and just for 1x256X2+1.
Nitpick -- 1x256 soups are necessarily D2-symmetric, so their ash is semi-natural at best.muzik wrote:Can we get more people searching b026s1 on 1x256? I have a gut feeling that the 2c/8 and 2c/16 might be capable of appearing from soup naturally.
Code: Select all
x = 27, y = 7, rule = B/S3-a
3bo$2b3o7b3o7b3o$bo3bo5bobobo5bobobo$2o3b2o3b2o3b2o3b2o3b2o$bo3bo5bo3b
o5bobobo$2b3o7b3o7b3o$3bo9bo!
Code: Select all
x = 14, y = 14, rule = R7,C0,M1,S65..112,B64..89,NM
5b2o$4b5o$3b8o$2b11o$b13o$3o4b7o$2o6b6o$2o6b6o$2o5b7o$b2o3b8o$b12o$2b
10o$3b6o$5b3o!
I don't really think it's a good idea to apgsearch rules with no birth conditions, but by all means go ahead.wwei23 wrote:B/S3-a, I've turned up empty-handed. But still lives exist in this rule, they really do. So, who will get the first still life?
Code: Select all
x = 32, y = 7, rule = B3-c4i/S1c2-ck34a
15bo5bo$16b2o4bo4bo$15b2o3b3o5bo$2o$ob2o25b2o$ob2o27bo$2o27b3o!
I favour Alexey's suggestion of a 'better place to put this':wwei23 wrote:Can't think of a better place to put this, so here we go:
Also, that quantity of decimal places is misleading. There have been 10^13 soups, thereabouts, in b3s23/C1, so you can only realistically include 7 accurate decimal places (cf. Monte Carlo approximation) even in the idealised scenario where that person didn't ruin the statistics by claiming 2 trillion objects in a single day. The best statistics you can get are probably from this backup:Alexey Nigin wrote:After all, one can just post it to /dev/null with the same effect, except for conserved bandwidth.
Code: Select all
x = 17, y = 10, rule = B3/S23
b2ob2obo5b2o$11b4obo$2bob3o2bo2b3o$bo3b2o4b2o$o2bo2bob2o3b4o$bob2obo5b
o2b2o$2b2o4bobo2b3o$bo3b5ob2obobo$2bo5bob2o$4bob2o2bobobo!