ConwayLife.com

Hooloovoo wrote: Have FPGAs been considered for this type of search? You could easily do one generation per clock cycle at around 200Mhz. This would give about 9 hours to run each of the 2^36 possible 6x6 grids (without canonicalization) for 100 generations if it were completely sequential. Since this problem can be parallelized arbitrarily, many (probably >100) of the evolver units could be placed into the same large FPGA.

• So far, I have only identified one single p7 oscillator on T7 - in contrast, there were several oscillators with period 6 on T6
• This oscillator consists of only one (!) canonical pattern which is shifted by 3 rows each generation - oooh, a 3c pattern, or alternatively even 4c in the other direction

x = 7, y = 7, rule = B3/S23:T7,7
3$7o2$7o$7o!

F_rank wrote:I was wondering whether we can observe oscillators on small tori where at least one generation has a density > 0.5.
My results so far show that there is a 13-cell 'ash pattern' (these include all stages of oscillators) for a 5x5 torus and a 25-cell ash pattern for a 7x7 torus, so the answer is Yes. This leads immediately to the next very similar question: Is there any ash pattern with a density higher than (# of cells / 2) + 0.5?

x = 21, y = 21, rule = B3/S23:T21,21
2o2bob3o2bob3o2bobo$2bobo4bobo4bobo$3obob4obob4obobo2$b4obob4obob4obo$
bo4bobo4bobo4bo$2b3obo2b3obo2b3obo$2o2bob3o2bob3o2bobo$2bobo4bobo4bobo
$3obob4obob4obobo2$b4obob4obob4obo$bo4bobo4bobo4bo$2b3obo2b3obo2b3obo$
2o2bob3o2bob3o2bobo$2bobo4bobo4bobo$3obob4obob4obobo2$b4obob4obob4obo$
bo4bobo4bobo4bo$2b3obo2b3obo2b3obo!

Hunting wrote:STOP SEARCHING! This is just a useless uninteresting spam search. There are many script that can search for agar, so don't do this, anyway.
You can try LifeFind to find agars.

Saka wrote:

Hunting wrote:STOP SEARCHING! This is just a useless uninteresting spam search. There are many script that can search for agar, so don't do this, anyway.
You can try LifeFind to find agars.

chill. Let him do his thing. And I believe they are trying to find the highest density of a stable agar.
Am I correct on that last statement?

F_rank, please don't let that post stop you!

Hunting wrote:STOP SEARCHING! This is just a useless uninteresting spam search. There are many script that can search for agar, so don't do this, anyway.
You can try LifeFind to find agars.

F_rank wrote:my previous hypothesis for an upper limit for the densitiy is completely shattered.

I assume this is the highest ever observed peak density for an oscillating torus pattern, so far.

My new hypothesis is based on the number of cells per row: That the maximum number of cells is (# of rows) x ([cells per row]/2+0.5), as observed in the pattern shown here.

Code: Select all

x = 21, y = 21, rule = B3/S23:T21,21
3b4o3b4o3b4o$3o3b4o3b4o3bo$2b4o3b4o3b4o$2o3b4o3b4o3b2o$b4o3b4o3b4o$o3b
4o3b4o3b3o$4o3b4o3b4o$3b4o3b4o3b4o$3o3b4o3b4o3bo$2b4o3b4o3b4o$2o3b4o3b
4o3b2o$b4o3b4o3b4o$o3b4o3b4o3b3o$4o3b4o3b4o$3b4o3b4o3b4o$3o3b4o3b4o3bo
$2b4o3b4o3b4o$2o3b4o3b4o3b2o$b4o3b4o3b4o$o3b4o3b4o3b3o$4o3b4o3b4o!

x = 7, y = 1, rule = B3/S23:T7-3,1
4o!

for (int x = 1; true; x++) {
    for (int y = 1; y < x; y++) {
        //above for loops are usable for any operation with commutative property
        //such as addition, multiplication, and torus size.
        if (x != y) {
            //now all you need is to avoid enumerating mirror images (flip x, y, both)
            //don’t forget to add shift enumeration while doing pattern simulation
            unflippedTori(x, y);
        }
        else {
            //since the grid is a square, rotating a pattern 90 degrees is possible
            //so put your old square torus search code here, but with shift enumeration.
            isotropicTori(x);
        }
    }
}

Hunting wrote: Ouches.
1. useless
I think "useful" in GoL means can be used in other structure. But how do you use agars to engineer patterns? I doubt that. (It can prove something, so maybe it's useful in math, but useless in GAME of Life.)
2. uninteresting
They are not so fun to watching in Lifeviewer or Golly, so I guess they are "uninteresting".
3. spam
We have plenty of agar searching programs, so I think we don't need to make new programs to do that, right?