--- a/cws/cw03.tex	Tue Oct 29 23:56:13 2019 +0000
+++ b/cws/cw03.tex	Wed Oct 30 11:28:44 2019 +0000
@@ -1,3 +1,4 @@
+% !TEX program = xelatex
 \documentclass{article}
 \usepackage{chessboard}
 \usepackage[LSBC4,T1]{fontenc}
@@ -22,16 +23,15 @@
 \mbox{}\hfill\textit{``The problem with object-oriented languages is they’ve got all this implicit,}\\
 \mbox{}\hfill\textit{environment that they carry around with them. You wanted a banana but}\\
 \mbox{}\hfill\textit{what you got was a gorilla holding the banana and the entire jungle.''}\smallskip\\
-\mbox{}\hfill\textit{ --- Joe Armstrong (creator of the Erlang programming language)}\bigskip
+\mbox{}\hfill\textit{ --- Joe Armstrong (creator of the Erlang programming language)}\medskip\bigskip
 
 \noindent
-This coursework is worth 10\%. It is about searching and
-backtracking. The first part is due on 29 November at 11pm; the
-second, more advanced part, is due on 20 December at 11pm. You are
-asked to implement Scala programs that solve various versions of the
-\textit{Knight's Tour Problem} on a chessboard. Note the second, more
-advanced, part might include material you have not yet seen in the
-first three lectures. \bigskip
+This coursework is about searching and backtracking. You are asked to
+implement Scala programs that solve various versions of the
+\textit{Knight's Tour Problem} on a chessboard. The preliminary part is
+due on  \cwEIGHT{} at 4pm; the core part is due on \cwEIGHTa{} at 4pm.
+Note the core, more advanced, part might include material you have not
+yet seen in the first three lectures. \bigskip
 
 \IMPORTANT{}
 Also note that the running time of each part will be restricted to a