ConwayLife.com

Hunting wrote: ↑

February 16th, 2020, 10:45 am

muzik wrote: ↑

February 15th, 2020, 6:40 pm

Are b1357s1357, b1357s02468, b02468s1357 and b02468s02468 reversible? I've heard on multiple occasions that they are but given the way large patterns tend to immediately die out at generations 2^n it doesn't seem at all possible for an outer-totalistic rule to generate these patterns from a void.

Because there is B1, there's no pattern that can die out.

muzik wrote: ↑

February 16th, 2020, 10:57 am

Hunting wrote: ↑

February 16th, 2020, 10:45 am

muzik wrote: ↑

February 15th, 2020, 6:40 pm

Are b1357s1357, b1357s02468, b02468s1357 and b02468s02468 reversible? I've heard on multiple occasions that they are but given the way large patterns tend to immediately die out at generations 2^n it doesn't seem at all possible for an outer-totalistic rule to generate these patterns from a void.

Because there is B1, there's no pattern that can die out.

Yes, obviously, but are the rules reversible?

Entity Valkyrie 2 wrote: ↑

April 8th, 2020, 8:25 am

Can anyone please apgsearch the following rule?

Code: Select all

B34t5y7/S23

Entity Valkyrie 2 wrote: ↑

April 8th, 2020, 8:29 am

I neither have the latest version of apgsearch, nor know how to compile, run or use it. I don't know how to use gcc-g++, git or whatever is needed to run it.

yujh wrote: ↑

April 8th, 2020, 9:00 am

Help I can’t get Apgsearch here at all!!!!
I have python 2.7.1,golly 3.2 and nothing else. No twitter or access to Catagolue.

Hunting wrote: ↑

April 8th, 2020, 9:05 am

yujh wrote: ↑

April 8th, 2020, 9:00 am

Help I can’t get Apgsearch here at all!!!!
I have python 2.7.1,golly 3.2 and nothing else. No twitter or access to Catagolue.

Download apgsearch, run it in Golly, what's the problem with this method?

LaundryPizza03 wrote: ↑

April 21st, 2020, 2:44 am

David Eppstein mentions on his website that B3/S45678 contains a small p22 oscillator. Does anyone have any knowledge of this?

x = 40, y = 98, rule = B3/S45678
11b3o12bo8b2o$10bo3bo10b3o7b2o$14bo11bo8b2o$14bo20b2o$12b2o$11bo$10bo$
10bo$10b5o17$11b3o12b2o8b2o$10bo3bo10b4o6b4o$14bo10b4o6b4o$14bo11b2o8b
3o$12b2o$14bo$14bo$10bo3bo$11b3o22$10b5o11b2o$10bo14b4o$10bo15b2o$10bo
$10b4o$14bo$14bo$10bo3bo$11b3o22$2bo4bo5bo14b2o2bo$b2o3b2o4b2o12b6o5bo
$obo2bobo3bobo11b8ob3o$2bo4bo2bo2bo11b12o$2bo4bo2b5o10b14o$2bo4bo5bo
12bob3ob7o$2bo4bo5bo12b3o2bob7o$2bo4bo5bo12bob3ob7o$2bo4bo5bo11b14o$
25b12o$25b8ob3o$26b6o5bo$28b2o2bo!

LaundryPizza03 wrote: ↑

April 21st, 2020, 2:44 am

David Eppstein mentions on his website that B3/S45678 contains a small p22 oscillator. Does anyone have any knowledge of this?

x = 5, y = 6, rule = B3/S45678
bobo$2ob2o$5o$b3o$b3o$2bo!

yujh wrote: ↑

April 21st, 2020, 8:42 am

Can anyone find a c/2 in this rule?(a rule with gliders)(is it possible?)(searching width 75!!!)

Code: Select all

x=0,y=0,rule= B3aijn/S2ae3jnr
!

lemon41625 wrote: ↑

May 21st, 2020, 3:57 am

How do B0 rules work without instanteaous filling up every cell in the plane? I just realised my current definition of naive rules would allow such behaviour (even though my implementation does not).

Golly wrote:Emulating B0 rules

Rules containing B0 are tricky to handle in an unbounded universe because every dead cell becomes alive in the next generation. If the rule doesn't contain Smax (where max is the number of neighbors in the neighborhood: 8 for Moore, 6 for Hexagonal or 4 for Von Neumann) then the "background" cells alternate from all-alive to all-dead, creating a nasty strobing effect. To avoid these problems, Golly emulates rules with B0 in the following way:

A totalistic rule containing B0 and Smax is converted into an equivalent rule (without B0) by inverting the neighbor counts, then using S(max-x) for the B counts and B(max-x) for the S counts. For example, B0123478/S01234678 (AntiLife) is changed to B3/S23 (Life) via these steps: B0123478/S01234678 -> B56/S5 -> B3/S23.

A non-totalistic rule is converted in a similar way. The isotropic letters are inverted and then S(max-x)(letters) is used for B counts and B(max-x)(letters) is used for the S counts. The 4 neighbor letters are swapped using the following table:
4c -> 4e
4e -> 4c
4k -> 4k
4a -> 4a
4i -> 4t
4n -> 4r
4y -> 4j
4q -> 4w
4j -> 4y
4r -> 4n
4t -> 4i
4w -> 4q
4z -> 4z

A totalistic rule containing B0 but not Smax is converted into a pair of rules (both without B0): one is used for the even generations and the other for the odd generations. The rule for even generations uses inverted neighbor counts. The rule for odd generations uses S(max-x) for the B counts and B(max-x) for the S counts. For example, B03/S23 becomes B1245678/S0145678 (even) and B56/S58 (odd).

A non-totalistic rule is converted in a similar way. For even generations invert both B(x)(letter) and S(x)(letter). For odd generations except 4-neighbor letters, use B(x)(letter) if and only if the original rule has S(max-x)(letter) and use S(x)(letter) if and only if the original rule has B(max-x)(letter). For 4-neighbor isotropic letters use the table above. For example, B0124-k/S1c25 becomes B34k5678/S01-c34678 (even) and B367c/S4-k678 (odd).

For a MAP rule B0 is equivalent to the first bit being 1. Smax is equivalent to the 511th bit being 1. For B0 with Smax the rule is converted to NOT(REVERSE(bits)). For B0 without Smax the even rule is NOT(bits) and the odd rule is REVERSE(bits).

In all cases, the replacement rule(s) generate patterns that are equivalent to the requested rule. However, you need to be careful when editing an emulated pattern in a rule that contains B0 but not Smax. If you do a cut or copy then you should only paste into a generation with the same parity.

Saka wrote: ↑

May 8th, 2020, 8:56 am

Is there a known Isotropic Totalistic / Non-Totalistic rule that can be made to explode at a relativistic speed (speeds between c/2 and c) in all directions. By "be made", I mean that it is ok to specify a pattern, but it has to chaotically explode at a relativistic speed forever (Without any c explosions overtaking).
[/code]

#C Glider 2096, 3c/4 diagonal
#C
#C B012345678 S012345678
#C  X-XX X-X-   -XX-XX--
#C
x = 6, y = 3, rule = B02357/S2356
b2o$o2b3o$ob4o!

NoAyeBeardo wrote: ↑

June 30th, 2020, 5:13 am

Which rules are omniperiodic?