diff -r de59aa20a1dc -r ffce7b61b446 main_testing4/knight2.scala
--- a/main_testing4/knight2.scala	Mon Nov 08 01:16:13 2021 +0000
+++ b/main_testing4/knight2.scala	Mon Nov 08 01:39:00 2021 +0000
@@ -1,7 +1,7 @@
-// Part 3 about finding a single tour using the Warnsdorf Rule
+// Part 2 about finding a single tour using the Warnsdorf Rule
 //=============================================================
 
-object CW9b {
+object M4b { // for preparing the jar
 
 type Pos = (Int, Int)
 type Path = List[Pos]
@@ -67,7 +67,6 @@
 def first_closed_tour_heuristic(dim: Int, path: Path) =
  time_needed(tfirst_closed_tour_heuristics(dim: Int, path: Path))
 
-
 // heuristic cannot be used to search for closed tours on 7 x 7 an beyond
 //for (dim <- 1 to 6) {
 //  val t = time_needed(0, first_closed_tour_heuristics(dim, List((dim / 2, dim / 2))))