|
50
|
1 |
// Part 2 about finding a single tour for a board
|
|
|
2 |
//================================================
|
|
4
|
3 |
|
|
50
|
4 |
// copy any function you need from file knight1.scala
|
|
4
|
5 |
|
|
50
|
6 |
type Pos = (Int, Int) // a position on a chessboard
|
|
|
7 |
type Path = List[Pos] // a path...a list of positions
|
|
4
|
8 |
|
42
Christian Urban <christian dot urban at kcl dot ac dot uk>
diff
changeset
|
9 |
|
|
50
|
10 |
//(2a) Implement a first-function that finds the first
|
|
|
11 |
// element, say x, in the list xs where f is not None.
|
|
|
12 |
// In that case return f(x), otherwise none.
|
42
Christian Urban <christian dot urban at kcl dot ac dot uk>
diff
changeset
|
13 |
|
|
50
|
14 |
def first(xs: List[Pos], f: Pos => Option[Path]): Option[Path] = ...
|
44
Christian Urban <christian dot urban at kcl dot ac dot uk>
diff
changeset
|
15 |
|
|
50
|
16 |
//(2b) Implement a function that uses the first-function for
|
|
|
17 |
// trying out onward moves, and searches recursively for an
|
|
|
18 |
// *open* tour on a dim * dim-board.
|
44
Christian Urban <christian dot urban at kcl dot ac dot uk>
diff
changeset
|
19 |
|
|
50
|
20 |
def first_tour(dim: Int, path: Path): Option[Path] = ...
|
|
|
21 |
|