CGOL minesweeper?

[hotdogPi]

Someone should create an application that is Minesweeper except the mines must be a still life or constellation of still lifes. For example, this is solvable already (even if the number of mines isn't given), but only because it's such a small grid:

Code: Select all

x = 25, y = 19, rule = LifeHistory
25F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.
F5.F$25F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F
5.F5.F5.F$25F$F5.F.B.B.F5.F5.F$F5.F.B.B.F5.F5.F$F5.F.3B.F5.F5.F$F5.F
3.B.F5.F5.F$F5.F3.B.F5.F5.F$25F!

For a 10×10 grid, 30 mines might be doable, since there are a lot more restrictions on where mines can be if they have to follow CGOL rules.

I don't know whether it should follow the standard rules or the cruel but fair rules.

[breaker's glider gun]

Someone should create an application that is Minesweeper except the mines must be a still life or constellation of still lifes. For example, this is solvable already (even if the number of mines isn't given), but only because it's such a small grid:

Code: Select all

x = 25, y = 19, rule = LifeHistory
25F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.
F5.F$25F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F5.F5.F5.F$F5.F
5.F5.F5.F$25F$F5.F.B.B.F5.F5.F$F5.F.B.B.F5.F5.F$F5.F.3B.F5.F5.F$F5.F
3.B.F5.F5.F$F5.F3.B.F5.F5.F$25F!

For a 10×10 grid, 30 mines might be doable, since there are a lot more restrictions on where mines can be if they have to follow CGOL rules.

I don't know whether it should follow the standard rules or the cruel but fair rules.

I like the idea! you could also do some thing in which it doesn't have to be a still life, and it runs a generation after you reveal X mines? (Safe squares would change to show the new correct values.)