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] 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 1ced9f644..75055b9e8 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.