--- a/testing3/knight2.scala	Fri Dec 14 20:01:49 2018 +0000
+++ b/testing3/knight2.scala	Sat Dec 15 13:46:54 2018 +0000
@@ -64,6 +64,9 @@
 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 +85,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