mirrors/fltk
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix up new game code to expose at least one of every number in each axis

Browse Source 
so puzzles are solvable with a unique solution.


git-svn-id: file:///fltk/svn/fltk/branches/branch-1.1@4657 ea41ed52-d2ee-0310-a9c1-e6b18d33e121
This commit is contained in:
Michael R Sweet 2005-11-26 14:25:01 +00:00
parent 4a12c536fd
commit fd9a51e43b
1 changed files with 50 additions and 37 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

87
test/sudoku.cxx
View File

@ -496,48 +496,61 @@ Sudoku::new_game() {
// Show N cells, starting with potential confusing ones... // Show N cells, starting with potential confusing ones...
count = difficulty_; count = difficulty_;
for (i = 0; i < 9; i ++) { int numbers[9];
j = rand() % 9;
cell = grid_cells_[i][j];
for (m = 0; m < 9; m ++) for (i = 0; i < 9; i ++) numbers[i] = i + 1;
if (m != j && grid_values_[i][j] == grid_values_[i][m]) {
cell->value(grid_values_[i][j]);
cell->readonly(1);
cell->color(FL_GRAY);
count --;
}
}
for (j = 0; j < 9; j ++) {
do {
i = rand() % 9;
cell = grid_cells_[i][j];
} while (cell->readonly());
for (k = 0; k < 9; k ++)
if (k != i && grid_values_[i][j] == grid_values_[k][j]) {
cell->value(grid_values_[i][j]);
cell->readonly(1);
cell->color(FL_GRAY);
count --;
}
}
// Now show random fields...
while (count > 0) { while (count > 0) {
i = rand() % 9; for (i = 0; i < 20; i ++) {
j = rand() % 9; k = rand() % 9;
cell = grid_cells_[i][j]; m = rand() % 9;
t = numbers[k];
numbers[k] = numbers[m];
numbers[m] = t;
}
if (!cell->readonly()) { for (i = 0; count > 0 && i < 9; i ++) {
cell->value(grid_values_[i][j]); t = numbers[i];
cell->readonly(1);
cell->color(FL_GRAY);
count --; for (j = 0; count > 0 && j < 9; j ++) {
cell = grid_cells_[i][j];
if (grid_values_[i][j] == t && !cell->readonly()) {
cell->value(grid_values_[i][j]);
cell->readonly(1);
cell->color(FL_GRAY);
count --;
break;
}
}
}
if (count <= 0) break;
for (i = 0; i < 20; i ++) {
k = rand() % 9;
m = rand() % 9;
t = numbers[k];
numbers[k] = numbers[m];
numbers[m] = t;
}
for (j = 0; count > 0 && j < 9; j ++) {
t = numbers[j];
for (i = 0; count > 0 && i < 9; i ++) {
cell = grid_cells_[i][j];
if (grid_values_[i][j] == t && !cell->readonly()) {
cell->value(grid_values_[i][j]);
cell->readonly(1);
cell->color(FL_GRAY);
count --;
break;
}
}
} }
} }
} }