I am once again impressed with the speed of your program! 11 days for a width-23 symmetric search to that depth seems incredibly fast! Since you hadn't given an update on the forums in almost a year and a half, I thought you might have dropped this project. I am relieved to see that you have been working on it all this time.
I am struck by the addition of "scripts to find weekender and
spaghetti monster". Spaghetti monster is difficult to find even if you know it's there. I am wondering how much of the spaghetti monster structure you start with in order to find the complete ship, and how quickly does it find it?
Also,
your post in the sandbox would have been better suited for the spaceship discussion thread. It is always helpful to see long, new partial results for high-period searches.
Edit: Please answer the following questions in
this thread in the scripts forum. When I get a reply, I will also move some of the above posts from here to there.
mscibing wrote: ↑December 30th, 2019, 10:11 pm
For "--starts" of 0,2,3,1,6,0,1,2,4,1 the first 5 rows in the search would be:
Code: Select all
3...
.... ^
.5.. | time
.2.. |
....
..4.
..1. <-- head tail -->
And then the pattern will repeat one cell towards the tail and one generation in the past, wrapping around with the period:
Code: Select all
36..
.8.. ^
.5.. | time
.2a. |
..7.
..4.
..19 <-- head tail -->
I'm not sure how to read your diagrams. Here is a guess:
Each point in the grid is a single complete row (in a single phase) of the partial spaceship. A row at a grid point evolves into the row at the grid point directly above it (so row 1 evolves into row 4). When you try to advance a row in the last phase, you go back to the first phase, but shift towards the tail by the number of cells forward each period (2 cells forward, so row 3 evolves into row 1).
mscibing wrote: ↑December 30th, 2019, 10:11 pm
Starts like the following would also work okay with my program (I'm not sure this is true of gfind), but would probably result in a slower search than the previous pattern:
Code: Select all
....
.... ^
..5. | time
..4. |
..3.
..2.
..1. <-- head tail -->
So would the next two iterations through the starts look like this?
Code: Select all
.6...
..... ^
..5.. | time
..4a. |
..39.
..28.
..17. <-- head tail -->
Code: Select all
.6c..
..b.. ^
..5.. | time
..4a. |
..39f
..28e
..17d <-- head tail -->
And a 3c/7 search might look like this ("--starts" of 0,3, 2,2, 4,1, 6,0)?
Code: Select all
45....
.89... ^
.3c... | time
..7... |
..2b..
...6..
...1a. <-- head tail -->
Will different starts still essentially cover the same search space? What advantage do you see to one choice of starts over another?
Edit 2: Oh, I forgot something: congratulations!