Add game-of-life (#4077)

* Add `game-of-life`

* Fix test case formatting

Author: BNAndras

config.json

@@ -959,6 +959,16 @@
         "prerequisites": ["basics", "bools", "numbers", "classes"],
         "difficulty": 2
       },
+      {
+        "slug": "game-of-life",
+        "name": "Conway's Game of Life",
+        "uuid": "1675a497-d3b2-4772-bbee-4edae5a44e91",
+        "practices": [],
+        "prerequisites": [
+          "lists"
+        ],
+        "difficulty": 3
+      },
       {
         "slug": "eliuds-eggs",
         "name": "Eliud's Eggs",

exercises/practice/game-of-life/.docs/instructions.md

@@ -0,0 +1,11 @@
+# Instructions
+
+After each generation, the cells interact with their eight neighbors, which are cells adjacent horizontally, vertically, or diagonally.
+
+The following rules are applied to each cell:
+
+- Any live cell with two or three live neighbors lives on.
+- Any dead cell with exactly three live neighbors becomes a live cell.
+- All other cells die or stay dead.
+
+Given a matrix of 1s and 0s (corresponding to live and dead cells), apply the rules to each cell, and return the next generation.

exercises/practice/game-of-life/.docs/introduction.md

@@ -0,0 +1,9 @@
+# Introduction
+
+[Conway's Game of Life][game-of-life] is a fascinating cellular automaton created by the British mathematician John Horton Conway in 1970.
+
+The game consists of a two-dimensional grid of cells that can either be "alive" or "dead."
+
+After each generation, the cells interact with their eight neighbors via a set of rules, which define the new generation.
+
+[game-of-life]: https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life

exercises/practice/game-of-life/.meta/config.json

@@ -0,0 +1,19 @@
+{
+  "authors": [
+    "BNAndras"
+  ],
+  "files": {
+    "solution": [
+      "game_of_life.py"
+    ],
+    "test": [
+      "game_of_life_test.py"
+    ],
+    "example": [
+      ".meta/example.py"
+    ]
+  },
+  "blurb": "Implement Conway's Game of Life.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life"
+}

exercises/practice/game-of-life/.meta/example.py

@@ -0,0 +1,34 @@
+def tick(matrix):
+    def count_neighbors(r, c):
+        count = 0
+        for dr, dc in [
+            (-1, -1), (-1, 0), (-1, 1),
+            (0, -1),           (0, 1),
+            (1, -1),  (1, 0),  (1, 1),
+        ]:
+            nr, nc = r + dr, c + dc
+            if 0 <= nr < rows and 0 <= nc < cols:
+                count += matrix[nr][nc]
+        return count
+
+    if not matrix:
+        return []
+
+    rows = len(matrix)
+    cols = len(matrix[0])
+
+    new_matrix = []
+    for r in range(rows):
+        new_row = []
+        for c in range(cols):
+            neighbors = count_neighbors(r, c)
+            current = matrix[r][c]
+            state = 0
+            if current == 1 and (neighbors == 2 or neighbors == 3):
+                state = 1
+            elif current == 0 and neighbors == 3:
+                state = 1
+            new_row.append(state)
+        new_matrix.append(new_row)
+
+    return new_matrix

exercises/practice/game-of-life/.meta/template.j2

@@ -0,0 +1,22 @@
+{% import "generator_macros.j2" as macros with context %}
+{{ macros.canonical_ref() }}
+
+{{ macros.header() }}
+
+class {{ exercise | camel_case }}Test(unittest.TestCase):
+    {% for case in cases %}
+    def test_{{ case.description | to_snake }}(self):
+        matrix =  [
+            {% for row in case.input.matrix %}
+            {{ row }},
+            {% endfor %}
+        ]
+        expected = [
+            {% for row in case.expected %}
+            {{ row }},
+            {% endfor %}
+        ]
+        self.assertEqual(
+            tick(matrix), expected
+        )
+    {% endfor %}

exercises/practice/game-of-life/.meta/tests.toml

@@ -0,0 +1,34 @@
+# This is an auto-generated file.
+#
+# Regenerating this file via `configlet sync` will:
+# - Recreate every `description` key/value pair
+# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
+# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
+# - Preserve any other key/value pair
+#
+# As user-added comments (using the # character) will be removed when this file
+# is regenerated, comments can be added via a `comment` key.
+
+[ae86ea7d-bd07-4357-90b3-ac7d256bd5c5]
+description = "empty matrix"
+
+[4ea5ccb7-7b73-4281-954a-bed1b0f139a5]
+description = "live cells with zero live neighbors die"
+
+[df245adc-14ff-4f9c-b2ae-f465ef5321b2]
+description = "live cells with only one live neighbor die"
+
+[2a713b56-283c-48c8-adae-1d21306c80ae]
+description = "live cells with two live neighbors stay alive"
+
+[86d5c5a5-ab7b-41a1-8907-c9b3fc5e9dae]
+description = "live cells with three live neighbors stay alive"
+
+[015f60ac-39d8-4c6c-8328-57f334fc9f89]
+description = "dead cells with three live neighbors become alive"
+
+[2ee69c00-9d41-4b8b-89da-5832e735ccf1]
+description = "live cells with four or more neighbors die"
+
+[a79b42be-ed6c-4e27-9206-43da08697ef6]
+description = "bigger matrix"

exercises/practice/game-of-life/game_of_life.py

@@ -0,0 +1,2 @@
+def tick(matrix):
+    pass

exercises/practice/game-of-life/game_of_life_test.py

@@ -0,0 +1,117 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/game-of-life/canonical-data.json
+# File last updated on 2026-01-26
+
+import unittest
+
+from game_of_life import (
+    tick,
+)
+
+
+class GameOfLifeTest(unittest.TestCase):
+    def test_empty_matrix(self):
+        matrix = []
+        expected = []
+        self.assertEqual(tick(matrix), expected)
+
+    def test_live_cells_with_zero_live_neighbors_die(self):
+        matrix = [
+            [0, 0, 0],
+            [0, 1, 0],
+            [0, 0, 0],
+        ]
+        expected = [
+            [0, 0, 0],
+            [0, 0, 0],
+            [0, 0, 0],
+        ]
+        self.assertEqual(tick(matrix), expected)
+
+    def test_live_cells_with_only_one_live_neighbor_die(self):
+        matrix = [
+            [0, 0, 0],
+            [0, 1, 0],
+            [0, 1, 0],
+        ]
+        expected = [
+            [0, 0, 0],
+            [0, 0, 0],
+            [0, 0, 0],
+        ]
+        self.assertEqual(tick(matrix), expected)
+
+    def test_live_cells_with_two_live_neighbors_stay_alive(self):
+        matrix = [
+            [1, 0, 1],
+            [1, 0, 1],
+            [1, 0, 1],
+        ]
+        expected = [
+            [0, 0, 0],
+            [1, 0, 1],
+            [0, 0, 0],
+        ]
+        self.assertEqual(tick(matrix), expected)
+
+    def test_live_cells_with_three_live_neighbors_stay_alive(self):
+        matrix = [
+            [0, 1, 0],
+            [1, 0, 0],
+            [1, 1, 0],
+        ]
+        expected = [
+            [0, 0, 0],
+            [1, 0, 0],
+            [1, 1, 0],
+        ]
+        self.assertEqual(tick(matrix), expected)
+
+    def test_dead_cells_with_three_live_neighbors_become_alive(self):
+        matrix = [
+            [1, 1, 0],
+            [0, 0, 0],
+            [1, 0, 0],
+        ]
+        expected = [
+            [0, 0, 0],
+            [1, 1, 0],
+            [0, 0, 0],
+        ]
+        self.assertEqual(tick(matrix), expected)
+
+    def test_live_cells_with_four_or_more_neighbors_die(self):
+        matrix = [
+            [1, 1, 1],
+            [1, 1, 1],
+            [1, 1, 1],
+        ]
+        expected = [
+            [1, 0, 1],
+            [0, 0, 0],
+            [1, 0, 1],
+        ]
+        self.assertEqual(tick(matrix), expected)
+
+    def test_bigger_matrix(self):
+        matrix = [
+            [1, 1, 0, 1, 1, 0, 0, 0],
+            [1, 0, 1, 1, 0, 0, 0, 0],
+            [1, 1, 1, 0, 0, 1, 1, 1],
+            [0, 0, 0, 0, 0, 1, 1, 0],
+            [1, 0, 0, 0, 1, 1, 0, 0],
+            [1, 1, 0, 0, 0, 1, 1, 1],
+            [0, 0, 1, 0, 1, 0, 0, 1],
+            [1, 0, 0, 0, 0, 0, 1, 1],
+        ]
+        expected = [
+            [1, 1, 0, 1, 1, 0, 0, 0],
+            [0, 0, 0, 0, 0, 1, 1, 0],
+            [1, 0, 1, 1, 1, 1, 0, 1],
+            [1, 0, 0, 0, 0, 0, 0, 1],
+            [1, 1, 0, 0, 1, 0, 0, 1],
+            [1, 1, 0, 1, 0, 0, 0, 1],
+            [1, 0, 0, 0, 0, 0, 0, 0],
+            [0, 0, 0, 0, 0, 0, 1, 1],
+        ]
+        self.assertEqual(tick(matrix), expected)