Thread for basic questions

[dvgrn]

Assume I have three integers (any programming language) a, b, and c, where they represent in base 2 three rows of one generation, how do you calculate the evolution of b to the next generation?

Do you want this for Conway's Life rules only, or for some larger rulespace? Here's one possible B3/S23-only bit-twiddling implementation, with some leads for optimizing it further if you read the project notes.

[testitemqlstudop]

What's L1, L2, and L3 in the code?

( I presume the result is in X2? )

[googoIpIex]

What is preventing us from making a p51 queztal?

[wildmyron]

What's L1, L2, and L3 in the code?

( I presume the result is in X2? )

They are your a, b, and c. And yes, the result is in X2.

[googoIpIex]

is there a weld so that a HR64H could be appended directly to a syringe while using a 7x9 eater to remove the FNG on the inside of the HR64H?

[dvgrn]

is there a weld so that a HR64H could be appended directly to a syringe while using a 7x9 eater to remove the FNG on the inside of the HR64H?

I don't know of any such weld -- there's very little room on the inside there, and most of the syringe catalyst en that corner doesn't seem to be alterable without destroying its current glider-absorbing function.

One suppression for the R64 output Herschel's FNG that can be made to work is an appended dependent conduit -- not sure if that's any good for your purposes:

Code: Select all

x = 54, y = 54, rule = LifeHistory
38.2A$37.B2A2B3.2A$4.C33.4B2.B2AB$5.C28.B.6B3.2B$3.3CB25.10B2.2B$4.4B
10.A13.11B2A2B$5.4B7.3A12.12B2A3B.B$6.4B5.A15.18B2A$7.4B4.2A15.15B.B
2A$2A6.9B14.15B3.B$.A7.6B14.17B$.A.2A5.6B3.B2.2B2.19B$2.A2.A4.19BD15B
$3.2AB3.20BDBD4B.7B$4.14B2A9B3D4B2.6B$5.13B2A11BD4B2.7B$6.29B4.6B$6.
17B.B.2B10.6B$7.15B4.3B10.5B$7.15B5.A2B.2A6.6B$8.13B5.A.A2B.A6.6B$10.
13B2.A.AB2.A7.7B$9.8B4.2A.A.A3.A8.2B3D2B$9.6B6.2ABA2.4A.A5.3BD4B$9.5B
8.B2.A.A3.A.A4.2B3D3B$9.B.B9.2A.2A2.A2.A.A3.8B$10.3B9.A.A2.2A3.A5.2B
2A3B$9.B2AB9.A.A13.2B2A5B$10.2A11.A10.13B$32.16B$32.17B$32.16B$32.15B
$33.13B$33.12B$29.B.14B$28.17B$26.20B$25.21B$25.21B$27.19B$29.18B$27.
20B$25.A.2AB.17B$23.3AB2AB.18B$22.A4.B3.4B2.7B2.4B$23.3A.2A2.3B5.3B5.
4B$25.A.A2.AB8.3B5.4B$28.3AB7.4B6.4B$33.A4.B2A2B7.4B$30.4A5.2A10.3B$
30.A21.2B$31.A21.B$30.2A!

[testitemqlstudop]

What is preventing us from making a p51 queztal?

I think the repeat time for most Herschel conduits are above 53. Maybe I'm wrong

[Hunting]

Where to find the apgsearch "soup interesting score"?

[Ian07]

Where to find the apgsearch "soup interesting score"?

I already answered this earlier in this very thread: viewtopic.php?p=71191#p71191

[Moosey]

What's a scorbie splitter?

[dvgrn]

What's a scorbie splitter?

A Scorbie splitter is the particularly small and efficient G-to-2G that Scorbie suggested combining with a Snark to make a 180-degree reflector for a Hashlife-friendly Demonoid:

Code: Select all

