I performed the following searches using C version of CopperSearch:
Those are searches for wide and short ships, and Copperhead have a quite different shape for example. I don't know what shapes are more likely for a high-period ship (assuming all small low-period ships have been found by other means now), but there are many other search areas that could be tried.
Alexey_Nigin wrote:The output files were 500KB, 2MB, and 200KB, respectively. It seems that they contain nothing interesting, although I can't be sure. At least they don't contain the word "spaceship". They primarily consist of tumblers, pentadecathlons + p2, and fumaroles + p2.
I think that the filtering of oscillators should be far more strict. I suggest that periods 1-6,8,10,14-15,30 are declared boring, and all other periods are declared interesting.
The amount of output is a problem, I'm considering ways to solve that.
Until then, a suggestion is to sort the resulting output file, to make it easier to scan for unexpected periods.
HartmutHolzwart wrote:why would you exclude p10 amd p15 as "uninteresting? Wouldn't you rather exclude oscillators instead?
As Alexey_Nigin stated above, this refers only to oscillators, and the reason is a lot of different variants of the same basic oscillator gets reported, like these:
Code: Select all
x = 69, y = 15, rule = LifeHistory
To make it feasable to analyse the results manually, we filter some of the most common periods.
Just looking at the period of the end result is a pretty straight-forward idea to implement in a search program, but if we need to start analysing what the different objects in a result is, it gets more complicated.
It might still be worth the trouble to do this, of course...
Alexey_Nigin wrote:(simeks, does your program output p2 and p3 spaceships?).
It does. It would also make sense to check for any P4 spaceship where the displacement not one of (2,0) or (1,1), but it doesn't do that yet.
I'm not sure what (in the field) is a part
By part, we just mean a particular part of the search space.
For example if the complete search is expected to take 32 hours to run of a single core, then part 5/32 means the patterns that would be tested in the fifth hour of a full search.
It's just simple way to distribute a large search across the different people in a community (or across different cores on the same computer).