8皇后问题如何在回溯算法工作时显示棋盘上的位置

def solve_n_queens(n):
    # 初始化棋盘
    board = [[0] * n for _ in range(n)]
    solutions = []

    def backtrack(row):
        # 找到一个解
        if row == n:
            solutions.append(board.copy())
            return

        for col in range(n):
            if is_valid(row, col):
                # 放置皇后
                board[row][col] = 1
                # 继续下一行
                backtrack(row + 1)
                # 回溯，撤销皇后的放置
                board[row][col] = 0

    def is_valid(row, col):
        # 检查当前位置是否与已放置的皇后冲突
        for i in range(row):
            if board[i][col] == 1:
                return False
            if col - (row - i) >= 0 and board[i][col - (row - i)] == 1:
                return False
            if col + (row - i) < n and board[i][col + (row - i)] == 1:
                return False
        return True

    # 从第一行开始回溯
    backtrack(0)

    # 打印所有解的位置
    for solution in solutions:
        print_solution(solution)

def print_solution(board):
    for row in board:
        print(row)

# 解决8皇后问题
solve_n_queens(8)