Code: Select all

`x = 314, y = 86, rule = B3/S23`

15$35b2o82b2o82b2o82b2o$35b2o82b2o82b2o82b2o3$109b2o82b2o82b2o$109b2o

82b2o82b2o3$99b2o82b2o82b2o$99b2o82b2o82b2o3$89b2o82b2o82b2o$89b2o82b

2o82b2o3$79b2o82b2o82b2o$79b2o82b2o82b2o3$69b2o82b2o82b2o$69b2o82b2o

82b2o$60bo83bo83bo$60bo83bo83bo$60bo83bo83bo2$50bo83bo83bo$50bo83bo83b

o$50bo83bo83bo2$40bo83bo83bo$40bo83bo83bo$40bo83bo83bo2$30bo83bo83bo$

30bo83bo83bo$30bo83bo83bo!

It is fairly easy to find a forward and backward rake of an appropriate period in Jasons rake collection. Also there are standard two glider collisions that produce blinkers resp. blocks.

But there are a lot of constraints that the gliders and rake engines do not interact with each other.

Is it possible to build a script that finds a solution for this problem?

Thanks in advance,

Hartmut