如何检查二维数组的相邻索引- Othello

def check_adjacent_indices(board):
    rows = len(board)
    cols = len(board[0])
    flips = 0

    for i in range(rows):
        for j in range(cols):
            if board[i][j] != 0:  # 非空方格
                for dx in [-1, 0, 1]:
                    for dy in [-1, 0, 1]:
                        if dx == 0 and dy == 0:
                            continue  # 忽略当前方格
                        x = i + dx
                        y = j + dy
                        if 0 <= x < rows and 0 <= y < cols and board[x][y] != 0 and board[x][y] != board[i][j]:
                            # 相邻方格有效且状态相反
                            flips += 1

    return flips