Code: Select all
x = 12, y = 19, rule = LifeHistory
2.2A3.2A$2.A2.A2.A$4.3A2$2.3A3.2A$A2.A2.A2.A$2A3.3A2$.2D3C3D2C$.C2DC
2DC2DC$.2C3D3C2D2$4.3A3.2A$2.A2.A2.A2.A$2.2A3.3A2$5.3A$3.A2.A2.A$3.2A
3.2A!
Code: Select all
x = 13, y = 6, rule = LifeHistory
2A$A2.2A$2.2A.D2C$5.2CD.2A$8.2A2.A$11.2A!
While pondering, I had another idea of an easy extension that should lead to interesting structures. For any n, can an infinite amount of strict still lifes be made of n-ominoes that do not directly touch eachother? If not, can only one be made? Here's one for n=3 provided by user praosylen on Discord:
Code: Select all
x = 13, y = 39, rule = LifeHistory
5.2A$5.A$7.A.2A$6.2A.A2.A$4.A6.2A$4.2A.2A$2A6.A$A2.A.2A$2.2A.A$7.A.2A
$6.2A.A2.A$4.A6.2A$4.2A.2A$2A6.A$A2.A.2A$2.2A.A$7DCD2C2D$6D2CDC2DC$4D
C6D2C$4D2CD2C4D$2C6DC4D$C2DCD2C6D$2D2CDC7D$7.A.2A$6.2A.A2.A$4.A6.2A$
4.2A.2A$2A6.A$A2.A.2A$2.2A.A$7.A.2A$6.2A.A2.A$4.A6.2A$4.2A.2A$2A6.A$A
2.A.2A$2.2A.A$7.A$6.2A!
Code: Select all
x = 12, y = 2, rule = LifeHistory
2A2.2A4.A$2A3.2A2.3A!
n=6 is very easy. You're given the gift of having access to the table induction coil. Here's one that also uses the long Z hexomino, as well as one that only uses tables:
Code: Select all
x = 50, y = 21, rule = LifeHistory
14.2A32.2A$14.A33.A$11.2A.A30.2A.A$12.A.2A30.A.2A$12.A33.A$11.2A32.2A
$9.A$9.4A25.2D2C.4A$6.C3D2.A25.3DC.A2.A$6.4C28.3DC$3.A2.3DC28.2D2C$3.
4A31.4D$6.A28.2A.4C$3.2A31.A.C2DC$3.A32.A$2A.A31.2A$.A.2A$.A28.2A.4A$
2A29.A.A2.A$31.A$30.2A!
Code: Select all
x = 68, y = 68, rule = LifeHistory
30.2A.2A$31.A.A$31.A.A$30.2A.2A$25.A2.A2.A.A$25.5A5.A2.A$34.5A$25.5A$
26.A2.A4.5A$21.2A.A9.A2.A2.A.2A$22.A.2A13.2A.A$22.A.A15.A.A$21.2A.A
15.A.2A$22.A.2A13.2A.A.DC2DC5D$17.A2.A23.5C5D$17.5A22.10D$44.5C5D$17.
5A22.C2DC2DCD2C$18.A2.A22.5D2CDCD$13.2A.A27.6DCDCD$14.A.2A26.6DCD2C$
14.A.A27.5D2CDCD.A2.A$13.2A.A37.5A$14.A.2A$9.A2.A41.5A$9.5A40.A2.A2.A
.2A$59.2A.A$9.5A46.A.A$10.A2.A46.A.2A$5.2A.A50.2A.A$6.A.2A54.A2.A$6.A
.A54.5A$5.2A.A$A2.A2.A.2A53.5A$5A53.2A.A2.A2.A$59.A.2A$5A54.A.A$A2.A
54.2A.A$5.A.2A50.A.2A$4.2A.A46.A2.A$5.A.A46.5A$5.A.2A$4.2A.A2.A2.A40.
5A$9.5A41.A2.A$50.2A.A$9.5A37.A.2A$9.A2.A2.A.2A32.A.A$14.2A.A32.2A.A$
15.A.A33.A.2A$15.A.2A27.A2.A$14.2A.A2.A2.A22.5A$19.5A$46.5A$19.5A23.A
2.A$19.A2.A2.A.2A13.2A.A$24.2A.A15.A.2A$25.A.A15.A.A$25.A.2A13.2A.A$
24.2A.A2.A2.A9.A.2A$29.5A4.A2.A$38.5A$29.5A$29.A2.A5.5A$34.A.A2.A2.A$
33.2A.2A$34.A.A$34.A.A$33.2A.2A!
I've been stuck on n=8 for a while. It's not too hard to make a repeating unit, but stabilizing that unit is trickier than it looks:
Code: Select all
x = 12, y = 12, rule = LifeHistory
D.D6.2A$.D8.A$D.D7.A$7.2CDA$7.DCDA$7.DCD2A$5.2ADCD$6.ADCD$6.AD2C$6.A$
6.A$6.2A!
Code: Select all
x = 19, y = 9, rule = LifeHistory
2.2A.2A3.2C2D.2A$3.A.A4.C3D.A$A2.A.A2.A.C2DC.A2.A$4A.4A.4C.4A$10.4D$
4A.4A.4C.4A$A2.A.A2.A.C2DC.A2.A$3.A.A4.C3D.A$2.2A.2A3.2C2D.2A!
1) Can every n be solved besides 0, 1, 2, and 5?
2) Does every n have either 0 or infinitely many still lifes?
3) Can n=4 and n=8 be solved?
4) Is there a general solution that can be extended to every n above a specific size? The repeating unit in n=8 can obviously be extended to higher n's.
5) Finally, can we visualize these still lifes in other ways? The analogy that immediately comes to mind is a big puzzle, and every n-omino is its own piece. Births that happen between them can be prevented from working by adding certain ridges to the pieces.