Solitaire of Life

[KittyTac]

PTW, I need to participate later (I need to practice welding).

[Gamedziner]

38:

Code: Select all

x = 12, y = 11, rule = LifeHistory
2A$2C3.C$4.C.C$3.C.C$3.C.C.C$.AC3.C.A$A.C.2A2.C$A2.C2.3A.C$.CA2.C3.A.
C$6.C2.A.C$5.CA3.A!

Congratulations, that is one of four optimal solutions.

[77topaz]

Heh, the original solution I'd devised for that was (mostly) symmetrical and had 52 cells; I hadn't expected asymmetrical solutions would be able to be so much smaller.

Code: Select all

x = 12, y = 10, rule = LifeHistory
2C3.C3.2A$.A2.C.C2.A$.A.C.C.A.A$2A.C.C.C.2A$2.C.A.C.A$2.C.A.A.C$2A.C.
A.A.AC$.C.A.C.A.A.C$.A2.A.C2.A.C$2A3.C3.2A!

But now, a sort of reverse-Solitaire question can be asked: what is the smallest "challenge" pattern so that this 52-cell pattern is an optimal solution?

[BlinkerSpawn]

But now, a sort of reverse-Solitaire question can be asked: what is the smallest "challenge" pattern so that this 52-cell pattern is an optimal solution?

This 29-celler might be a good starting point:

Code: Select all

x = 12, y = 10, rule = LifeHistory
2C3.C3.2C$4.C.C$.C7.C$3.C.C.C$2.C3.C$4.C3.C$3.C.C.C$.C7.C$4.C.C4.C$2C
3.C3.2C!

[Sarp]

This 21 seems likely, haven't tested it with a computer yet

Code: Select all

x = 12, y = 10, rule = LifeHistory
AC3.C3.CA$.A2.A.A2.A$.A.C.C.A.A$CA.A.A.C.AC$2.C.C.A.A$2.A.A.C.C$CA.C.
A.A.AC$.A.A.C.C.A.C$.A2.A.A2.A.A$AC3.C3.CA!

[Gamedziner]

This 21 seems likely, haven't tested it with a computer yet

Code: Select all

x = 12, y = 10, rule = LifeHistory
AC3.C3.CA$.A2.A.A2.A$.A.C.C.A.A$CA.A.A.C.AC$2.C.C.A.A$2.A.A.C.C$CA.C.
A.A.AC$.A.A.C.C.A.C$.A2.A.A2.A.A$AC3.C3.CA!

It doesn't work; there are multiple 51-cell solutions.

[Hdjensofjfnen]

I am pretty sure I have found the optimal solution for this, although I'm not sure:

Code: Select all

x = 3, y = 7, rule = LifeHistory
.C$C$.C$C.C$.C$C$.C!

[Hdjensofjfnen]

Hm...

Code: Select all

x = 48, y = 48, rule = LifeHistory
46.CA$45.A.A$44.C$43.A$42.C$41.A$40.C$39.A$38.C$37.A$36.C$35.A$34.C$
33.A$32.C$31.A$30.C$29.A$28.C$27.A$26.C$25.A$24.C$24.2A3$20.CA$19.A.A
$18.C$17.A$16.C$15.A$14.C$13.A$12.C$11.A$10.C$9.A$8.C$7.A$6.C$5.A$4.C
$3.A$2.C$.A$C$2A!

[praosylen]

I am pretty sure I have found the optimal solution for this, although I'm not sure:

Code: Select all

x = 3, y = 7, rule = LifeHistory
.C$C$.C$C.C$.C$C$.C!

15?

Code: Select all

x = 6, y = 8, rule = LifeHistory
5.A$3.C2A$2.C$A2.C$2AC.C$3.C$2.C$2.AC!

Code: Select all

x = 6, y = 7, rule = LifeHistory
3.CA$2.C2.A$A2.C.A$2AC.C$3.C$2.C$2.AC!

[Gamedziner]

15?

Code: Select all

x = 6, y = 8, rule = LifeHistory
5.A$3.C2A$2.C$A2.C$2AC.C$3.C$2.C$2.AC!

Code: Select all

x = 6, y = 7, rule = LifeHistory
3.CA$2.C2.A$A2.C.A$2AC.C$3.C$2.C$2.AC!

I just did a search with WLS and determined that those were the only optimal solutions (excluding reflection).

[Hdjensofjfnen]

Oh, yeah, you win by a whole lot. My solution was 21.

[dvgrn]

This new puzzle is based on a still life that came up in an apgmera search today. Apparently it's a fairly rare still life, since there's only the one soup in Catagolue.

Code: Select all

x = 14, y = 12, rule = LifeHistory
14B$B12.B$B7.C.2C.B$B5.C4.C.B$B2.C4.C4.B$B2.2C.C6.B$B6.C.2C2.B$B4.C4.
C2.B$B.C4.C5.B$B.2C.C7.B$B12.B$14B!
#C Additional
#C information
#C you
#C may
#C not
#C want:
#C the
#C source
#C still
#C life's
#C apgcode
#C starts
#C with
#C "xs34".

With the additional restriction that all added cells have to be strictly inside the blue box, there's a unique solution. Without the blue box JLS finds four more possibilities.

[gmc_nxtman]

[spoiler or something i guess]

Code: Select all

x = 10, y = 10, rule = LifeHistory
4.2A$3.A2.C.2C$4.CA3.C$.C4.C2A$.2CAC$5.CA2C$.2AC4.C$C3.AC$2C.C2.A$4.
2A!

