import numpy as np
import random
 
# 棋盘大小
N = 8
 
# 适应度函数
def fitness(individual):
    queens = np.where(individual == 1)[0]
    conflicts = 0
    for i in range(len(queens)):
        for j in range(i+1, len(queens)):
            if queens[i] == queens[j] or
               queens[i] - queens[j] == i - j or
               queens[i] - queens[j] == j - i:
                conflicts += 1
    return len(queens) - conflicts
 
# 初始化种群
def init_population(population_size):
    population = []
    for _ in range(population_size):
        individual = np.zeros(N, dtype=int)
        for _ in range(N):
            position = random.randint(0, N-1)
            while individual[position] == 1:
                position = random.randint(0, N-1)
            individual[position] = 1
        population.append(individual)
    return population
 
# ... (此处省略选择、交叉、变异等函数的实现)
 
# 主程序
population_size = 100
generations = 100
population = init_population(population_size)
 
for generation in range(generations):
    # ... (此处省略选择、交叉、变异等操作)
 
    # 输出最优解
    best_individual = max(population, key=fitness)
    print(f"Generation {generation}: Best Fitness = {fitness(best_individual)}")
    print(best_individual)
```