112
edits
Changes
→Assignment 2
|}
__global__ void superSolve(int * d_a) {
//Used to remember which sections row | col | box ( section ) have which values
__shared__ bool rowHas[N][N];
__shared__ bool colHas[N][N];
//Unique identifier for each square in row, col, box
//Corresponds to the generic Sudoku Solve
//Using a Sudoku to solve a Sudoku !!!
int offset = col + (row % BOXWIDTH) * BOXWIDTH + (box % BOXWIDTH);
if (at == UNASSIGNED) {
//Find values which can go in only one spot in the row | grid | boxsection
for (int idx = 0; idx < N; ++idx) {
if (!(rowHas[row][idx] || colHas[col][idx] || boxHas[box][idx]) &&
}
}
=== Assignment 3 ===