[Sarp]

Missed by less than 30 secs

[dvgrn]

Isn't the solver supposed to keep the game going by supplying a new puzzle? Here's another small and probably easy one, with three minimal-population solutions:

Code: Select all

x = 10, y = 7, rule = LifeHistory
2.C2.C$2.C2.C3.C$C8.C$C4.C$2.2C.C.C$2.C4.C$3.2C!

Adding one more white cell in any of the blue locations would make a puzzle with a unique smallest solution:

Code: Select all

x = 10, y = 7, rule = LifeHistory
2.C2.C$2.C2BC3.C$C3.B4.C$C4.C$2.2C.C.C$2.C4.C$3.2C!

[BlinkerSpawn]

Isn't the solver supposed to keep the game going by supplying a new puzzle?

At some point we kinda stopped doing that, for whatever reason.

31:

Code: Select all

x = 11, y = 8, rule = LifeHistory
4.2A$3.C2.C$3.C2.C2.AC$AC.2A.A.A.C$.C4.C.A$.A.2C.C.C$2A.C2.A.CA$4.2C!

[dvgrn]

31...

Not minimal, but close! The 31-cell solution doesn't have a cell in any of the blue positions...

[Sarp]

30?

Code: Select all

x = 11, y = 8, rule = LifeHistory
4.2A$3.C2.C$3.CBAC2.AC$AC.A.BA.A.C$AC.A2.C.A$3.2C.C.C$3.C2.A.CA$4.2C!

[dvgrn]

30?

Code: Select all

x = 11, y = 8, rule = LifeHistory
4.2A$3.C2.C$3.CBAC2.AC$AC.A.BA.A.C$AC.A2.C.A$3.2C.C.C$3.C2.A.CA$4.2C!

You got it. Somebody else's turn to make a puzzle...

[gmc_nxtman]

Code: Select all

x = 12, y = 8, rule = LifeHistory
5.C$9.C$.C5.2C2.C$.C3.C3.C$C3.2C3.C$.C.C2.C$2.C6.C$4.2C!

[wwei23]

Here is a first attempt at a solution, 79 cells:

Code: Select all

x = 17, y = 17, rule = LifeHistory
2A$A8.2A$2.A.2A3.A2.A$.2A.A5.3A$.A3.A$2.3A.A3.3A$4.A.A2.C2.A$6.A.A.A
2.CA$5.C.A.A.2C2.C$5.C3.C3.C.A$4.CA2.2C.2AC.2A$2.A2.C.C2.C$2.2A2.C.A
2.A.C3A$8.2C2A.A2.A$7.A4.A$8.3A$10.2A!

EDIT: 71

Code: Select all

x = 16, y = 16, rule = LifeHistory
8.2A$2A.2A3.A2.A$.A.A5.3A$A3.A$.3A.A3.3A$3.A.A2.C2.A$5.A.A.A2.CA$4.C.
A.A.2C2.C$4.C3.C3.C.A$3.CA2.2C.2AC.2A$.A2.C.C2.C$.2A2.C.A2.A.C3A$7.2C
2A.A2.A$6.A4.A$7.3A$9.2A!

[BlinkerSpawn]

[56, not 58]:

Code: Select all

x = 16, y = 12, rule = LifeHistory
8.2A$6.C2.A$.A4.2A2.CA2.2A$A.C.2A2.2C2.C2.A$A.CA2.C3.C.2A$.C3.2C.2AC.
A$2.CAC2.C4.A$3.C2.A2.ACA$.A3.2C.2A$.2A3.A$6.A.2A$7.A.A!

Much of the interior is forced by S3 in some form or other.

[gmc_nxtman]

Not minimal.

EDIT: Is it just me, or does this game have conceptual similarities to minesweeper? When the interior is forced like in this particular puzzle, similar inferences have to be made to those made in minesweeper regarding what cells ("mines") are allowed to be where.

[BlinkerSpawn]

EDIT: Is it just me, or does this game have conceptual similarities to minesweeper? When the interior is forced like in this particular puzzle, similar inferences have to be made to those made in minesweeper regarding what cells ("mines") are allowed to be where.

Total agreement there.
Down to 54:

Code: Select all

x = 14, y = 12, rule = LifeHistory
8.2A$6.C2.A$.A4.2A2.CA$A.C.2A2.2C2.C$A.CA2.C3.C.A$.C3.2C.2AC.2A$2.CAC
2.C4.A$3.C2.A2.AC.A$.A3.2C.2A.A$.2A4.A$7.A.2A$8.A.A!

Forcing diagram (red = forced-OFF, yellow = forced-ON):

Code: Select all

x = 14, y = 12, rule = LifeHistory
8.2A$6.C2.A$.A4.2A2DCA$ADCD2A2.2CD.C$ADCE2DC3DC.A$.C3D2CD2AC.2A$.DCEC
2DC4.A$.2DC2DED.AC.A$.A3D2CD2A.A$.2A4.A$7.A.2A$8.A.A!

[gmc_nxtman]

Still not minimal. Also just so you know, this is a valid alternative forcing diagram:

Code: Select all

x = 13, y = 8, rule = LifeHistory
6.C$8.2DC$.DCDAD2.2CD.C$2DC3DC3DC$DCA2D2CD2.C$2DCDC2DC$A2DC6.C$5.2C!