-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolver_tests.cpp
154 lines (131 loc) · 2.39 KB
/
solver_tests.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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
#include "gtest/gtest.h"
#include "solver.h"
// All directions one step, resulting in complete freedom
class FreedomRuleSet : public IRuleSet
{
public:
int NextX(unsigned int currentX, Direction direction)
{
if (currentX == (unsigned int)-1)
{
return -1;
}
int result = currentX;
switch (direction)
{
case TOP:
result = currentX;
break;
case TOP_RIGHT:
result = currentX + 1;
break;
case RIGHT:
result = currentX + 1;
break;
case BOTTOM_RIGHT:
result = currentX + 1;
break;
case BOTTOM:
result = currentX;
break;
case BOTTOM_LEFT:
result = currentX - 1;
break;
case LEFT:
result = currentX - 1;
break;
case TOP_LEFT:
result = currentX - 1;
break;
default: break;
}
return result;
};
int NextY(unsigned int currentY, Direction direction)
{
if (currentY == (unsigned int)-1)
{
return -1;
}
int result = currentY;
switch (direction)
{
case TOP:
result = currentY - 1;
break;
case TOP_RIGHT:
result = currentY - 1;
break;
case RIGHT:
result = currentY;
break;
case BOTTOM_RIGHT:
result = currentY + 1;
break;
case BOTTOM:
result = currentY + 1;
break;
case BOTTOM_LEFT:
result = currentY + 1;
break;
case LEFT:
result = currentY;
break;
case TOP_LEFT:
result = currentY - 1;
break;
default: break;
}
return result;
};
};
TEST(Solver, Solve_DefaultRules_ZeroByZeroGrid_ReturnsFalse)
{
// Arrange
DefaultRuleSet ruleSet;
Solver s;
// Act
bool result = s.solve(0, 0, ruleSet);
// Assert
ASSERT_FALSE(result);
}
TEST(Solver, Solve_DefaultRules_ZeroByOneGrid_ReturnsFalse)
{
// Arrange
DefaultRuleSet ruleSet;
Solver s;
// Act
bool result = s.solve(0, 1, ruleSet);
// Assert
ASSERT_FALSE(result);
}
TEST(Solver, Solve_DefaultRules_OneByZeroGrid_ReturnsFalse)
{
// Arrange
DefaultRuleSet ruleSet;
Solver s;
// Act
bool result = s.solve(1, 0, ruleSet);
// Assert
ASSERT_FALSE(result);
}
TEST(Solver, Solve_DefaultRules_OneByOneGrid_ReturnsTrue)
{
// Arrange
DefaultRuleSet ruleSet;
Solver s;
// Act
bool result = s.solve(1, 1, ruleSet);
// Assert
ASSERT_TRUE(result);
}
TEST(Solver, Solve_FreedomRuleSet_TwoByTwoGrid_ReturnsTrue)
{
// Arrange
FreedomRuleSet ruleSet;
Solver s;
// Act
bool result = s.solve(2, 2, ruleSet);
// Assert
ASSERT_TRUE(result);
}