Currently have all speeds up to 2c/40, with the exception of 2c/1 (which would require a Larger than Life rule and as such would be extremely difficult to include within a mashup), 2c/32, 2c/33 and 2c/39.

I probably won't be counting the 2c/even speeds (aside from 2c/2 and the ones already in Life) in the mashup, since that would bring the file size up too much, and they can be roughly estimated with the adjustable c/even ships. Also won't be counting 2c/1.

# Oscar is an OSCillation AnalyzeR for use with Golly.# Author: Andrew Trevorrow (andrew@trevorrow.com), March 2006.# Modified to handle B0-and-not-S8 rules, August 2009.

# This script uses Gabriel Nivasch's "keep minima" algorithm.# For each generation, calculate a hash value for the pattern. Keep all of# the record-breaking minimal hashes in a list, with the oldest first.# For example, after 5 generations the saved hash values might be:## 8 12 16 24 25,## If the next hash goes down to 13 then the list can be shortened:## 8 12 13.## When the current hash matches one of the saved hashes, it is highly likely# the pattern is oscillating. By keeping a corresponding list of generation# counts we can calculate the period. We also keep lists of population# counts and bounding boxes; they are used to reduce the chance of spurious# oscillator detection due to hash collisions. The bounding box info also# allows us to detect moving oscillators (spaceships/knightships)import golly as gLENGTH=LENGTH=int(g.getstring("Supply a torus width","72"))RULE="B36/S23"from glife import rect, patternfrom time import timefilename=g.opendialog("Choose Spaceship File")f=open(filename,"a")f.write("----------NEW HAUL----------\n")f.close()g.setrule(RULE+":T"+str(LENGTH)+",1")g.select([-LENGTH/2,0,LENGTH,1])g.randfill(50)# --------------------------------------------------------------------

if hasB0notS8 and (period % 2 > 0) and (pbox == boxlist[pos]): # ignore this hash value because B0-and-not-S8 rules are # emulated by using different rules for odd and even gens, # so it's possible to have identical patterns at gen G and # gen G+p if p is odd return False

wwei23 wrote:That’s the thing about spaceship agars. They loop back to the starting position eventually.

You've just described an oscillator. There is no spaceship, as it can't run without being on a torus and it repeats.

This is how I see it.As an OSCILLATOR, it repeats with period 2016.As an AGAR, it exists on a torus.As a PATTERN, it exists on a torus of width 96.As a SPACESHIP, it moves 2 cells every 42 generations.96 cells divided by 2 cells per shift equals 48 shifts.48 shifts back to the starting point times 42 generations per shift equals 2016, the period as an OSCILLATOR.