x = 63, y = 31, rule = LifeHistory
21.4B$20.4B$14.B4.4B16.A11.2A$13.3B2.4B16.A.A9.B2AB$5.2A5.9B17.A.A9.
3B$6.A4.9B12.2A2.3A.2A9.B.B$6.A.AB.8B13.A2.A4.B8.5B$7.2AB.9B3.4B2.BA.
A3.3AB2A6.6B$9.11B2.5B2.B2A6.A.2A4.8B$9.11B2.8B10.13B$B8.21B12.13B$2B
8.19B12.15B$3B6.19B2.B10.15B$4B3.26B5.B.17B$.4B.51B$2.4B.21B2A13B2A
13B$3.25B2A13B2A14B$4.50B3.B2A$5.48B4.A2.A$4.33B2.2B2.B3.6B5.2A.A$4.
16B2.7B2.4B13.6B7.A$4.16B3.6B17.9B6.2A$5.14B5.3B19.2A4.4B$8.9B.3B4.B
21.A5.4B$8.8B3.2A23.3A7.4B$9.4B6.A24.A10.4B$11.4B5.3A33.4B$13.2A7.A
34.4B$13.A44.B3A$14.3A42.A$16.A43.A!

[googoIpIex]

What's a scorbie splitter?

A Scorbie splitter is the particularly small and efficient G-to-2G that Scorbie suggested combining with a Snark to make a 180-degree reflector for a Hashlife-friendly Demonoid:

Code: Select all

x = 63, y = 31, rule = LifeHistory
21.4B$20.4B$14.B4.4B16.A11.2A$13.3B2.4B16.A.A9.B2AB$5.2A5.9B17.A.A9.
3B$6.A4.9B12.2A2.3A.2A9.B.B$6.A.AB.8B13.A2.A4.B8.5B$7.2AB.9B3.4B2.BA.
A3.3AB2A6.6B$9.11B2.5B2.B2A6.A.2A4.8B$9.11B2.8B10.13B$B8.21B12.13B$2B
8.19B12.15B$3B6.19B2.B10.15B$4B3.26B5.B.17B$.4B.51B$2.4B.21B2A13B2A
13B$3.25B2A13B2A14B$4.50B3.B2A$5.48B4.A2.A$4.33B2.2B2.B3.6B5.2A.A$4.
16B2.7B2.4B13.6B7.A$4.16B3.6B17.9B6.2A$5.14B5.3B19.2A4.4B$8.9B.3B4.B
21.A5.4B$8.8B3.2A23.3A7.4B$9.4B6.A24.A10.4B$11.4B5.3A33.4B$13.2A7.A
34.4B$13.A44.B3A$14.3A42.A$16.A43.A!

Is anyone going to bother making this?

[calcyman]

What's a scorbie splitter?

A Scorbie splitter is the particularly small and efficient G-to-2G that Scorbie suggested combining with a Snark to make a 180-degree reflector for a Hashlife-friendly Demonoid:

Code: Select all

x = 63, y = 31, rule = LifeHistory
21.4B$20.4B$14.B4.4B16.A11.2A$13.3B2.4B16.A.A9.B2AB$5.2A5.9B17.A.A9.
3B$6.A4.9B12.2A2.3A.2A9.B.B$6.A.AB.8B13.A2.A4.B8.5B$7.2AB.9B3.4B2.BA.
A3.3AB2A6.6B$9.11B2.5B2.B2A6.A.2A4.8B$9.11B2.8B10.13B$B8.21B12.13B$2B
8.19B12.15B$3B6.19B2.B10.15B$4B3.26B5.B.17B$.4B.51B$2.4B.21B2A13B2A
13B$3.25B2A13B2A14B$4.50B3.B2A$5.48B4.A2.A$4.33B2.2B2.B3.6B5.2A.A$4.
16B2.7B2.4B13.6B7.A$4.16B3.6B17.9B6.2A$5.14B5.3B19.2A4.4B$8.9B.3B4.B
21.A5.4B$8.8B3.2A23.3A7.4B$9.4B6.A24.A10.4B$11.4B5.3A33.4B$13.2A7.A
34.4B$13.A44.B3A$14.3A42.A$16.A43.A!

