--- a/solutions3/knight2.scala	Wed Nov 28 23:26:47 2018 +0000
+++ b/solutions3/knight2.scala	Thu Nov 29 17:15:11 2018 +0000
@@ -64,6 +64,8 @@
 def first_closed_tour_heuristics(dim: Int, path: Path) =
  time_needed(tfirst_closed_tour_heuristics(dim: Int, path: Path))
 
+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) {
@@ -82,6 +84,8 @@
 def first_tour_heuristics(dim: Int, path: Path) = 
   time_needed(tfirst_tour_heuristics(dim: Int, path: Path))
 
+def first_tour_heuristic(dim: Int, path: Path) = 
+  time_needed(tfirst_tour_heuristics(dim: Int, path: Path))
 
 // will be called with boards up to 30 x 30