Add game-of-life (#1586)

* Add `game-of-life`

* Prettier format

* Add .vscode JSON files

Author: BNAndras

config.json

@@ -38,7 +38,9 @@
         "slug": "lasagna",
         "name": "lasagna",
         "uuid": "a0bed44f-b179-4d09-8788-a23d2ace359e",
-        "concepts": ["basics"],
+        "concepts": [
+          "basics"
+        ],
         "prerequisites": [],
         "status": "wip"
       }
@@ -1456,6 +1458,14 @@
         "topics": [
           "algorithms"
         ]
+      },
+      {
+        "slug": "game-of-life",
+        "name": "Conway's Game of Life",
+        "uuid": "c338cbce-fad4-4de0-bf0d-4a90803a0fe9",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 2
       }
     ]
   },

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.ts"
+    ],
+    "test": [
+      "game-of-life.test.ts"
+    ],
+    "example": [
+      ".meta/proof.ci.ts"
+    ]
+  },
+  "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/proof.ci.ts

@@ -0,0 +1,48 @@
+export class GameOfLife {
+  constructor(private matrix: number[][]) {}
+
+  public tick(): void {
+    if (this.matrix.length === 0) {
+      return
+    }
+    const rows = this.matrix.length
+    const cols = this.matrix[0].length
+
+    const newMatrix = JSON.parse(JSON.stringify(this.matrix)) as number[][]
+
+    for (let row = 0; row < rows; row++) {
+      for (let col = 0; col < cols; col++) {
+        let liveNeighbors = 0
+        for (let newRow = row - 1; newRow <= row + 1; newRow++) {
+          for (let newCol = col - 1; newCol <= col + 1; newCol++) {
+            if (newRow === row && newCol === col) {
+              continue
+            }
+            if (newRow >= 0 && newRow < rows && newCol >= 0 && newCol < cols) {
+              liveNeighbors += this.matrix[newRow][newCol]
+            }
+          }
+        }
+
+        let cell = this.matrix[row][col]
+        if (cell === 1) {
+          if (liveNeighbors < 2 || liveNeighbors > 3) {
+            cell = 0
+          }
+        } else {
+          if (liveNeighbors === 3) {
+            cell = 1
+          }
+        }
+
+        newMatrix[row][col] = cell
+      }
+    }
+
+    this.matrix = newMatrix
+  }
+
+  public state(): number[][] {
+    return this.matrix
+  }
+}

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/.vscode/extensions.json

@@ -0,0 +1,7 @@
+{
+  "recommendations": [
+    "arcanis.vscode-zipfs",
+    "dbaeumer.vscode-eslint",
+    "esbenp.prettier-vscode"
+  ]
+}

exercises/practice/game-of-life/.vscode/settings.json

@@ -0,0 +1,7 @@
+{
+  "cSpell.words": ["exercism"],
+  "search.exclude": {
+    "**/.yarn": true,
+    "**/.pnp.*": true
+  }
+}

exercises/practice/game-of-life/.yarnrc.yml

@@ -0,0 +1,3 @@
+compressionLevel: mixed
+
+enableGlobalCache: true

exercises/practice/game-of-life/babel.config.cjs

@@ -0,0 +1,5 @@
+module.exports = {
+  // eslint-disable-next-line @typescript-eslint/no-require-imports
+  presets: [[require('@exercism/babel-preset-typescript'), { corejs: '3.38' }]],
+  plugins: [],
+}