Repository navigation
Expand file tree
/
Copy pathBoard.cpp
More file actions
365 lines (321 loc) · 6.14 KB
/
Copy pathBoard.cpp
File metadata and controls
365 lines (321 loc) · 6.14 KB
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
/*
* board.cpp
*
* Created on: May 11, 2009
* Author: "Benson Che"
*/
#include "Board.h"
#include <math.h>
// Creates a new board from the input file
Board::Board(string filename)
{
ifstream in;
in.open(filename.c_str(), ifstream::in);
if(!in)
{
cerr << "Error: file not found: " << filename << endl;
exit(1);
}
// Assumes correct formatting of input file
in >> size;
// allocates the arrays
grid = new int*[size];
invalid_moves = new bool**[size];
for(int i=0; i<size; i++)
{
grid[i] = new int[size];
invalid_moves[i] = new bool*[size];
for(int j=0; j<size; j++)
{
grid[i][j] = 0;
invalid_moves[i][j] = new bool[size];
for(int k=0; k<size; k++)
invalid_moves[i][j][k] = false;
}
}
int initial_values;
in >> initial_values;
// initialize the array
for(int i=0; i<initial_values; i++)
{
int row, col, value;
in >> row;
in >> col;
in >> value;
grid[row-1][col-1] = value;
}
}
// Clones the board
Board::Board(Board *old)
{
size = old->size;
grid = new int*[size];
invalid_moves = new bool**[size];
for(int i=0; i<size; i++)
{
grid[i] = new int[size];
invalid_moves[i] = new bool*[size];
for(int j=0; j<size; j++)
{
grid[i][j] = old->grid[i][j];
invalid_moves[i][j] = new bool[size];
for(int k=0; k<size; k++)
invalid_moves[i][j][k] = old->invalid_moves[i][j][k];
}
}
}
// Clones the board and add the assignment
Board::Board(Board *old, int row, int col, int value)
{
size = old->size;
grid = new int*[size];
invalid_moves = new bool**[size];
for(int i=0; i<size; i++)
{
grid[i] = new int[size];
invalid_moves[i] = new bool*[size];
for(int j=0; j<size; j++)
{
grid[i][j] = old->grid[i][j];
invalid_moves[i][j] = new bool[size];
for(int k=0; k<size; k++)
invalid_moves[i][j][k] = old->invalid_moves[i][j][k];
}
}
grid[row][col] = value;
}
Board::~Board()
{
for(int i=0; i<size; i++)
{
for(int j=0; j<size; j++)
delete[] invalid_moves[i][j];
delete[] invalid_moves[i];
delete[] grid[i];
}
delete invalid_moves;
delete grid;
}
// Returns the number of digits, solely used for printing
int get_digits(int num)
{
int digits = 1;
int step = 10;
while(step <= num)
{
step *= 10;
digits++;
}
return digits;
}
// whether the move is ruled out by forward checking
bool Board::is_valid_move(int row, int col, int value)
{
return !invalid_moves[row][col][value-1];
}
int Board::get_assignment(int row, int col)
{
return grid[row][col];
}
// marks all the invalid moves caused by this new assignment
void Board::forward_checking(int row, int col)
{
int value = grid[row][col];
if(!value)
return;
for(int i=0; i<size; i++)
{
invalid_moves[row][i][value-1] = true;
invalid_moves[i][col][value-1] = true;
}
int root = sqrt(size);
int row_root, col_root;
for(row_root=0; row_root<root; row_root++)
if(row < (row_root + 1) * root)
break;
for(col_root=0; col_root<root; col_root++)
if(col < (col_root + 1) * root)
break;
for(int i=0; i< root; i++)
for(int j=0; j<root; j++)
invalid_moves[i+row_root*root][j+col_root*root][value-1] = true;
invalid_moves[row][col][value-1] = false;
}
int Board::get_size()
{
return size;
}
void Board::print_board()
{
int digits = get_digits(size);
int root = sqrt(size);
cout << "++";
for(int i=0; i<size; i++)
{
cout << "=";
for(int j=0; j<digits; j++)
cout << "=";
cout << "=+";
if(!((i+1) % root))
cout << "+";
}
cout << endl;
for(int i=0; i<size; i++)
{
cout << "||";
for(int j=0; j<size; j++)
{
if(grid[i][j])
{
cout << " " << grid[i][j];
for(int k=0; k<digits-get_digits(grid[i][j]); k++)
cout << " ";
cout << " |";
}
else
{
cout << " ";
for(int k=0; k<digits; k++)
cout << " ";
cout << " |";
}
if(!((j+1) % root))
cout << "|";
}
cout << endl;
cout << "++";
for(int j=0; j<size; j++)
{
if((i+1) % root)
{
cout << "-";
for(int k=0; k<digits; k++)
cout << "-";
cout << "-+";
}
else
{
cout << "=";
for(int k=0; k<digits; k++)
cout << "=";
cout << "=+";
}
if(!((j+1) % root))
cout << "+";
}
cout << endl;
}
}
// true when it is complete
bool Board::is_complete()
{
if(is_valid_board())
{
for(int i=0; i< size; i++)
for(int j=0; j<size; j++)
if(!grid[i][j])
return false;
return true;
}
return false;
}
// consistency check
bool Board::is_valid_board()
{
bool exists1[size], exists2[size];
// Checks horizontal and vertical
for(int i=0; i<size; i++)
{
for(int j=0; j<size; j++)
exists1[j] = exists2[j] = false;
for(int j=0; j<size; j++)
{
if(grid[i][j])
{
if(exists1[grid[i][j]-1])
return false;
else
exists1[grid[i][j]-1] = true;
// Checking if there are any valid moves
bool not_valid = true;
for(int k=0; k<size; k++)
if(!invalid_moves[i][j][k])
{
not_valid = false;
break;
}
if(not_valid)
return false;
}
if(grid[j][i])
{
if(exists2[grid[j][i]-1])
{
return false;
}
else
exists2[grid[j][i]-1] = true;
}
}
}
// Checking each sub-grid
int root = sqrt(size);
for(int i=0; i<size; i+=root)
for(int j=0; j<size; j+=root)
{
for(int k=0; k<size; k++)
exists1[k] = false;
for(int k=0; k<root; k++)
for(int l=0; l<root; l++)
if(grid[k+i][l+j])
{
if(exists1[grid[k+i][l+j]-1])
return false;
else
exists1[grid[k+i][l+j]-1] = true;
}
}
return true;
}
// selects the next variable to check, whether using MRV or not
void Board::select_var(int *row, int *col, bool mrv)
{
if(mrv)
{
int min = size + 1;
for(int i=0; i<size; i++)
for(int j=0; j<size; j++)
{
if(!grid[i][j])
{
int count = 0;
for(int k=0; k<size; k++)
if(!invalid_moves[i][j][k])
count++;
if(count < min)
{
*row = i;
*col = j;
min = count;
if(count == 1)
return;
}
}
}
}
else
{
for(int i=0; i<size; i++)
for(int j=0; j<size; j++)
if(!grid[i][j])
{
*row = i;
*col = j;
return;
}
}
}
void Board::mark_move_invalid(int row, int col, int value)
{
invalid_moves[row][col][value-1] = true;
}