The best partial result I have so far is the following (just to illustrate where I want to get):
Code: Select all
x = 179, y = 430, rule = B3/S23
8$26bo$26bo$26bo16$25b3o16$26bo$26bo$26bo16$25b3o16$26bo$26bo$26bo16$
25b3o16$26bo$26bo$26bo16$25b3o136b2o$163b2o$165bo4$152b3o$152bo$153bo
3$142bo$141b2o$141bobo3$26bo$26bo103b2o$26bo103bobo$130bo4$119b2o$118b
2o$120bo4$107b3o$107bo$108bo3$25b3o69bo$96b2o$96bobo4$85b2o$85bobo$85b
o4$74b2o$26bo46b2o$25b3o47bo$24b2ob2o3$62b3o$26bo35bo$24bo3bo34bo$22bo
7bo$22bo7bo$22b2ob3ob2o21bo$51b2o$51bobo2$15b2o4b2o7b2o4b2o$15bobob2o
11b2obobo$18b2o5bobo5b2o$20b2o3bobo3b2o$13bo7b2o7b2o7bo$12b2o6bo4bobo
4bo6b2o$12bo7b2o3bobo3b2o7bo$13bobo8bo3bo8bobo$13bo2bo19bo2bo$14b2o21b
2o3$26bo$26bo$26bo3$25b3o$24bo3bo$24b2ob2o3$17bo17bo$15b3o3b2o7b2o3b3o
$14bo4bo2bo7bo2bo4bo$14bo3bo15bo3bo$14bo5b4o5b4o5bo$15b2o4b2o7b2o4b2o$
17b3o13b3o$18b2o13b2o$19bo3bo5bo3bo2$20bo2bo5bo2bo$21bobo5bobo2$26bo$
26bo$26bo6$26bo$26bo$25bobo$21bo9bo$21bo9bo$19b4ob2ob2ob4o$18b2o4bobob
o4b2o$17bo5bo2bo2bo5bo$18b2o2b3o3b3o2b2o$21bo2bo3bo2bo$21bobo5bobo$21b
obo5bobo4$20bo5bo5bo$18b2obo4bo4bob2o$17b3obo4bo4bob3o$15b2o2b2o11b2o
2b2o10$25b3o$25b3o$24bo3bo$24b2ob2o7$21bobo2bo2bobo$21b2o3bo3b2o$22bo
3bo3bo3$15b3ob2o11b2ob3o$15bobob2o11b2obobo$17bo2b2o9b2o2bo$18b6o5b6o$
12b2o5bo13bo5b2o$11bo2bo4b2o2bo5bo2b2o4bo2bo$11b2obo5b3o7b3o5bob2o$11b
2ob2o21b2ob2o6$25b3o2$25bobo$25bobo$24bo3bo$24bo3bo$24b2ob2o4$22bo7bo$
14bob6obo5bob6obo$12b3ob6o9b6ob3o$14bo2bo2b5o3b5o2bo2bo$14bobo4bobo5bo
bo4bobo$15bo21bo$16b3obo11bob3o$17b3o13b3o6$25b3o13$26bo$25b3o$24b2ob
2o!
To more systematically explore the possibilities, I want to write a Golly Python script that basically should work as follows:
# Search for glider collisions with a 17c/45 pi blinker row
# that produce still lifes farther away than 18 cells from the blinker
# the ultimate goal is to produce a second blinker trail for use
# in an alternative caterpillar design
# the algorithm works as follows:
# 1. read and decode next glider pi collison from an appropriate gencols result file
# 2. store pattern
# 3. run pattern for 270 generations
# 4. test result
# 4.1. pi-blinker row survived?
# If no then go to 1.
# 4.2. Debris nearer to blinker row than 15 cells?
# If yes then go to 1.
# 4.3. Debris farther away from blinker row than 18 cells?
# if yes then store result in the resul file and go to 1.
# 5. insert another pi in the blinker row and go to 2.
So further pies are added to the trail of the blinker row until either the debris gets either too close to the blinker row to be useful or too far away to be modified by another pi from the blinker row. The result file should then contain at least the example above, but hopefully some more results.
To implement this idea, I need a way to extract the current debris from the blinker trail (XOR with the pure blinker trail) and determine the distance to the blinker trail.
How can I tackle this?