# Conway's Siege of Life

They are immortal and they are killing us. We may not be able to kill them, but we might be able to keep them occupied, distracted, for eternity. But we need to figure out how. Before there are no more of us.

In an arena that measures 25 by 25, play Conway's Game of Life with these additional rules:

• Cells outside the arena are always dead.
• The cell at the center of the arena cannot be occupied and is considered always dead.
• You may designate additional cells in the arena that are always dead.
• At the end of an iteration, if there are any live cells in the center 3x3 area (trigger zone), all cells in the center 5x5 area (kill zone) die.

Task: Create an arrangement that represents the start of a time-wise loop (i.e.: returns to its original arrangement after some number of iterations).

Scoring: Total number of cells killed in the trigger zone during the span of one loop times 125,000 divided by the number of iterations in the loop. Highest score wins. (Give your arrangement, the number of iterations in its loop, the number of cells killed that count towards your score for the loop, and your score. I'd also like to hear how you went about conceiving of your arrangement.)

• What use is the 125000? Sep 8, 2017 at 0:28
• @boboquack Sets the naive maximum score at one million. Otherwise, it'd be 8 and it's pretty unlikely anybody would get more than ~2. Sep 8, 2017 at 0:38
• Two is still more than how many bitcoins I have. Sep 8, 2017 at 1:29
• If anyone cares, I made a Processing sketch you can play with for these rules. See the instructions by pressing the i-button at the top. I couldn't come up with a solution yet, though :) Dec 21, 2017 at 22:15
• I’m voting to close this question because open-ended puzzles are off-topic as of May 2019 Oct 29, 2021 at 17:49

EDIT: The sketch's scoring is now fixed. I will keep the answer as it is because I think optimizing for its prior method of scoring is also an interesting question.

The Processing sketch in @R.M.'s comment on the question itself gave me a score of 312500 for this arrangement:

but I calculate its score to be lower — 187500 — as I believe the sketch is counting kills within the larger kill zone that are not within the trigger zone toward the total score, contrary to the question.

What I believe to be the theoretical maximum scores would be 250000 for the what seems to be actual scoring system and 916666.666... for the sketch's scoring system — the maximum number of cells that can ever occupy the trigger zone at once is six, the maximum number of cells that can ever occupy the kill zone at once should be twenty-two, and the minimum period between iterations during which kills occur is 3, as information cannot travel faster than one cell per iteration inward.

Note that this pattern is a variant of the emulator family of oscillators. It has a period of 4, like the others in the family. There are 6 cells killed within the trigger zone and 10 total per cycle. There are no permanently dead cells (other than the central cell) in my answer. I found this using my own intuition and prior knowledge of Conway's Game of Life, not with an automated search. It should be possible to set up an automated search for period 3 configurations that could approach or even meet the maximum scores, but I don't have the time to do so myself.

• Thanks for pointing that out! I have now fixed the scoring system. Apr 3, 2018 at 14:00
• Nice answer. I wish @R.M. would have an anser to upvote on as well. Greate to have somebody putting in the effort for others to enjoy. Without a "testground" the puzzle would be much much less attractive. Apr 12, 2018 at 5:56