updated
authorChristian Urban <urbanc@in.tum.de>
Sat, 02 Nov 2019 15:11:30 +0000
changeset 305 e745f6e1ebf6
parent 304 4a9d1153ccc5
child 306 1877cc717291
updated
cws/cw01.pdf
cws/cw02.pdf
cws/cw03.pdf
cws/cw04.pdf
cws/cw05.pdf
style.sty
templates3/knight2.scala
Binary file cws/cw01.pdf has changed
Binary file cws/cw02.pdf has changed
Binary file cws/cw03.pdf has changed
Binary file cws/cw04.pdf has changed
Binary file cws/cw05.pdf has changed
--- a/style.sty	Sat Nov 02 13:19:45 2019 +0000
+++ b/style.sty	Sat Nov 02 15:11:30 2019 +0000
@@ -34,13 +34,13 @@
 \makeatother
 
 % CW deadlines
-\def\cwSIX{14 November}
+\def\cwSIX{13 November}
 \def\cwSIXa{15 January}
 
-\def\cwSEVEN{21 November}
+\def\cwSEVEN{20 November}
 \def\cwSEVENa{15 January}
 
-\def\cwEIGHT{28 November}
+\def\cwEIGHT{27 November}
 \def\cwEIGHTa{15 January}
 
 \def\cwNINE{5 December}
--- a/templates3/knight2.scala	Sat Nov 02 13:19:45 2019 +0000
+++ b/templates3/knight2.scala	Sat Nov 02 15:11:30 2019 +0000
@@ -29,14 +29,14 @@
 //    function will be tested on a 6 x 6 board. 
 
 
-//def first_closed_tour_heuristic(dim: Int, path: Path) : Option[Path] = ...
+//def first_closed_tour_heuristics(dim: Int, path: Path) : Option[Path] = ...
 
 
 //(8) Same as (7) but searches for *non-closed* tours. This 
 //    version of the function will be called with dimensions of 
 //    up to 30 * 30.
 
-//def first_tour_heuristic(dim: Int, path: Path) : Option[Path] = ...
+//def first_tour_heuristics(dim: Int, path: Path) : Option[Path] = ...