Only apply rules to rows
It goes faster this way.
This commit is contained in:
parent
119270c89b
commit
5aea129dc9
35
solve.c
35
solve.c
@ -83,7 +83,7 @@ static enum apply_res apply_rules(struct sudoku *sud, cellgroup *group)
|
||||
int solve(struct sudoku *sud)
|
||||
{
|
||||
cellgroup group = { 0 };
|
||||
unsigned r, c, i, j, n;
|
||||
unsigned r, c, n;
|
||||
bool match;
|
||||
enum apply_res res;
|
||||
|
||||
@ -105,39 +105,6 @@ int solve(struct sudoku *sud)
|
||||
match = true;
|
||||
}
|
||||
|
||||
/* Apply rules to each column. */
|
||||
for (c = 0; c < NDIGITS; ++c) {
|
||||
for (r = 0; r < NDIGITS; ++r) {
|
||||
group[r].row = r;
|
||||
group[r].col = c;
|
||||
group[r].state = &sud->cells[r][c];
|
||||
}
|
||||
|
||||
res = apply_rules(sud, &group);
|
||||
if (res == ERROR)
|
||||
return -1;
|
||||
else if (res == MATCH)
|
||||
match = true;
|
||||
}
|
||||
|
||||
/* Apply rules to each segment. */
|
||||
for (i = 0; i < NDIGITS; ++i) {
|
||||
for (j = 0; j < NDIGITS; ++j) {
|
||||
r = 3 * (i / 3) + j / 3;
|
||||
c = 3 * (i % 3) + j % 3;
|
||||
|
||||
group[j].row = r;
|
||||
group[j].col = c;
|
||||
group[j].state = &sud->cells[r][c];
|
||||
}
|
||||
|
||||
res = apply_rules(sud, &group);
|
||||
if (res == ERROR)
|
||||
return -1;
|
||||
else if (res == MATCH)
|
||||
match = true;
|
||||
}
|
||||
|
||||
/* Exit if no matches. */
|
||||
if (!match)
|
||||
return n;
|
||||
|
Loading…
x
Reference in New Issue
Block a user