Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.
A sudoku solution must satisfy all of the following rules:
Each of the digits
1-9
must occur exactly once in each row.Each of the digits
1-9
must occur exactly once in each column.Each of the the digits
1-9
must occur exactly once in each of the 93x3
sub-boxes of the grid.
Empty cells are indicated by the character '.'
.
A sudoku puzzle...

...and its solution numbers marked in red.

Note:
The given board contain only digits
1-9
and the character'.'
.You may assume that the given Sudoku puzzle will have a single unique solution.
The given board size is always
9x9
.
public class Solution {
public void solveSudoku(char[][] board) {
if (board == null || board.length == 0)
return;
solve(board);
}
public boolean solve(char[][] board) {
for (int i = 0; i < board.length; i++)
for (int j = 0; j < board[0].length; j++)
if (board[i][j] == '.') {
for (char c = '1'; c <= '9'; c++) // Try 1 -> 9
if (isValid(board, i, j, c)) {
board[i][j] = c; // Put c for this cell
if (solve(board))
return true; // If it's the solution return true
else
board[i][j] = '.'; // Backtrack
}
return false;
}
return true;
}
private boolean isValid(char[][] board, int row, int col, char c) {
for (int i = 0; i < 9; i++) {
if (board[i][col] != '.' && board[i][col] == c)
return false; // check row
if (board[row][i] != '.' && board[row][i] == c)
return false; // check column
if (board[3 * (row / 3) + i / 3][3 * (col / 3) + i % 3] != '.'
&& board[3 * (row / 3) + i / 3][3 * (col / 3) + i % 3] == c)
return false; // check 3*3 block
}
return true;
}
}
Last updated