From 5b6ca481a64337254a4e2744880861b787244fc6 Mon Sep 17 00:00:00 2001
From: Anastasios Chatzialexiou <16361161+tasxatzial@users.noreply.github.com>
Date: Sat, 7 Dec 2024 01:07:40 +0200
Subject: [PATCH 1/2] Add a story to the dominoes exercise

---
 .../dominoes/{description.md => instructions.md}    |  2 +-
 exercises/dominoes/introduction.md                  | 13 +++++++++++++
 2 files changed, 14 insertions(+), 1 deletion(-)
 rename exercises/dominoes/{description.md => instructions.md} (98%)
 create mode 100644 exercises/dominoes/introduction.md

diff --git a/exercises/dominoes/description.md b/exercises/dominoes/instructions.md
similarity index 98%
rename from exercises/dominoes/description.md
rename to exercises/dominoes/instructions.md
index 6d40c3ee21..1ced9f6448 100644
--- a/exercises/dominoes/description.md
+++ b/exercises/dominoes/instructions.md
@@ -1,4 +1,4 @@
-# Description
+# Instructions
 
 Make a chain of dominoes.
 
diff --git a/exercises/dominoes/introduction.md b/exercises/dominoes/introduction.md
new file mode 100644
index 0000000000..df248c2116
--- /dev/null
+++ b/exercises/dominoes/introduction.md
@@ -0,0 +1,13 @@
+# Introduction
+
+In Toyland, the trains are always busy delivering treasures across the city, from shiny marbles to rare building blocks.
+The tracks they run on are made of colorful domino-shaped pieces, each marked with two numbers.
+For the trains to move, the dominoes must form a perfect chain where the numbers match.
+
+Today, an urgent delivery of rare toys is on hold.
+You've been handed a set of track pieces to inspect.
+If they can form a continuous chain, the train will be on its way, bringing smiles across Toyland.
+If not, the set will be discarded, and another will be tried.
+
+The toys are counting on you to solve this puzzle.
+Will the dominoes connect the tracks and send the train rolling, or will the set be left behind?

From d4f063e5ce0cb45ff2c0a60d5c10cf3563115613 Mon Sep 17 00:00:00 2001
From: Anastasios Chatzialexiou <16361161+tasxatzial@users.noreply.github.com>
Date: Sat, 7 Dec 2024 01:13:19 +0200
Subject: [PATCH 2/2] split overly long sentence in instructions

---
 exercises/dominoes/instructions.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/exercises/dominoes/instructions.md b/exercises/dominoes/instructions.md
index 1ced9f6448..75055b9e89 100644
--- a/exercises/dominoes/instructions.md
+++ b/exercises/dominoes/instructions.md
@@ -2,7 +2,9 @@
 
 Make a chain of dominoes.
 
-Compute a way to order a given set of dominoes in such a way that they form a correct domino chain (the dots on one half of a stone match the dots on the neighboring half of an adjacent stone) and that dots on the halves of the stones which don't have a neighbor (the first and last stone) match each other.
+Compute a way to order a given set of domino stones so that they form a correct domino chain.
+In the chain, the dots on one half of a stone must match the dots on the neighboring half of an adjacent stone.
+Additionally, the dots on the halves of the stones without neighbors (the first and last stone) must match each other.
 
 For example given the stones `[2|1]`, `[2|3]` and `[1|3]` you should compute something
 like `[1|2] [2|3] [3|1]` or `[3|2] [2|1] [1|3]` or `[1|3] [3|2] [2|1]` etc, where the first and last numbers are the same.