Newer
Older
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
#include <stdlib.h>
#include "sudoku.hh"
bool Grid::verbose = false;
int main(int argc, char *argv[])
{
if (argc != 2 && argc !=3) {
std::cerr << "Usage: sudoku [-v] file" << std::endl;
return 1;
}
if (argc == 3 && (argv[1] == "-v" || argv[2] == "-v"))
Grid::verbose = true;
Grid *grid = new Grid();
grid->load(argv[Grid::verbose ? 1 : 2]);
grid->print();
grid->resolve();
if (grid->verify()) {
std::cout << "Solution found." << std::endl;
grid->print();
}
}
//
// GRID
//
int Grid::load(const char *filename)
{
int val;
std::fstream fs;
std::cout << "coucou";
try {
fs.open(filename);
std::cout << "sex";
}
catch (...) {
std::cout << "sex";
}
std::cout << filename << std::endl;
for (int i = 0; i < GRID_SIDE; ++i)
for (int j = 0; j < GRID_SIDE; ++j) {
fs >> std::dec >> val;
std::cout << val << std::endl;
//block_[i][j].set(val);
}
fs.close();
return 0;
}
void Grid::resolve()
{
}
void Grid::print() const
{
int i, j;
for (i = 0; i < GRID_SIDE; ++i) {
//show first line
for (j = 0; j < GRID_SIDE; j += 3)
if (j == GRID_SIDE - 3) std::cout << " --- --- ---" << std::endl;
else std::cout << " --- --- --- ";
//show nine group separator
if (i > 0 && i % 3 == 0) {
std::cout << std::endl;
for (j = 0; j < GRID_SIDE; j += 3)
if (j == GRID_SIDE - 3) std::cout << " --- --- ---" << std::endl;
else std::cout << " --- --- --- ";
}
std::cout << "|";
for (j = 0; j < GRID_SIDE; ++j) {
if (j > 0 && j % 3 == 0) std::cout << " |";
std::cout << " " << block_[i][j].get() << " |";
}
std::cout << std::endl;
}
for (j = 0; j < GRID_SIDE; j += 3)
if (j == GRID_SIDE - 3) std::cout << " --- --- ---" << std::endl;
else std::cout << " --- --- --- ";
}
bool Grid::is_done() const
{
for (int i = 0; i < GRID_SIDE; ++i)
for (int j = 0; j < GRID_SIDE; ++j)
if (block_[i][j].get() == 0)
return false;
return true;
}
bool Grid::verify() const
{
bool vertical_line[GRID_SIDE];
bool horizontal_line[GRID_SIDE];
int tmp;
// check horizontals and verticales
for (int i = 0; i < GRID_SIDE; ++i) {
for (int j = 0; j < GRID_SIDE; ++j)
horizontal_line[j] = vertical_line[j] = false;
for (int j = 0; j < GRID_SIDE; ++j) {
//horizontals
tmp = block_[i][j].get() - 1;
if (tmp < 0 || horizontal_line[tmp])
return false;
horizontal_line[tmp] = true;
//verticals
tmp = block_[j][i].get() - 1;
if (tmp < 0 || vertical_line[tmp] == true)
return false;
vertical_line[tmp] = true;
}
for (int j = 0; j < GRID_SIDE; ++j)
if (!vertical_line[j] || !horizontal_line[j])
return false;
}
// check nine blocks (use vertical_block)
for (int j = 0; j < GRID_SIDE; ++j)
vertical_line[j] = false;
for (int i = 0; i < GRID_SIDE; i += 3)
for (int j = 0; j < GRID_SIDE; j += 3)
for (int k = 0; k < 3; ++k)
for (int l = 0; l < 3; ++l) {
tmp = block_[i + k][j + l].get() - 1;
if (tmp < 0 || vertical_line[tmp] == true)
return false;
vertical_line[tmp] = true;
}
for (int j = 0; j < GRID_SIDE; ++j)
if (!vertical_line[j])
return false;
return true;
}