爬山法八皇后问题python代码

以下是爬山法解决八皇后问题的Python代码：

import random

# 生成初始状态
def initial_state():
    state = [0, 1, 2, 3, 4, 5, 6, 7]
    random.shuffle(state)
    return state

# 计算冲突数
def conflict_num(state):
    num = 0
    for i in range(len(state)):
        for j in range(i+1, len(state)):
            if state[i] == state[j] or abs(state[i]-state[j]) == j-i:
                num += 1
    return num

# 爬山法求解
def hill_climbing():
    state = initial_state()
    while True:
        conflicts = conflict_num(state)
        if conflicts == 0:
            return state
        next_states = []
        for i in range(len(state)):
            for j in range(i+1, len(state)):
                new_state = state.copy()
                new_state[i], new_state[j] = new_state[j], new_state[i]
                next_states.append(new_state)
        next_states_conflicts = [conflict_num(s) for s in next_states]
        min_conflicts = min(next_states_conflicts)
        if min_conflicts >= conflicts:
            return state
        min_index = next_states_conflicts.index(min_conflicts)
        state = next_states[min_index]

# 输出结果
result = hill_climbing()
print(result)

该代码使用了爬山法求解八皇后问题，其中`initial_state()`函数用于生成初始状态，`conflict_num(state)`函数用于计算冲突数，`hill_climbing()`函数用于实现爬山法求解。在到达局部最优状态时，允许任意一对皇后横向移动，以避免陷入局部最优解。最终输出的结果是一个长度为8的列表，表示每一行皇后所在的列数。