toroidalet wrote:Challenge: Find a pattern that doesn't die out in R6,C0,M1,S34..58,B34..45,NM, which I am terming "Bugs but I literally changed the range to 6 and it's still miraculously stable."
Code: Select all
x = 9, y = 9, rule = R6,C0,M1,S34..58,B34..45,NM
9o$9o$9o$9o$9o$9o$9o$9o$9o!
that rule does not work in golly.Saka wrote:83bismuth38 wrote:is a c/1 knightship possible?Code: Select all
x = 11, y = 19, rule = R5,C4,M0,S83..98,B10..108,NN:T1000,1000 $4.C$5.CB$5.2CBA$5.2C2BA$5.2C2B2A$5.2C2B2A$5.2C2B2A$5.2C2B2A$4.3C2B2A $4.2C3B2A$3.3C2B3A$2.3C3B2A$.3C3B3A$2.C3B3A$4.B3A$6.A!
Found with gfind:drc wrote:Challenge: Find a spaceship in B2c3-ej/S23
It should be possible, although it's probably very slow and hard to find.
Code: Select all
x = 29, y = 14, rule = B2c3-ej/S23
14bobo$13bobo$6bo7bobo$5bob2ob2obobo$4bobobobobobo$3bobob2o2bobo12bobo
$2bo4b4obo12bobo$bo3bob2obo15bobo$ob2o5bobo13bobo$bo5b2obo13bobo$2bobo
4bo11b3obo$2b3obobo10b2obobo$3bobobo9bo2bobo$6bo10b3obo!The modification needed for the rule to work is very easy, and I assume you can do it. Please don't be too lazy...83bismuth38 wrote:that rule does not work in golly.Saka wrote:Code: Select all
x = 11, y = 19, rule = R5,C4,M0,S83..98,B10..108,NN:T1000,1000 $4.C$5.CB$5.2CBA$5.2C2BA$5.2C2B2A$5.2C2B2A$5.2C2B2A$5.2C2B2A$4.3C2B2A $4.2C3B2A$3.3C2B3A$2.3C3B2A$.3C3B3A$2.C3B3A$4.B3A$6.A!
Code: Select all
x = 10, y = 10, rule = R6,C0,M1,S34..56,B33..45,NM
5b2o$4b3o$3b5o$4o3b3o$b4o2b3o$2b4ob2o$3b5o$4b3o$5b2o$6bo!
BBILCTRT6&ISMS isn't 6,34,56,33,45, it's 6,34,45,34,58, at least that's what I thought.toroidalet wrote:It turns out that Bugs but I literally changed the range to 6 and it's still miraculously stable has a c/3 diagonal ship:Challenge: Find a spaceship made of smaller spaceships made of smaller spaceships.Code: Select all
x = 10, y = 10, rule = R6,C0,M1,S34..56,B33..45,NM 5b2o$4b3o$3b5o$4o3b3o$b4o2b3o$2b4ob2o$3b5o$4b3o$5b2o$6bo!
Another challenge: Find a nontrivial spaceship where 2 appropriately-timed copies may pass through each other.
I think I know what you mean, but even if this doesn't count --gameoflifemaniac wrote:Find a unstable pattern that is not a oscillator and remains the same population for as long as possible.
Code: Select all
x = 7, y = 3, rule = B3/S23
3o2b2o$o4b2o$bo!
#C [[ THUMBNAIL THUMBSIZE 2 ]]Code: Select all
x = 1000004, y = 1000004, rule = B3/S23
2o$o1000000$1000001b3o$1000001bo$1000002bo!I meant finitely long as possible.dvgrn wrote:I think I know what you mean, but even if this doesn't count --gameoflifemaniac wrote:Find a unstable pattern that is not a oscillator and remains the same population for as long as possible.
-- you haven't really excluded boring things like a glider aimed at something painfully far away:Code: Select all
x = 7, y = 3, rule = B3/S23
3o2b2o$o4b2o$bo!
#C [[ THUMBNAIL THUMBSIZE 2 ]]
Code: Select all
x = 1000004, y = 1000004, rule = B3/S23 2o$o1000000$1000001b3o$1000001bo$1000002bo!
The second pattern dvgrn submitted (the one I have quoted) goes for a finite amount of time.gameoflifemaniac wrote:I meant finitely long as possible.dvgrn wrote:-- you haven't really excluded boring things like a glider aimed at something painfully far away:
Code: Select all
x = 1000004, y = 1000004, rule = B3/S23 2o$o1000000$1000001b3o$1000001bo$1000002bo!
Darn. I guess you win now... unless I can somehow think of a number bigger than a million.BlinkerSpawn wrote:The second pattern dvgrn submitted (the one I have quoted) goes for a finite amount of time.
(And it maintains population 1 generation longer if you use an appropriately-placed blinker instead)
The limit for how long it takes is ∞.gameoflifemaniac wrote:I meant finitely long as possible.dvgrn wrote:-- you haven't really excluded boring things like a glider aimed at something painfully far away:
Code: Select all
x = 1000004, y = 1000004, rule = B3/S23 2o$o1000000$1000001b3o$1000001bo$1000002bo!
Code: Select all
(for z = lim(z) as z->∞)
x = (z)+4, y = (z)+4, rule = B3/S23
2o$o(z)$(z+1)b3o$(z+1)bo$(z+2)bo!WHAT DID YOU DO WRONG?! I CAN'T FIGURE IT OUT FOR THE LIFE (no pun intended) OF ME!!!Saka wrote:The modification needed for the rule to work is very easy, and I assume you can do it. Please don't be too lazy...83bismuth38 wrote:that rule does not work in golly.Saka wrote:Code: Select all
x = 11, y = 19, rule = R5,C4,M0,S83..98,B10..108,NN:T1000,1000 $4.C$5.CB$5.2CBA$5.2C2BA$5.2C2B2A$5.2C2B2A$5.2C2B2A$5.2C2B2A$4.3C2B2A $4.2C3B2A$3.3C2B3A$2.3C3B2A$.3C3B3A$2.C3B3A$4.B3A$6.A!
Here's a hint: how many neighboring cells does the range-5 von Neumann neighborhood contain?83bismuth38 wrote:WHAT DID YOU DO WRONG?! I CAN'T FIGURE IT OUT FOR THE LIFE (no pun intended) OF ME!!!Saka wrote:R5,C4,M0,S83..98,B10..108,NN:T1000,1000
ok:Apple Bottom wrote:Here's a hint: how many neighboring cells does the range-5 von Neumann neighborhood contain?83bismuth38 wrote:WHAT DID YOU DO WRONG?! I CAN'T FIGURE IT OUT FOR THE LIFE (no pun intended) OF ME!!!Saka wrote:R5,C4,M0,S83..98,B10..108,NN:T1000,1000
Code: Select all
x = 20, y = 9, rule = R5,C4,M0,S61..61,B10..61,NN:T1000,1000
4.11A$3.15A$2.A11B5A$2.15B3A$.B11C5B2A$.15C3B$C11.5C2B$15.3C$16.2C!
This is a simple copy/paste from 25 different RLE files within two clicks of Mark Niemiec's main Life page, producing about a 20K RLE file with 2435 objects in it (if I've done all the math right).gameoflifemaniac wrote:Can somebody show me all still lives up to 15 bits in one RLE, please?
Ooh, I know this one! A year ago simeks came up with the basis for a slow salvo to stretch a ship. These days you can just figure out how to clean up the leftover junk from either of those reactions to get a block at a decent distance, and feed either of those two initial constellations into slmake (with a ship or a long boat instead of a long long ship as the base object to be extended).drc wrote:Challenge: Create the largest object possible (and/or prove that infinitely many objects are synthesizable) using only 1 glider per step and a 2-glider base. All collisions must settle before the next collision can begin.
Code: Select all
x = 216, y = 213, rule = LifeHistory
52.C$2C49.C.C$C.C49.C.C$.2C50.2C5$7.C52.2C$7.C51.C2.C$7.C52.C.C$55.2C
4.C$55.2C3$61.2C$61.2C2$11.2A$11.A.A$11.A3$80.2A$80.A.A$80.A21$35.2A$
34.2A$36.A17$66.3A$66.A$67.A29$83.2A$82.2A$84.A17$112.2A$111.2A$113.A
19$143.2A$143.A.A$143.A23$167.2A$166.2A$168.A47$213.2A$213.A.A$213.A!Code: Select all
x = 7, y = 4, rule = B3/S23
3bo$4o2bo$o$4b2o!
Code: Select all
x = 6, y = 5, rule = B3/S23
bo$bo$5bo$2b2obo$3o!
Code: Select all
x = 5, y = 6, rule = B3/S23
2bo$3o$obo$3b2o2$2bo!
Code: Select all
x = 8, y = 10, rule = B3/S23
5bo$2o2bobo$o3bobo$b3obo$3bo$4bo$2bob3o$bobo3bo$bobo2b2o$2bo!
Code: Select all
x = 30, y = 10, rule = B3/S23
5bo11bo10bo$2o2bobo5b2o2bobo4b2o2bobo$o3bobo5bo3bobo4bo3bobo$b3obo7b3o
bo6b3obo$3bo11bo10bo$5bo10bo9bo$3bob3o6bob3o5bob3o$2bobo3bo4bobo3bo3bo
bo3bo$2bobo2b2o4bobo2b2o3bobo2b2o$3bo10bo9bo!
A 9x9 square is a p8 oscillator:toroidalet wrote:Challenge: Find a pattern that doesn't die out in R6,C0,M1,S34..58,B34..45,NM, which I am terming "Bugs but I literally changed the range to 6 and it's still miraculously stable."
Code: Select all
x = 9, y = 9, rule = R6,C0,M1,S34..58,B34..45,NM
9o$9o$9o$9o$9o$9o$9o$9o$9o!
Code: Select all
x = 11, y = 9, rule = R6,C0,M1,S34..58,B34..45,NM
3b5o$2b7o$b2o4b3o$3o5b3o$3o5b3o$3o5b3o$b4o3b2o$2b7o$3b5o!
LLS actually gives several smaller patterns than the one you've given.BlinkerSpawn wrote:You could probably solve this easily with LLS but please don't
Code: Select all
x = 32, y = 24, rule = B3/S23
5b2o10b2o10b2o$4bobo9bobo9bobo$3bo11bo11bo$2bob2o8bob2o8bob2o$bobo2bo
6bobo2bo6bobo2bo$o2bobo7bo2bobo7bo2bobo$b2obo9b2obo9b2obo$3bo12bo12bo$
obo10bobo10bobo$2o11b2o11b2o5$3b2obo8b2obo8b2obo$3bob2o8bob2o8bob2o2$
4b3o9b3o9b3o$3bo2bo8bo2bo8bo2bo$o2bo9bo2bo9bo2bo$3o10b3o10b3o2$2obo9b
2obo9b2obo$ob2o9bob2o9bob2o!