Thread for your truly absurd CA projects

[ndusN]

I'll start with this, and as a demonstration.

-------------------------------------------------------
The B/S01 Project
The aim of this project is to race the Catagolue leaderboard with a completely uninteresting rule - B/S01.
bs01/1x256 is already the top non-b3s23 census as of this xmas, and is tested to be
The Census with the Highest Objects Per Second for Any Given Computing Power.

iddi01 first brought this census to the leaderboard, while i placed it to the current ranking, despite we both are forced to search anonymously due to technical reasons.

Let's continue the project by devoting spare computing power to this census which is so abundant on the dot and domino, and be sure to check the leaderboard frequently so that you get to be the first to post in here the exciting announcement that bs01/1x256 has beaten yet another census!!!

"But i am currently searching a 'good' rule" - Well, did you know that you can search for two different rules at the same time? ; )
And real easy as well: Duplicate your entire folder dedicated to apgsearch, then run recompile.sh in the copy to configure it to bs01/1x256, and start two terminals, one inside each folder.

Then, you can, for example use 3 threads for the "good" rule and 1 for bs01/1x256. Of course, the actual amount is up to you : )
--------------------------------------------------------
Feel free to post more

[ndusN]

It seems that PK22, the current only person in the project who is able to search non-anonymously, has rejoined (he first joined one year ago when iddi01 first brought bs01/1x256 to the leaderboard)

I'll post another here, though i swear i had seen something similar before, maybe just by imagination:

Find the smallest endemic still life
In practice, an endemic still life is a pattern in which every possible 3x3 combination of cells occur at least once.

Best to work with B/S012345678 as the rule, so that you may copy the pattern to https://catagolue.hatsya.com/object to check.

If it doesn't clearly say the pattern is endemic, then the min/max pair of rules given should hint on which distinct 3x3 blocks you're missing.

The "scoring" will be either bounding box or cell count.

My unoptimized entry for a start.

Code: Select all

x = 19, y = 16, rule = B/S012345678
7b4o$4b2o2bo2bo$3b2ob2obobobo$3bo2b3obo2bo$b2o2bo2b3ob3o$2bob3obob6ob
2o$b2o3b9obobo$o3b3obobo3bob2o$2o5b2o3b2obo$2bobobo3bo3b2o$3bo7b2o$2bo
bobobo4b3o$4bob2o2bo4bo$4bob3o3bo2b2o$7b2o2bob2o$12bo!

Bounding box: 19x16 Cell count: 106

Let's see who will be the first to break either record!

edit: I got a private message with this 77-cell solution, discovered 2 years ago by toroidalet. Guess this project is over unless someone beats the record.

Code: Select all

x = 14, y = 16, rule = B/S012345678
5bo$4bo$3b4o$4bobobo2bo$3obobo5bo$obo2bobo2bo2bo$2b3obo5b2o$obob3o4b2o
$ob3ob3ob3o$2b4obo2b2o$2b5ob2o$bobo5bo$obob3ob2o$8b3o$2b2o5bo$2b2o!

[CARuler]

project: get me to be productive