diff -r 1fe8205f6bdb -r a5106bc13db6 cws/cw02.tex
--- a/cws/cw02.tex	Sat Nov 12 22:28:14 2016 +0000
+++ b/cws/cw02.tex	Sun Nov 13 01:27:32 2016 +0000
@@ -15,10 +15,13 @@
 
 \section*{Coursework 7 (Scala, Knight's Tour)}
 
-This coursework is worth 10\%. The first part is due on 23 November
-at 11pm; the second, more advanced part, is due on 30 November at
-11pm. You are asked to implement Scala programs that solve various
-versions of the \textit{Knight's Tour Problem} on a chessboard.
+This coursework is about depth-first search in Scala and worth
+10\%. The first part is due on 23 November at 11pm; the second, more
+advanced part, is due on 30 November at 11pm. You are asked to
+implement Scala programs that solve various versions of the
+\textit{Knight's Tour Problem} on a chessboard. Make sure the files
+you submit can be processed by just calling \texttt{scala
+  <<filename.scala>>}.
  
 \subsection*{Disclaimer}
 
@@ -30,8 +33,9 @@
 \subsection*{Background}
 
 The \textit{Knight's Tour Problem} is about finding a tour such that
-the knight visits every field on a $n\times n$ chessboard once. For
-example on a $5\times 5$ chessboard, a knight's tour is as follows:
+the knight visits every field on a $n\times n$ chessboard once and
+only once. For example on a $5\times 5$ chessboard, a knight's tour is
+as follows:
 
 
 \chessboard[maxfield=e5,