diff -r 6e93040e3378 -r cdfa6a293453 main_templates4/knight3.scala
--- a/main_templates4/knight3.scala	Sat Oct 08 00:30:51 2022 +0100
+++ b/main_templates4/knight3.scala	Tue Nov 01 15:03:48 2022 +0000
@@ -14,13 +14,11 @@
 type Pos = (Int, Int)    // a position on a chessboard 
 type Path = List[Pos]    // a path...a list of positions
 
-//(9) Implement a function that searches for a 
-//    you have to be careful to write a tail-recursive version as this 
-//    function will be called with dimensions of up to 70 * 70
-//    and starting field (0, 0). It has to produce a solution within
-//    30 seconds.
+// ADD YOUR CODE BELOW
+//======================
 
 
+//(9) 
 def tour_on_mega_board(dim: Int, path: Path) : Option[Path] = ???
 
 }