equal
deleted
inserted
replaced
14 |
14 |
15 |
15 |
16 |
16 |
17 \section*{Coursework 7 (Scala, Knight's Tour)} |
17 \section*{Coursework 7 (Scala, Knight's Tour)} |
18 |
18 |
19 This coursework is worth XXX\% and is due on 21 November at 16:00. You |
19 This coursework is worth 10\% and is due on 21 November at 11pm. You |
20 are asked to implement a Scala program that solves the \textit{knight's |
20 are asked to implement a Scala program that solves the \textit{knight's |
21 tour problem} on an $n\times n$ chessboard. This problem is about |
21 tour problem} on an $n\times n$ chessboard. This problem is about |
22 finding a tour such that the knight visits every field on the |
22 finding a tour such that the knight visits every field on the |
23 chessboard once. One a $5\times 5$ chessboard, a knight's tour |
23 chessboard once. One a $5\times 5$ chessboard, a knight's tour |
24 is as follows: |
24 is as follows: |