Add game-of-life exercise (#68)

Author: keiravillekode

config.json

@@ -409,6 +409,14 @@
         "prerequisites": [],
         "difficulty": 5
       },
+      {
+        "slug": "game-of-life",
+        "name": "Conway's Game of Life",
+        "uuid": "f38b0cc2-0d10-40e7-9f25-ad254e93084d",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 6
+      },
       {
         "slug": "flower-field",
         "name": "Flower Field",

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": [
+    "keiravillekode"
+  ],
+  "files": {
+    "solution": [
+      "game_of_life.fut"
+    ],
+    "test": [
+      "test.fut"
+    ],
+    "example": [
+      ".meta/example.fut"
+    ]
+  },
+  "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.fut

@@ -0,0 +1,18 @@
+
+def tick_cell [n] (matrix: [n][n]i32) (i: i64) (j: i64): i32 =
+  let count = loop count = -matrix[i][j] for k in 0..<9 do
+    let i2 = i + (k / 3) - 1
+    let j2 = j + (k % 3) - 1
+    in
+      if i2 < 0 || i2 >= n || j2 < 0 || j2 >= n || matrix[i2][j2] != 1 then count else
+      count + 1
+  in
+    -- if current cell is alive, treat 2 alive neighbours as 3
+    if count | matrix[i][j] == 3 then 1 else
+    0
+
+def tick_row [n] (matrix: [n][n]i32) (i: i64): [n]i32 =
+  tabulate n (tick_cell matrix i)
+
+def tick [n] (matrix: [n][n]i32): [n][n]i32 =
+  tabulate n (tick_row 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/game_of_life.fut

@@ -0,0 +1 @@
+def tick [n] (matrix: [n][n]i32): [n][n]i32 = ???

exercises/practice/game-of-life/test.fut

@@ -0,0 +1,44 @@
+import "game_of_life"
+
+-- empty matrix
+-- ==
+-- input  { empty([0][0]i32) }
+-- output { empty([0][0]i32) }
+
+-- live cells with zero live neighbors die
+-- ==
+-- input  { [[0, 0, 0], [0, 1, 0], [0, 0, 0]] }
+-- output { [[0, 0, 0], [0, 0, 0], [0, 0, 0]] }
+
+-- live cells with only one live neighbor die
+-- ==
+-- input  { [[0, 0, 0], [0, 1, 0], [0, 1, 0]] }
+-- output { [[0, 0, 0], [0, 0, 0], [0, 0, 0]] }
+
+-- live cells with two live neighbors stay alive
+-- ==
+-- input  { [[1, 0, 1], [1, 0, 1], [1, 0, 1]] }
+-- output { [[0, 0, 0], [1, 0, 1], [0, 0, 0]] }
+
+-- live cells with three live neighbors stay alive
+-- ==
+-- input  { [[0, 1, 0], [1, 0, 0], [1, 1, 0]] }
+-- output { [[0, 0, 0], [1, 0, 0], [1, 1, 0]] }
+
+-- dead cells with three live neighbors become alive
+-- ==
+-- input  { [[1, 1, 0], [0, 0, 0], [1, 0, 0]] }
+-- output { [[0, 0, 0], [1, 1, 0], [0, 0, 0]] }
+
+-- live cells with four or more neighbors die
+-- ==
+-- input  { [[1, 1, 1], [1, 1, 1], [1, 1, 1]] }
+-- output { [[1, 0, 1], [0, 0, 0], [1, 0, 1]] }
+
+-- bigger matrix
+-- ==
+-- input  { [[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]] }
+-- output { [[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]] }
+
+let main [n] (matrix: [n][n]i32): [n][n]i32 =
+  tick matrix