diff -r 19b75e899d37 -r 9c03b5e89a2a assignment2021scala/main4/knight3.scala
--- a/assignment2021scala/main4/knight3.scala	Fri Apr 26 17:29:30 2024 +0100
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,26 +0,0 @@
-// Finding a single tour on a "mega" board
-//=========================================
-
-object M4c {
-
-// !!! Copy any function you need from file knight1.scala !!!
-// !!! or knight2.scala                                   !!! 
-//
-// If you need any auxiliary function, feel free to 
-// implement it, but do not make any changes to the
-// templates below.
-
-
-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.
-
-
-def tour_on_mega_board(dim: Int, path: Path) : Option[Path] = ???
-
-}