Add flower-field exercise (#54)

Author: keiravillekode

config.json

@@ -358,6 +358,14 @@
         "prerequisites": [],
         "difficulty": 5
       },
+      {
+        "slug": "flower-field",
+        "name": "Flower Field",
+        "uuid": "f0ba257c-3432-439e-b2b7-706e7f4ad87d",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 6
+      },
       {
         "slug": "intergalactic-transmission",
         "name": "Intergalactic Transmission",

exercises/practice/flower-field/.docs/instructions.md

@@ -0,0 +1,26 @@
+# Instructions
+
+Your task is to add flower counts to empty squares in a completed Flower Field garden.
+The garden itself is a rectangle board composed of squares that are either empty (`' '`) or a flower (`'*'`).
+
+For each empty square, count the number of flowers adjacent to it (horizontally, vertically, diagonally).
+If the empty square has no adjacent flowers, leave it empty.
+Otherwise replace it with the count of adjacent flowers.
+
+For example, you may receive a 5 x 4 board like this (empty spaces are represented here with the '·' character for display on screen):
+
+```text
+·*·*·
+··*··
+··*··
+·····
+```
+
+Which your code should transform into this:
+
+```text
+1*3*1
+13*31
+·2*2·
+·111·
+```

exercises/practice/flower-field/.docs/introduction.md

@@ -0,0 +1,7 @@
+# Introduction
+
+[Flower Field][history] is a compassionate reimagining of the popular game Minesweeper.
+The object of the game is to find all the flowers in the garden using numeric hints that indicate how many flowers are directly adjacent (horizontally, vertically, diagonally) to a square.
+"Flower Field" shipped in regional versions of Microsoft Windows in Italy, Germany, South Korea, Japan and Taiwan.
+
+[history]: https://web.archive.org/web/20020409051321fw_/http://rcm.usr.dsi.unimi.it/rcmweb/fnm/

exercises/practice/flower-field/.meta/config.json

@@ -0,0 +1,17 @@
+{
+  "authors": [
+    "keiravillekode"
+  ],
+  "files": {
+    "solution": [
+      "flower_field.fut"
+    ],
+    "test": [
+      "test.fut"
+    ],
+    "example": [
+      ".meta/example.fut"
+    ]
+  },
+  "blurb": "Mark all the flowers in a garden."
+}

exercises/practice/flower-field/.meta/example.fut

@@ -0,0 +1,24 @@
+
+def annotate_square [m] [n] (garden: [m][n]u8) (i: i64) (j: i64): u8 =
+  if garden[i][j] == '*' then '*' else
+  let count = loop count = 0u8 for k in 0..<9 do
+    let i2 = i + (k / 3) - 1
+    let j2 = j + (k % 3) - 1
+    in
+      if i2 < 0 || i2 >= m || j2 < 0 || j2 >= n || garden[i2][j2] != '*' then count else
+      count + 1
+  in
+    if count == 0 then ' ' else
+    '0' + count
+
+def annotate_row [m] [n] (garden: [m][n]u8) (i: i64): [n]u8 =
+  let b = loop b = copy garden[i] for j in 0..<n do
+    b with [j] = annotate_square garden i j
+  in
+    b
+
+def annotate [m] [n] (garden: [m][n]u8): [m][n]u8 =
+  let a = loop a = copy garden for i in 0..<m do
+    a with [i] = annotate_row garden i
+  in
+    a

exercises/practice/flower-field/.meta/tests.toml

@@ -0,0 +1,46 @@
+# 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.
+
+[237ff487-467a-47e1-9b01-8a891844f86c]
+description = "no rows"
+
+[4b4134ec-e20f-439c-a295-664c38950ba1]
+description = "no columns"
+
+[d774d054-bbad-4867-88ae-069cbd1c4f92]
+description = "no flowers"
+
+[225176a0-725e-43cd-aa13-9dced501f16e]
+description = "garden full of flowers"
+
+[3f345495-f1a5-4132-8411-74bd7ca08c49]
+description = "flower surrounded by spaces"
+
+[6cb04070-4199-4ef7-a6fa-92f68c660fca]
+description = "space surrounded by flowers"
+
+[272d2306-9f62-44fe-8ab5-6b0f43a26338]
+description = "horizontal line"
+
+[c6f0a4b2-58d0-4bf6-ad8d-ccf4144f1f8e]
+description = "horizontal line, flowers at edges"
+
+[a54e84b7-3b25-44a8-b8cf-1753c8bb4cf5]
+description = "vertical line"
+
+[b40f42f5-dec5-4abc-b167-3f08195189c1]
+description = "vertical line, flowers at edges"
+
+[58674965-7b42-4818-b930-0215062d543c]
+description = "cross"
+
+[dd9d4ca8-9e68-4f78-a677-a2a70fd7a7b8]
+description = "large garden"

exercises/practice/flower-field/flower_field.fut

@@ -0,0 +1 @@
+def annotate [m] [n] (garden: [m][n]u8): [m][n]u8 = ???

exercises/practice/flower-field/test.fut

@@ -0,0 +1,64 @@
+import "flower_field"
+
+-- no rows
+-- ==
+-- input  { empty([0][0]u8) }
+-- output { empty([0][0]u8) }
+
+-- no columns
+-- ==
+-- input  { [""] }
+-- output { [""] }
+
+-- no flowers
+-- ==
+-- input  { ["   ", "   ", "   "] }
+-- output { ["   ", "   ", "   "] }
+
+-- garden full of flowers
+-- ==
+-- input  { ["***", "***", "***"] }
+-- output { ["***", "***", "***"] }
+
+-- flower surrounded by spaces
+-- ==
+-- input  { ["   ", " * ", "   "] }
+-- output { ["111", "1*1", "111"] }
+
+-- space surrounded by flowers
+-- ==
+-- input  { ["***", "* *", "***"] }
+-- output { ["***", "*8*", "***"] }
+
+-- horizontal line
+-- ==
+-- input  { [" * * "] }
+-- output { ["1*2*1"] }
+
+-- horizontal line, flowers at edges
+-- ==
+-- input  { ["*   *"] }
+-- output { ["*1 1*"] }
+
+-- vertical line
+-- ==
+-- input  { [" ", "*", " ", "*", " "] }
+-- output { ["1", "*", "2", "*", "1"] }
+
+-- vertical line, flowers at edges
+-- ==
+-- input  { ["*", " ", " ", " ", "*"] }
+-- output { ["*", "1", " ", "1", "*"] }
+
+-- cross
+-- ==
+-- input  { ["  *  ", "  *  ", "*****", "  *  ", "  *  "] }
+-- output { [" 2*2 ", "25*52", "*****", "25*52", " 2*2 "] }
+
+-- large garden
+-- ==
+-- input  { [" *  * ", "  *   ", "    * ", "   * *", " *  * ", "      "] }
+-- output { ["1*22*1", "12*322", " 123*2", "112*4*", "1*22*2", "111111"] }
+
+let main [m] [n] (garden: [m][n]u8): [m][n]u8 =
+  annotate garden