
diff -r ead6089209ba -r 3a6f51bc6121 cws/cw02.tex
--- a/cws/cw02.tex	Fri Nov 17 09:13:03 2017 +0000
+++ b/cws/cw02.tex	Fri Nov 17 09:24:34 2017 +0000
@@ -1,6 +1,7 @@
 \documentclass{article}
 \usepackage{chessboard}
 \usepackage[LSBC4,T1]{fontenc}
+\let\clipbox\relax
 \usepackage{../style}
 
 \begin{document}
@@ -260,10 +261,11 @@
   19591828170979904, respectively.}\bigskip
 
 \noindent
-\textbf{Hints:} 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 sure the list is not \texttt{Nil})
+\textbf{Hints:} 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
+sure the list is not \texttt{Nil}).
 
 \subsubsection*{Tasks (file knight2.scala)}
 
@@ -304,10 +306,11 @@
 \bigskip
 
 \noindent
-\textbf{Hints:} a useful list function: \texttt{.filter(..)} filters a list according
-to a boolean function; a useful option function: \texttt{.isDefined} returns true,
-if an option is \texttt{Some(..)}; anonymous functions can be constructed using
-\texttt{(x:Int) => ...}, this functions takes an \texttt{Int} as argument
+\textbf{Hints:} a useful list function: \texttt{.filter(..)} filters a
+list according to a boolean function; a useful option function:
+\texttt{.isDefined} returns true, if an option is \texttt{Some(..)};
+anonymous functions can be constructed using \texttt{(x:Int) => ...},
+this functions takes an \texttt{Int} as an argument.
 
 
 \newpage
@@ -370,10 +373,10 @@
 \bigskip
 
 \noindent
-\textbf{Hints:} 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}
+\textbf{Hints:} 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}.
 
 
 




