ConwayLife.com - A community for Conway's Game of Life and related cellular automata
Home  •  LifeWiki  •  Forums  •  Download Golly

Enumerating Still Lifes (in C)

For scripts to aid with computation or simulation in cellular automata.

Re: Enumerating Still Lifes (in C)

Postby hkoenig » September 30th, 2017, 2:44 pm

Over the past few weeks I've been updating my Life object data files. Going through several years of posting here and updating the oscillator and spaceship discoveries. I've put together SOF files of Still Life objects up to 28 bits. Here's the resulting file size (including indexing metadata) in megabytes:

22 -- 32
23 -- 82
24 -- 210
25 -- 537
26 -- 1380
27 -- 3520
28 -- 8920

Total size for all SOF file, including oscillators and spaceships, is around 28Gig. That doesn't include the raw results for the pseudo-objects, which haven't been processed. And not sure if I can handle sorting the 25Gig of 29 bit files, which are still being generated.

As others have said, RLE format is not the right way to present object lists such as these. I've written display apps and command line tools that allow for the display, conversion, normalizing, sorting, and searching of all those files. Eventually, I'd like to set up a SQLite database which includes all the Glider constructions.

(The database has both SOF and a modified apgcode --there's the bit encoding to the right of the underscore, while putting size/period/speed info on the left. (e.g. LWSS = 9P4H2V0_6frc Pulsar = 48P3_co9nas0san9oczgoldlo0oldlogz1047210127401) )

The object directories, including the RLE files and the index thumbnails, shown on pentadecathlon.com are generated by the server from the SOF files. It's not that hard to do.
hkoenig
 
Posts: 92
Joined: June 20th, 2009, 11:40 am

Re: Enumerating Still Lifes (in C)

Postby Majestas32 » June 27th, 2018, 1:16 am

Is there any hope of such a script supporting non totalistic rules?
Please, stop spam searching Snowflakes.
User avatar
Majestas32
 
Posts: 524
Joined: November 20th, 2017, 12:22 pm
Location: 'Merica

Re: Enumerating Still Lifes (in C)

Postby Nathaniel » April 5th, 2019, 12:50 pm

33-bit still life counts:

Strict: 14223867298
Pseudo: 15851861075

Pseudo still life results of interest include:
- Gabriel Nivasch's 34-bit Quad pseudo still life is minimal (i.e., there is no 33-bit pseudo still life that can be partitioned into 4 stable pieces, but not 2 or 3).
- There are exactly 11 33-bit pseudo still lifes that can be partitioned into 3 stable pieces, but not 2. They are displayed here:

Code: Select all
x = 80, y = 39, rule = B3/S23
57bo$4b2ob2o13bo33bobo16bo$4b2obobo11bobob2o11bobob2o12bo2bo9b2obobobo
$9bo9b3ob2obo9b3ob2obo8b2ob2o3bo9bob2o2bo$3bob2o2b2o7bo16bo16bo8bo7bo
6b2o$b3ob2o3bo8bob2ob2o10bob2ob2o10bob2o5bo6b2ob2o4bo$o8bo8b2ob2obo10b
2ob2obobo8b2ob2o2b3o8bob2o2b2o$2o6bo16bo16bo9bo6bo9bo6bo$2bob2obo9bob
2ob3o9bob2ob3o11b3obobo10b3obobo$2b2ob2o10b2obobo11b2obobo15bob2o13bob
2o7$5b2o16bo15b2o17bo16bo$2obo2bo10bob2obobo9bob2o2bo11b2obobobo9bob2o
bobo$bob2o2b2o8b2ob2o2bo9b2ob2o2b2o10bob2o2bo9b2ob2o2bo$o8bo14b2o17bo
8bo6b3o14b3o$2ob2o4bo7b2ob2o4bo7b2ob2o4bo8b2ob2o5bo6b2ob2o5bo$bob2o2b
2o9bob2o2b2o9bob2o2b2o10bob2o4bo8bob2o4bo$o6bo9bo6bo9bo6bo10bo7bo8bo7b
o$b3obobo10b3obobo10b3obobo11b3obobo10b3obobo$3bob2o13bob2o13bob2o14bo
b2o13bob2o6$41b2o$36b2obo2bo$36bob2obo$41b2o$36bob2o$34b3ob2ob2o$33bo
7bo$34b3ob2obo$36bobobo!


The results for each of the 100 subsets of the search space for 33 bits are attached to this post. The last remaining open question that I can think of is whether or not Nivasch's 34-bit quad pseudo still life is unique (or if there exist other such 34-bitters).
Attachments
33bit_counts.zip
(30.77 KiB) Downloaded 104 times
User avatar
Nathaniel
Site Admin
 
Posts: 453
Joined: December 10th, 2008, 3:48 pm
Location: New Brunswick, Canada

Re: Enumerating Still Lifes (in C)

Postby mniemiec » April 5th, 2019, 3:02 pm

Nathaniel wrote:33-bit still life counts: ... There are exactly 11 33-bit pseudo still lifes that can be partitioned into 3 stable pieces, but not 2. They are displayed here: ...

Excellent! I assume that the 32-bit three-partition pseudo-still-life is unique?
mniemiec
 
Posts: 1028
Joined: June 1st, 2013, 12:00 am

Re: Enumerating Still Lifes (in C)

Postby dvgrn » April 5th, 2019, 3:29 pm

mniemiec wrote:
Nathaniel wrote:33-bit still life counts: ... There are exactly 11 33-bit pseudo still lifes that can be partitioned into 3 stable pieces, but not 2. They are displayed here: ...

Excellent! I assume that the 32-bit three-partition pseudo-still-life is unique?

That result was reported with Nathaniel's 32-bit still life count a couple of years ago.
User avatar
dvgrn
Moderator
 
Posts: 5717
Joined: May 17th, 2009, 11:00 pm
Location: Madison, WI

Re: Enumerating Still Lifes (in C)

Postby googoIpIex » April 5th, 2019, 4:02 pm

How long did the search take?
woomy on a vroomy
googoIpIex
 
Posts: 253
Joined: February 28th, 2019, 4:49 pm
Location: Sqrt(-1)

Re: Enumerating Still Lifes (in C)

Postby Nathaniel » April 5th, 2019, 5:23 pm

googoIpIex wrote:How long did the search take?


The 33-bit search took about 250 CPU days, which means we're looking at roughly 625 or so CPU days for a 34-bit search.
User avatar
Nathaniel
Site Admin
 
Posts: 453
Joined: December 10th, 2008, 3:48 pm
Location: New Brunswick, Canada

Previous

Return to Scripts

Who is online

Users browsing this forum: No registered users and 3 guests