Fix

src/main/java/com/thealgorithms/backtracking/KnightsTour.java

@@ -41,6 +41,23 @@ private KnightsTour() {
     // Total number of cells the knight needs to visit
     static int total;
 
+    /**
+     * Resets the chess board to its initial state.
+     * Initializes the grid with boundary cells marked as -1 and internal cells as 0.
+     * Sets the total number of cells the knight needs to visit.
+     */
+    public static void resetBoard() {
+        grid = new int[BASE][BASE];
+        total = (BASE - 4) * (BASE - 4);
+        for (int r = 0; r < BASE; r++) {
+            for (int c = 0; c < BASE; c++) {
+                if (r < 2 || r > BASE - 3 || c < 2 || c > BASE - 3) {
+                    grid[r][c] = -1; // Mark boundary cells
+                }
+            }
+        }
+    }
+
     /**
      * Recursive method to solve the Knight's Tour problem.
      *

src/test/java/com/thealgorithms/backtracking/KnightsTourTest.java

@@ -11,21 +11,12 @@ public class KnightsTourTest {
 
     @BeforeEach
     void setUp() {
-        // Reset the grid and total for each test
-        KnightsTour.grid = new int[12][12];
-        KnightsTour.total = (12 - 4) * (12 - 4);
-        for (int r = 0; r < 12; r++) {
-            for (int c = 0; c < 12; c++) {
-                if (r < 2 || r > 12 - 3 || c < 2 || c > 12 - 3) {
-                    KnightsTour.grid[r][c] = -1;
-                }
-            }
-        }
+        // Call the reset method in the KnightsTour class
+        KnightsTour.resetBoard();
     }
 
     @Test
     void testGridInitialization() {
-        // Ensure that the border squares are -1 and internal grid is 0
         for (int r = 0; r < 12; r++) {
             for (int c = 0; c < 12; c++) {
                 if (r < 2 || r > 12 - 3 || c < 2 || c > 12 - 3) {