diff -r b17a98b0c52f -r e48ea8300b2d main_solution4/knight3.scala
--- a/main_solution4/knight3.scala	Sat Nov 06 00:06:39 2021 +0000
+++ b/main_solution4/knight3.scala	Mon Nov 08 00:17:50 2021 +0000
@@ -1,7 +1,7 @@
 // Part 3 about finding a single tour using the Warnsdorf Rule
 //=============================================================
 
-object CW9c { // for preparing the jar
+object M4c { // for preparing the jar
 
 type Pos = (Int, Int)
 type Path = List[Pos]
@@ -61,6 +61,7 @@
   time_needed(ttour_on_mega_board(dim: Int, path: Path))
 
 
-
+// testcases
+//print_board(70, tour_on_mega_board(70, List((0, 0))).get)
 
 }