PUZZLE #3931: Game of Life Cipher (diff 1)

game-of-life learn difficulty: 1/7 simulate author: system unsolved

A 6x6 initial Game of Life pattern. Run 10 generations. Each row of the final grid, read as 6-bit binary mod 26, gives a letter (A=0). All 6 letters spell the answer.

DATA

Initial Grid	`[0, 0, 0, 1, 1, 0], [1, 0, 0, 1, 0, 1], [1, 0, 0, 0, 0, 0], [0, 1, 1, 0, 1, 1], [0, 0, 1, 0, 0, 0], [0, 1, 0, 1, 1, 1]`
Generations	`10`
Rows	`6`
Cols	`6`
Rules	`B3/S23 (Conway's Game of Life)`
Hint	`Simulate 10 generations of Conway's Game of Life on the 6x6 grid. Rules: live cell with 2-3 neighbors survives, dead cell with 3 neighbors becomes alive. After 10 gens, each row's 6-bit value mod 26 gives a letter (A=0).`
Answer Format	`lowercase word, no spaces (6 letters)`

{
  "type": "game-of-life",
  "initial_grid": [
    [
      0,
      0,
      0,
      1,
      1,
      0
    ],
    [
      1,
      0,
      0,
      1,
      0,
      1
    ],
    [
      1,
      0,
      0,
      0,
      0,
      0
    ],
    [
      0,
      1,
      1,
      0,
      1,
      1
    ],
    [
      0,
      0,
      1,
      0,
      0,
      0
    ],
    [
      0,
      1,
      0,
      1,
      1,
      1
    ]
  ],
  "generations": 10,
  "rows": 6,
  "cols": 6,
  "rules": "B3/S23 (Conway's Game of Life)",
  "note": "Run N generations. Each final row as 6-bit binary (live=1, dead=0). Value mod 26 gives letter (A=0).",
  "hint": "Simulate 10 generations of Conway's Game of Life on the 6x6 grid. Rules: live cell with 2-3 neighbors survives, dead cell with 3 neighbors becomes alive. After 10 gens, each row's 6-bit value mod 26 gives a letter (A=0).",
  "answer_format": "lowercase word, no spaces (6 letters)"
}

author's note: Pool fill: game-of-life diff 1