用Python中存储在1D列表中的Board检查N-Queens问题的非法位置

def is_valid(board):
    n = len(board)
    for i in range(n):
        for j in range(i+1, n):
            if board[i] == board[j] or abs(board[i] - board[j]) == abs(i - j):
                return False
    return True

def solve_n_queens(n):
    solutions = []
    board = [-1] * n

    def backtrack(row):
        if row == n:
            if is_valid(board):
                solutions.append(board[:])
            return
        for col in range(n):
            board[row] = col
            backtrack(row + 1)

    backtrack(0)
    return solutions

n = 8  # 棋盘大小
solutions = solve_n_queens(n)
print(f"共有 {len(solutions)} 种解法：")
for solution in solutions:
    print(solution)