1 import M4a._ |
|
2 |
|
3 //type Pos = (Int, Int) // a position on a chessboard |
|
4 //type Path = List[Pos] // a path...a list of positions |
|
5 |
|
6 def count_all_tours_urban(dim: Int) = { |
|
7 for (i <- (0 until dim).toList; |
|
8 j <- (0 until dim).toList) yield count_tours(dim, List((i, j))) |
|
9 } |
|
10 |
|
11 def add_pair_urban(x: Pos)(y: Pos): Pos = |
|
12 (x._1 + y._1, x._2 + y._2) |
|
13 |
|
14 def is_legal_urban(dim: Int, path: Path)(x: Pos): Boolean = |
|
15 0 <= x._1 && 0 <= x._2 && x._1 < dim && x._2 < dim && !path.contains(x) |
|
16 |
|
17 def moves_urban(x: Pos): List[Pos] = |
|
18 List(( 1, 2),( 2, 1),( 2, -1),( 1, -2), |
|
19 (-1, -2),(-2, -1),(-2, 1),(-1, 2)).map(add_pair_urban(x)) |
|
20 |
|
21 def legal_moves_urban(dim: Int, path: Path, x: Pos): List[Pos] = |
|
22 moves_urban(x).filter(is_legal_urban(dim, path)) |
|
23 |
|
24 def correct_urban(dim: Int)(p: Path): Boolean = p match { |
|
25 case Nil => true |
|
26 case x::Nil => true |
|
27 case x::y::p => if (legal_moves_urban(dim, p, y).contains(x)) correct_urban(dim)(y::p) else false |
|
28 } |
|
29 |
|
30 |
|
31 assert(count_all_tours_urban(1) == List(1)) |
|
32 assert(count_all_tours_urban(2) == List(0, 0, 0, 0)) |
|
33 assert(count_all_tours_urban(3) == List(0, 0, 0, 0, 0, 0, 0, 0, 0)) |
|
34 assert(count_all_tours_urban(4) == List(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0)) |
|
35 //assert(count_all_tours_urban(5) == List(304, 0, 56, 0, 304, 0, 56, 0, 56, 0, 56, 0, 64, 0, 56, 0, 56, 0, 56, 0, 304, 0, 56, 0, 304)) |
|
36 |
|
37 val ts00_urban = enum_tours(5, List((0, 0))) |
|
38 assert(ts00_urban.map(correct_urban(5)).forall(_ == true) == true) |
|
39 assert(ts00_urban.length == 304) |
|
40 |
|
41 val ts01_urban = enum_tours(5, List((0, 1))) |
|
42 assert(ts01_urban.map(correct_urban(5)).forall(_ == true) == true) |
|
43 assert(ts01_urban.length == 0) |
|
44 |
|
45 val ts02_urban = enum_tours(5, List((0, 2))) |
|
46 assert(ts02_urban.map(correct_urban(5)).forall(_ == true) == true) |
|
47 assert(ts02_urban.length == 56) |
|