Is anyone going to bother making this?

Here's one Dave prepared earlier: viewtopic.php?p=60370#p64321

[dvgrn]

Here's one Dave prepared earlier: viewtopic.php?p=60370#p64321

The Look-How-Clever-I-Am version of Scorbie's Demonoid from a week later is a lot more fun, actually. It runs a lot faster in Golly, you can get it to run away on almost any modern computer (if you set the step size to something above 8^5 = 2^15) -- and you can copy and paste the macrocell file straight into Golly out of the code box in the posting.

[Hdjensofjfnen]

Are there an infinite number of patterns:
1) that are gardens of Eden?
2) whose cheapest predecessor contains more cells than the pattern itself, not counting gardens of Eden?

[fluffykitty]

1) A GoE and any number of copies of the still life from random.rle
2) An arbitrary number of sufficiently isolated dot sparks

[Hunting]

Not actually a question, but a stupid thing.

Run a pattern in the rule B1/S for 1 generation, and find the population before running and the population after running.

So,

1. For every specific after population, find the minimal before population. What's the sequence of the minimal before population? 1, 2, 3, 4, 5 is impossible to reach, so starting from 6, the sequence is 2, 3, 1, 3, 2, 3, 2, 3, 2, GAP, 3, 3, 3. I didn't found anything evolves into a population-15 pattern, so there's a gap.

2. Why there's many pattern evolving into a 10-pop, 14-pop, 16-pop?

[calcyman]

1. For every specific after population, find the minimal before population. What's the sequence of the minimal before population? 1, 2, 3, 4, 5 is impossible to reach, so starting from 6, the sequence is 2, 3, 1, 3, 2, 3, 2, 3, 2, GAP, 3, 3, 3. I didn't found anything evolves into a population-15 pattern, so there's a gap.

Can't you take the disjoint union of whatever your solution is for population 7 and population 8?

[Hunting]

1. For every specific after population, find the minimal before population. What's the sequence of the minimal before population? 1, 2, 3, 4, 5 is impossible to reach, so starting from 6, the sequence is 2, 3, 1, 3, 2, 3, 2, 3, 2, GAP, 3, 3, 3. I didn't found anything evolves into a population-15 pattern, so there's a gap.

Can't you take the disjoint union of whatever your solution is for population 7 and population 8?

Oh, sorry, I forgot to add one more rule that I assumed.

Pattern must be non-trivial, which means, they must interact in 1G.

[fluffykitty]

All integers greater than or equal to 4 are possible. To add 2 to the population, place a block such that one of the cells that would be born in generation 1 overlaps one of the cells that would be born in g1 of the original pattern, and such that the block does not interfere with the rest of the pattern. You can also add 4 or 6 by using a domino or a domino or dot (which is used for odd numbers ≥15 below).

Code: Select all

x = 123, y = 5, rule = B1/S
2o7b2o5b2o6b2o6bo7b2o6bobo5bo7bo7bobo5bo7bo8bo6bo7bo7bo$2o6bobo14bo16b
o15bo7bo32bo$8b3o47bo15bo7bo7bo5bo9bo7bo7bo$90bo21bo$89bo14b2o14bobo!

[dani]

What is the smallest synthesis that:

a) doesn't die out
b) when gliders are shot at it to synthesize itself, it eats the gliders

?

[googoIpIex]

I seem to recall reading somewhere about a “way to make arbitrary c/2 spaceships.”

Is this real, and if so where can I read it?

[dvgrn]

I seem to recall reading somewhere about a “way to make arbitrary c/2 spaceships.”

Is this real, and if so where can I read it?

Meaning a c/2 spaceship grammar, maybe? See for example David Bell's Spaceships in Conway's Life articles. Part 2 contains the following c/2 grammar:

Code: Select all

