-
Notifications
You must be signed in to change notification settings - Fork 18
Expand file tree
/
Copy pathsudoku.c
More file actions
187 lines (165 loc) · 3.39 KB
/
Copy pathsudoku.c
File metadata and controls
187 lines (165 loc) · 3.39 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
#define _POSIX_C_SOURCE 199309L
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
void print_puzzle(int puzzle[9][9]);
int valid_move(int puzzle[9][9], int x, int y, int val);
int solve_puzzle(int puzzle[9][9], int x, int y);
int valid_puzzle(int puzzle[9][9]);
void clear_screen();
int sudoku[9][9] = {
{3,0,0,0,2,0,0,7,0},
{9,0,0,5,0,0,0,1,4},
{0,1,6,3,7,0,0,0,8},
{2,0,0,8,0,0,0,0,1},
{5,0,0,0,4,1,8,0,0},
{0,8,9,0,0,0,0,5,0},
{0,0,5,0,1,0,2,8,0},
{0,4,0,0,0,6,0,9,3},
{7,3,1,0,8,2,0,0,0},
};
struct timespec ts;
int main(void)
{
ts.tv_sec = 0;
ts.tv_nsec = 50000000;
printf("Original Puzzle : \n");
print_puzzle(sudoku);
if (valid_puzzle(sudoku))
{
if (solve_puzzle(sudoku, 0, 0))
{
printf("The solved puzzle is : \n");
print_puzzle(sudoku);
}
else
{
printf("OOPS..The puzzle is not solvable :(\n");
}
}
else
{
printf("\nSorry, the given puzzle itself is wrong :)\n");
}
return 0;
}
int solve_puzzle(int puzzle[9][9], int x, int y)
{
nanosleep(&ts, NULL);
clear_screen();
print_puzzle(puzzle);
if (x == 9)
{
if (y == 8)
{
return 1;
}
y = y + 1;
x = 0;
}
if (puzzle[y][x] > 0)
{
return solve_puzzle(puzzle, x + 1, y);
}
for (int i = 1; i <= 9; i++)
{
if (valid_move(sudoku, x, y, i))
{
sudoku[y][x] = i;
if (solve_puzzle(sudoku, x + 1, y))
{
return 1;
}
sudoku[y][x] = 0;
}
}
return 0;
}
int valid_move(int puzzle[9][9], int x, int y, int val)
{
for (int i = 0; i < 9; i++)
{
if (puzzle[y][i] == val)
{
return 0;
}
if (puzzle[i][x] == val)
{
return 0;
}
}
int c = x - x % 3;
int r = y - y % 3;
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
if (puzzle[r + i][c + j] == val)
{
return 0;
}
}
}
return 1;
}
int valid_puzzle(int puzzle[9][9])
{
for (int i =0; i<9; i++)
{
for (int j = 0; j<9; j++)
{
if (puzzle[i][j]==0)
{
continue;
}
else
{
int temp = puzzle[i][j];
puzzle[i][j] = 0;
if (valid_move(puzzle, j, i, temp) == 0)
{
return 0;
}
puzzle[i][j] = temp;
}
}
}
return 1;
}
void print_puzzle(int puzzle[9][9])
{
printf("\n+-------+-------+-------+\n");
for (int i = 0; i < 9; i++)
{
if (i == 3 || i == 6)
{
printf("|-------+-------+-------|\n");
}
for (int j = 0; j < 9; j++)
{
if (j % 3 == 0)
{
printf("| ");
}
if (puzzle[i][j] != 0)
{
printf("%d ", puzzle[i][j]);
}
else
{
printf(" ");
}
}
printf("|");
printf("\n");
}
printf("+-------+-------+-------+\n");
}
void clear_screen()
{
#ifdef _WIN32
system("cls");
#else
system("clear");
#endif
}