forked from flocho/udvl
-
Notifications
You must be signed in to change notification settings - Fork 0
/
cv02test.cpp
67 lines (57 loc) · 1.67 KB
/
cv02test.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#define CATCH_CONFIG_MAIN
#include "../tools/cpp/catch.hpp"
#include "NQueens.h"
template <class T>
std::ostream& operator<<(std::ostream&os, const std::vector<T>& v)
{
os<<"(";
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(os, ", "));
return os<<")";
}
std::ostream& operator<<(std::ostream&os, const NQueens::Queen &q)
{
return os << "(" << q.r << "," << q.c << ")";
}
void testQueens(int N) {
CAPTURE(N);
NQueens nqueens;
auto queens = nqueens.solve(N);
CAPTURE(queens);
if (N == 2 || N == 3) {
INFO("There is not solution for " << N);
REQUIRE(queens.size() == 0);
}
else {
REQUIRE(queens.size() == N);
for(auto &q : queens) {
INFO("Bad coordinates for queen q=" << q);
REQUIRE(q.r >= 0);
REQUIRE(q.r < N);
REQUIRE(q.c >= 0);
REQUIRE(q.c < N);
}
for(auto q1 = queens.begin(); q1 != queens.end(); ++q1) {
for(auto q2 = q1 + 1; q2 != queens.end(); ++q2) {
INFO("Queens in the same row/column " << *q1 << " " << *q2);
REQUIRE(q1->r != q2->r);
REQUIRE(q1->c != q2->c);
}
}
for(auto q1 = queens.begin(); q1 != queens.end(); ++q1) {
for(auto q2 = q1 + 1; q2 != queens.end(); ++q2) {
INFO("Queens on the same diagonal " << *q1 << " " << *q2);
REQUIRE((q1->r + q2->c) != (q1->c + q2->r));
REQUIRE((q1->r + q1->c) != (q2->c + q2->r));
}
}
}
}
TEST_CASE("nqueens0") { testQueens(0); }
TEST_CASE("nqueens1") { testQueens(1); }
TEST_CASE("nqueens2") { testQueens(2); }
TEST_CASE("nqueens3") { testQueens(3); }
TEST_CASE("nqueens4") { testQueens(4); }
TEST_CASE("nqueens5") { testQueens(5); }
TEST_CASE("nqueens6") { testQueens(6); }
TEST_CASE("nqueens7") { testQueens(7); }
TEST_CASE("nqueens8") { testQueens(8); }