Apgsearch games

[googoIpIex]

Here’s a strange idea. Every wednesday, I will pick two rules. You can pick One of the two rules, and whichever one has the most objects found by the next wednesday wins!

First two rules
B35/S135 Vs. B36i/S234j

(Both rules are C1 symmetry)

Pick a side, and good luck to both teams!

[Freywa]

This is very much akin to the contests run in more general distributed computing projects. There is one key difference, however: the proposed contest won't achieve any practical goals – not even factoring large numbers or predicting protein folding.

[googoIpIex]

This is very much akin to the contests run in more general distributed computing projects. There is one key difference, however: the proposed contest won't achieve any practical goals – not even factoring large numbers or predicting protein folding.

Im trying to use b3/s23 symmetries when possible

[testitemqlstudop]

Here, 1d Life B3/S23 or rule x3vi.

[Hunting]

AlephAlpha will search B35/S135

[googoIpIex]

B35/S125 is currently winning, with a 5 billion object lead on B236i/S234j.

[dani]

I mean, B35/S135 has a huge advantage already, it had more objects at the start of this week.

[googoIpIex]

it was tied at 38 billion on wednesday.

[77topaz]

This is an intrinsically unbalanced challenge, because B35/S135 is a totalistic rule and thus gets numerous built-in speedups that B36i/S234j does not. As a result, there is a wide difference in the searching speeds: on my computer, the former runs 30k soups/sec/core and the latter 700.

[Hunting]

@googleplex Can you change the rule to "the rule with most object wins"?

[googoIpIex]

@googleplex Can you change the rule to "the rule with most object wins"?

Yes.