--- a/cws/cw03.tex	Thu Oct 31 09:49:33 2019 +0000
+++ b/cws/cw03.tex	Thu Oct 31 10:44:10 2019 +0000
@@ -210,7 +210,7 @@
 
 
 
-\subsection*{Part 1 (6 Marks)}
+\subsection*{Preliminary Part (4 Marks)}
 
 You are asked to implement the knight's tour problem such that the
 dimension of the board can be changed.  Therefore most functions will
@@ -296,8 +296,10 @@
   19591828170979904, respectively.}\smallskip
 
 
+\subsection*{Core Part (6 Marks)}
 
-\subsubsection*{Tasks (cont.)}
+
+\subsubsection*{Tasks (file knight1.scala cont.)}
 
 \begin{itemize}
 \item[(4)] Implement a \texttt{first}-function. This function takes a list of
@@ -341,12 +343,10 @@
 sizes of up to $8 \times 8$.
 \bigskip
 
+%%\newpage
 
 
-%%\newpage
-\subsection*{Advanced Part 2 (4 Marks)}
-
-As you should have seen in Part 1, a naive search for tours beyond
+As you should have seen in the earlier parts, a naive search for tours beyond
 $8 \times 8$ boards and also searching for closed tours even on small
 boards takes too much time. There is a heuristic, called \emph{Warnsdorf's
 Rule} that can speed up finding a tour. This heuristic states that a