--- a/cws/cw03.tex	Sat Nov 02 19:07:19 2019 +0000
+++ b/cws/cw03.tex	Sat Nov 02 21:23:42 2019 +0000
@@ -191,7 +191,7 @@
 \subsection*{Hints}
 
 \noindent
-\textbf{Part 1} useful list functions: \texttt{.contains(..)} checks
+\textbf{Preliminary Part} useful list functions: \texttt{.contains(..)} checks
 whether an element is in a list, \texttt{.flatten} turns a list of
 lists into just a list, \texttt{\_::\_} puts an element on the head of
 the list, \texttt{.head} gives you the first element of a list (make
@@ -202,7 +202,7 @@
 
 
 \noindent
-\textbf{Part 2} a useful list function: \texttt{.sortBy} sorts a list
+\textbf{Core Part} a useful list function: \texttt{.sortBy} sorts a list
 according to a component given by the function; a function can be
 tested to be tail-recursive by annotation \texttt{@tailrec}, which is
 made available by importing \texttt{scala.annotation.tailrec}.\medskip
@@ -345,7 +345,7 @@
 
 %%\newpage
 
-
+\noindent
 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