-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsudokuSolver.c
89 lines (82 loc) · 1.78 KB
/
sudokuSolver.c
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
#include<stdio.h>
#include<stdlib.h>
#define SIZE 9
//SUDOKU
int matrix[9][9] = {
{6,5,0,8,7,3,0,9,0},
{0,0,3,2,5,0,0,0,8},
{9,8,0,1,0,4,3,5,7},
{1,0,5,0,0,0,0,0,0},
{4,0,0,0,0,0,0,0,2},
{0,0,0,0,0,0,5,0,3},
{5,7,8,3,0,1,0,2,6},
{2,0,0,0,4,8,9,0,0},
{0,9,0,6,2,5,0,8,1}
};
void print_sudoku(){
int i,j;
for(i=0;i<SIZE;i++){
for(j=0;j<SIZE;j++){
printf("%d\t",matrix[i][j]);
}
printf("\n\n");
}
}
int number_unassigned(int *row, int *col){
int num_unassign = 0;
int i,j;
for(i=0;i<SIZE;i++){
for(j=0;j<SIZE;j++){
if(matrix[i][j] == 0){
*row = i;
*col = j;
num_unassign = 1;
return num_unassign;
}
}
}
return num_unassign;
}
int is_safe(int n, int r, int c){
int i,j;
for(i=0;i<SIZE;i++){
if(matrix[r][i] == n)
return 0;
}
for(i=0;i<SIZE;i++){
if(matrix[i][c] == n)
return 0;
}
int row_start = (r/3)*3;
int col_start = (c/3)*3;
for(i=row_start;i<row_start+3;i++){
for(j=col_start;j<col_start+3;j++){
if(matrix[i][j]==n)
return 0;
}
}
return 1;
}
int solve_sudoku(){
int row;
int col;
if(number_unassigned(&row, &col) == 0)
return 1;
int n,i;
for(i=1;i<=SIZE;i++){
if(is_safe(i, row, col)){
matrix[row][col] = i;
if(solve_sudoku())
return 1;
matrix[row][col]=0;
}
}
return 0;
}
int main(){
if (solve_sudoku())
print_sudoku();
else
printf("No solution\n");
return 0;
}