docs: Update README.md

Author: Kalkwst

Algorithms.Tests/Problems/KnightTour/OpenKnightTourTests.cs

@@ -21,7 +21,11 @@ private static bool IsKnightMove((int r, int c) a, (int r, int c) b)
                 for (var c = 0; c < n; c++)
                 {
                     var v = board[r, c];
-                    if (v <= 0) continue; // ignore zeros in partial/invalid boards
+                    if (v <= 0)
+                    {
+                        continue;
+                    }
+                    // ignore zeros in partial/invalid boards
                     if (!map.TryAdd(v, (r, c)))
                     {
                         throw new AssertionException($"Duplicate visit number detected: {v}.");
@@ -37,7 +41,9 @@ private static void AssertIsValidTour(int[,] board)
             Assert.That(board.GetLength(1), Is.EqualTo(n), "Board must be square.");
 
             // 1) All cells visited and within [1..n*n]
-            int min = int.MaxValue, max = int.MinValue;
+            int min = int.MaxValue;
+            int max = int.MinValue;
+            
             var seen = new bool[n * n + 1]; // 1..n*n
             for (var r = 0; r < n; r++)
             {
@@ -48,8 +54,15 @@ private static void AssertIsValidTour(int[,] board)
                         $"Cell [{r},{c}] has out-of-range value {v}.");
                     Assert.That(seen[v], Is.False, $"Duplicate value {v} found.");
                     seen[v] = true;
-                    if (v < min) min = v;
-                    if (v > max) max = v;
+                    if (v < min)
+                    {
+                        min = v;
+                    }
+
+                    if (v > max)
+                    {
+                        max = v;
+                    }
                 }
             }
             Assert.That(min, Is.EqualTo(1), "Tour must start at 1.");
@@ -82,7 +95,7 @@ public void Tour_Throws_On_NonPositiveN()
         public void Tour_Throws_On_Unsolvable_N_2_3_4(int n)
         {
             var solver = new OpenKnightTour();
-            var ex = Assert.Throws<ArgumentException>(() => solver.Tour(n));
+            Assert.Throws<ArgumentException>(() => solver.Tour(n));
         }
 
         [Test]

Algorithms/Problems/KnightTour/OpenKnightTour.cs

@@ -129,7 +129,8 @@ private bool KnightTourHelper(int[,] board, (int Row, int Col) pos, int current)
     /// </remarks>
     private IEnumerable<(int R, int C)> GetValidMoves((int R, int C) position, int n)
     {
-        int r = position.R, c = position.C;
+        var r = position.R;
+        var c = position.C;
 
         var candidates = new (int Dr, int Dc)[]
         {
@@ -139,7 +140,9 @@ private bool KnightTourHelper(int[,] board, (int Row, int Col) pos, int current)
 
         foreach (var (dr, dc) in candidates)
         {
-            int nr = r + dr, nc = c + dc;
+            var nr = r + dr;
+            var nc = c + dc;
+
             if (nr >= 0 && nr < n && nc >= 0 && nc < n)
             {
                 yield return (nr, nc);

README.md

@@ -246,6 +246,8 @@ find more than one implementation for the same objective but using different alg
       * [Proposer](./Algorithms/Problems/StableMarriage/Proposer.cs)
     * [N-Queens](./Algorithms/Problems/NQueens)
       * [Backtracking](./Algorithms/Problems/NQueens/BacktrackingNQueensSolver.cs)
+    * [Knight Tour](./Algorithms/Problems/KnightTour/)
+      * [Open Knight Tour](./Algorithms/Problems/KnightTour/OpenKnightTour.cs)
     * [Dynamic Programming](./Algorithms/Problems/DynamicProgramming)
       * [Coin Change](./Algorithms/Problems/DynamicProgramming/CoinChange/DynamicCoinChangeSolver.cs)
       * [Levenshtein Distance](./Algorithms/Problems/DynamicProgramming/LevenshteinDistance/LevenshteinDistance.cs)