可以使用递归函数和回溯算法来解决九宫格数独问题。以下是一个简单的 Python 代码示例：
```python
def solve(board):
"""
Solve the Sudoku puzzle using recursive backtracking.
:param board: 2D list of integers representing the Sudoku puzzle
:return: boolean indicating if the puzzle is solved
"""
empty_cell = find_empty(board)
if not empty_cell:
return True
row, col = empty_cell
for num in range(1, 10):
if is_valid(board, row, col, num):
board[row][col] = num
if solve(board):
return True
board[row][col] = 0
return False
def find_empty(board):
"""
Find an empty cell in the Sudoku puzzle.
:param board: 2D list of integers representing the Sudoku puzzle
:return: tuple containing the row and column of an empty cell, or None if there are no empty cells
"""
for row in range(9):
for col in range(9):
if board[row][col] == 0:
return (row, col)
return None
def is_valid(board, row, col, num):
"""
Check if a number can be placed in a given cell in the Sudoku puzzle.
:param board: 2D list of integers representing the Sudoku puzzle
:param row: integer representing the row of the cell to check
:param col: integer representing the column of the cell to check
:param num: integer representing the number to check
:return: boolean indicating if the number can be placed in the cell
"""
# Check row
for i in range(9):
if board[row][i] == num:
return False
# Check column
for i in range(9):
if board[i][col] == num:
return False
# Check square
square_row = (row // 3) * 3
square_col = (col // 3) * 3
for i in range(square_row, square_row + 3):
for j in range(square_col, square_col + 3):
if board[i][j] == num:
return False
return True
```
使用该函数，您可以通过以下方式调用它：
```python
board = [
[0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0]
]
solve(board)
for row in board:
print(row)
```
该代码将打印已解决数独的完整板。
2864
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