Within a few hours of finding the first period 2 ship, Dean had discovered
a grammar for constructing an infinite number of different short, wide,
period 2 spaceships.  A grammar is an "alphabet" of "components", along
with rules for the possible sequences of connections between components.
Components are simply the identifiable pieces of a ship which reappear over
and over in different ships in different combinations.  There are three
components in the above spaceship, as will be seen below.

The complete grammar describes the components, the allowed sequences of the
components, and the manner in which the components are joined together.
The following are the components of Dean's first grammar.

    [A]          [A']        [B]      [B']       [C]       [C']
 .....O.O      .......O       X         X        X           X
 ....O..O      ....OOOO      ...      .O..      .....      .O...
 ...OO...      ....OO..      OOO      .O.O      OOO..      .O.O.
 ..O.....      ..O.....      OO.      O...      OO...      O....
 .OOOO...      ..OOOO..      OOO      .O.O      OO...      O...O
 O....O..      .O......      ...      .O..      OOOOO      .O..O
 O..O....      OOO..O..       X         X       ..O..      .O.O.
 O..O....      .OOO....                          X          X
 .O......      ..O.....
 ..OOOO.O      ...OOO.O
 ...O...O      ...O..OO
 ....O...      ....OOO.
 ....O.O.      ......O.
     X              X

 [D]      [D']        [E]       [E']        [F]      [F']
  X         X          X           X         X        X
 ...      .O..      ...O.O      ....O      ...O      .O.O
 OOO      .O.O      ..O..O      ..OOO      .OOO      O..O
 OO.      O...      ..O...      .OOO.      OOO.      O...
 OO.      O...      .O..O.      O..O.      .OOO      O..O
 OOO      .O.O      OOO...      O....      ...O      .O.O
 ...      .O..      .OOO..      O..O.        X        X
  X         X       ...O..      .O.O.
                      X          X


   [G]        [G']
  X            X
 .O.O..      ...O...
 O..O..      .OOO...
 O.....      OOO....
 O.....      .OO....
 .O..OO      ..OO..O
 ..OOOO      ...OO.O
 ......      .......
 ..OOOO      ...OO.O
 .O..OO      ..OO..O
 O.....      .OO....
 O.....      OOO....
 O..O..      .OOO...
 .O.O..      ...O...
  X            X

The components occur in pairs identified by the same letter, but with or
without a quote mark (e.g., A and A').  Such pairs are related in that they
are the two phases of the same section of a period 2 spaceship.  So that,
for example, if a period 2 spaceship contains component B in generation 0,
then in generation 1 it must contain component B' in the same position
within the ship.
...

[dvgrn]

What is the smallest synthesis that:

a) doesn't die out
b) when gliders are shot at it to synthesize itself, it eats the gliders

?

Yikes, this is a tough one. It's easy to build an example, like a single-channel construction of an integral aligned with the construction lane:

Code: Select all

x = 38, y = 14, rule = B3/S23
bo25bo$2bo25bo$3o23b3o2$3b2o$3bo$4b3o$7bo$6b2o3$10b2o24b2o$9b2o24b2o$
11bo25bo!

Some other object will turn out to have an enormously smaller synthesis, but I have no idea what it is. Two eater2s at right angles, maybe, to absorb a couple of identical "quadruple-channel salvos" that build those eater2s starting from an initial symmetrical collision? Quadruple-channel is a huge space, so it doesn't seem too unlikely that there's an eater2 not too far out in the search tree.

Or is there something much simpler than that, even -- a four-directional symmetric recipe that maybe makes clever use of kickbacks to build eaters on all lanes that have incoming gliders?

[dani]

I think of something like this 5G:

Code: Select all

x = 34, y = 22, rule = B3/S23
32bo$31bo$31b3o4$18bo4bo$19b2obo$18b2o2b3o2$8b2o$7bobo$7bo$6b2o2$5bo$
5b2o$4bobo2$bo$b2o$obo!