Scribd
Upload
13 views4 pages

Ai Sudoko

Uploaded by

chrisgayle8759
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views4 pages

Ai Sudoko

Uploaded by

chrisgayle8759
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

LAB ASSIGNMEMENT 4

NAME : G PRANEETH
REG NO : 22BCE20029
COURSE CODE : CSE3002
SLOT : L5+L6

Program to Implement Sudoko in AI


CODE:
public class Sudoku {
static int N = 9;
static boolean solveSudoku(int grid[][], int row,
int col)
{
if (row == N - 1 && col == N)
return true;
if (col == N) {
row++;
col = 0;
}
if (grid[row][col] != 0)
return solveSudoku(grid, row, col + 1);
for (int num = 1; num < 10; num++) {
if (isSafe(grid, row, col, num)) {
grid[row][col] = num;
if (solveSudoku(grid, row, col + 1))
return true;
}
grid[row][col] = 0;
}
return false;
}
static void print(int[][] grid)
{
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++)
System.out.print(grid[i][j] + " ");
System.out.println();
}
}
static boolean isSafe(int[][] grid, int row, int col,
int num)
{
for (int x = 0; x <= 8; x++)
if (grid[row][x] == num)
return false;
for (int x = 0; x <= 8; x++)
if (grid[x][col] == num)
return false;
int startRow = row - row % 3, startCol
= col - col % 3;
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++)
if (grid[i + startRow][j + startCol] == num)
return false;

return true;
}
public static void main(String[] args)
{
int grid[][] = { { 3, 0, 6, 5, 0, 8, 4, 0, 0 },
{ 5, 2, 0, 0, 0, 0, 0, 0, 0 },
{ 0, 8, 7, 0, 0, 0, 0, 3, 1 },
{ 0, 0, 3, 0, 1, 0, 0, 8, 0 },
{ 9, 0, 0, 8, 6, 3, 0, 0, 5 },
{ 0, 5, 0, 0, 9, 0, 6, 0, 0 },
{ 1, 3, 0, 0, 0, 0, 2, 5, 0 },
{ 0, 0, 0, 0, 0, 0, 0, 7, 4 },
{ 0, 0, 5, 2, 0, 6, 3, 0, 0 } };

if (solveSudoku(grid, 0, 0))
print(grid);
else
System.out.println("No Solution exists");
}
}
OUTPUT

You might also like