20 \section*{Coursework 8 (Scala)} |
21 \section*{Coursework 8 (Scala)} |
21 |
22 |
22 \mbox{}\hfill\textit{``The problem with object-oriented languages is they’ve got all this implicit,}\\ |
23 \mbox{}\hfill\textit{``The problem with object-oriented languages is they’ve got all this implicit,}\\ |
23 \mbox{}\hfill\textit{environment that they carry around with them. You wanted a banana but}\\ |
24 \mbox{}\hfill\textit{environment that they carry around with them. You wanted a banana but}\\ |
24 \mbox{}\hfill\textit{what you got was a gorilla holding the banana and the entire jungle.''}\smallskip\\ |
25 \mbox{}\hfill\textit{what you got was a gorilla holding the banana and the entire jungle.''}\smallskip\\ |
25 \mbox{}\hfill\textit{ --- Joe Armstrong (creator of the Erlang programming language)}\bigskip |
26 \mbox{}\hfill\textit{ --- Joe Armstrong (creator of the Erlang programming language)}\medskip\bigskip |
26 |
27 |
27 \noindent |
28 \noindent |
28 This coursework is worth 10\%. It is about searching and |
29 This coursework is about searching and backtracking. You are asked to |
29 backtracking. The first part is due on 29 November at 11pm; the |
30 implement Scala programs that solve various versions of the |
30 second, more advanced part, is due on 20 December at 11pm. You are |
31 \textit{Knight's Tour Problem} on a chessboard. The preliminary part is |
31 asked to implement Scala programs that solve various versions of the |
32 due on \cwEIGHT{} at 4pm; the core part is due on \cwEIGHTa{} at 4pm. |
32 \textit{Knight's Tour Problem} on a chessboard. Note the second, more |
33 Note the core, more advanced, part might include material you have not |
33 advanced, part might include material you have not yet seen in the |
34 yet seen in the first three lectures. \bigskip |
34 first three lectures. \bigskip |
|
35 |
35 |
36 \IMPORTANT{} |
36 \IMPORTANT{} |
37 Also note that the running time of each part will be restricted to a |
37 Also note that the running time of each part will be restricted to a |
38 maximum of 30 seconds on my laptop: If you calculate a result once, |
38 maximum of 30 seconds on my laptop: If you calculate a result once, |
39 try to avoid to calculate the result again. Feel free to copy any code |
39 try to avoid to calculate the result again. Feel free to copy any code |