ConwayLife.com

KennyFromSouthPark wrote: ↑

Yesterday, 8:44 am

I nominate the Y.A.Y.! bubble to be found here:

viewtopic.php?f=2&t=4244#p87082

The post clearly states that it was found in 2020, so it is ineligible for this contest. Please restrict discussion to eligible and serious nominees.

If you have enough memory then it's faster to run single threaded searches in parallel. This is true. I figured that most people would not have the available memory to run more than one search. I certainly don't, but my computer is getting rather old. I should note that only the deepening portion o...

How fast is it and what are it's strong points--is it better at finding lower- or higher-period ships, for instance? I haven't tested it myself, but I'll try to give what perspective I've gathered from other people's tests. Ultimately, I think this search is faster than just about all others for mo...

I considered increasing the lookahead cache. After mentioning this idea on Discord, Pavgran looked into testing this idea but found the relevant code is disabled in qfind-c8 and it's not a simple matter to re-enable it. Is there a possibility of increasing the efficiency of this search with that me...

The nomination time ended a little while ago. I think we should give ourselves a few days to finalize the pattern descriptions before starting the competition.

I worked carefully through the output printing code and found a few issues that could be the source of crashes. I have updated the zip file in the first post to fix these problems. Please update to the latest version. None of the problems had anything to do with the actual search. All saved dump fil...

Some of these finish faster than my earlier minimum time estimate of 4 hours with 7 threads. piece0001 finished in 1.5 hours. If you are running these overnight, you may want to write a script that starts the next search after the previous one finishes. I don't have any example scripts; it's just a ...

piece0167 completed successfully with that version. To clarify, did you restart piece0167 from the beginning using the new version? I'll be honest, I didn't expect that to work. However, I don't think the small change I made could make things worse, so I put it in the zip file. I recommend that eve...

@John Goodman
Try it with this code for qfind-c8.cpp:

Edit: deleted; see zip file for current version.

I don't think this will fix it, but I have to go, so I don't have anything else I can try at the moment. Test it again with piece0167.

Seems to have fixed things -- I'm up to dump0167-0018 without a crash. EDIT: Spoke too soon. At dump0167-0032, another crash: qfind-c8(24862,0x7000033c5000) malloc: Incorrect checksum for freed object 0x7fec06400140: probably modified after being freed. Corrupt value: 0x0 qfind-c8(24862,0x7000033c5...

I'm not sure what to compare to. The only programs that are reasonable for comparison are zfind and qfind . To simulate the choice of seedcolumn=3 you could set initial rows in qfind. Unfortunately, that option is broken in zfind. For qfind you could save initrows.txt with the following contents: ....

I've made an update to the code in the zip file in the first post that I hope will fix this bug. For those of you who were experiencing the crash, please test this new version with piece0167. This piece is smaller than the others, so it should run fairly quickly. If you get to dump0167-0010 without ...

when I ran it (used piece0043) I got: qfind-c8(24278,0x700041b4000) malloc: *** error for object 0x7fb9e54000a0: pointer being freed was not allocated I got a crash on 64bit Ubuntu Linux running piece0167: ... *** Error in `./qfind-c8': double free or corruption (!prev): 0x00007f38e8000bb0 ***\ ......

Andrew J. Wade's new program is making other spaceship searchers obsolete in many respects, but here's something that might still be reasonable to finish with qfind. I am trying to complete the (1,0)c/8 width-19 symmetric spaceship search with qfind. I did a preliminary search a while back, but real...

Bullet51 wrote: ↑

January 13th, 2020, 12:04 am

p4 partial

I assume you mean that it's a partial with strict volatility equal to 1. How did you find it?

I was seeing how the search would handle a repeating component and whether I could tell from the statistics that only the repeating component was remaining in the search, when it found a different spaceship. This one was found after about 12 hours total runtime: x = 19, y = 56, rule = B3/S23 9bo$2b...

Here is a reduction to Hartmut Holzwart's c/5 waveguide (with original on right): x = 187, y = 79, rule = B3/S23 14b2o3b2o8b2o3b2o8b2o3b2o8b2o3b2o8b2o3b2o8b2o3b2o8b2o3b2o8b2o3b2o8b2o 3b2o8b2o3b2o8b2o3b2o$6bo6b2obobob2o6b2obobob2o6b2obobob2o6b2obobob2o6b 2obobob2o6b2obobob2o6b2obobob2o6b2obobob2o6b2o...

I've added a simplified version of qfind to the repository called qfind-s that is slightly faster but only allows gcd(period,offset) = 1. The period, offset, and width must also be changed in the code before compiling. That is, change the lines that read #define PERIOD 5 #define OFFSET 1 #define WID...

AforAmpere wrote: ↑

January 9th, 2020, 9:40 pm

3c/8 odd width 12 was negative with LSSS.

About how long did the search take? Are you running the width-25 3c/8 gutter search?

To be clear, these are pseudo-period rakes. It isn't clear for me. Are their periods p160 and p80 or not ? The period is 320 in both cases. You can check this by placing an extra fireship to delete the outgoing glider stream and running the pattern through oscar.lua. The period of a rake is the min...

GilGil wrote: ↑

January 7th, 2020, 5:45 pm

c10p160 rake ... c10p80 rake

To be clear, these are pseudo-period rakes. At lower periods it looks like one of the kickback gliders would crash into the outgoing stream, so some more complicated kickback would have to be used to get the p40 pseudo-period rake.

How difficult would it be to start a a search based on a partial result? If you had, say 2 rows in every phase from the middle of a partial result, could those be forced in as the starting rows for your program (rather than starting from empty rows, as it currently is)?

Here's one of the easy ones, xs19_0kc3pczc9521, in 11 gliders from its only soup: x = 175, y = 93, rule = B3/S23 128bo$127bo$127b3o10$173bo$172bo$172b3o2$170bo$169bobo$169bobo$170bo3$ 166b2o$166bobo$169bo$167b2obo$167bo2bo$168bob2o$71bobo93b2o2bo$71b2o 96bo$72bo96b2o2$70bo26bo$68bobo25bo$69b2o25b3o5...

For the 1-of-each collection it is my opinion that the most exemplary oscillator should be given, assuming it's not too large. I would try my best to avoid LCM oscillators, as they are unsatisfying to the casual observer (the p39 LCM oscillator should probably be kept due to size). I propose that pe...

Need help here. Is there any way to make the constellation on the left, which is a precursor to the p14 honey farm hassler on the right? I can't find any viable way to reduce it. Even constructing the eater 2s last runs into difficulties. x = 67, y = 28, rule = B3/S23 47bo$47b3o$17bo32bo10bo$16bobo...