蓝桥杯算法提高VIP-8皇后·改 -题解(Python代码)

代码如下：（改自八皇后问题）

board=[[0,0,0,0,0,0,0,0],
       [0,0,0,0,0,0,0,0],
       [0,0,0,0,0,0,0,0],
       [0,0,0,0,0,0,0,0],
       [0,0,0,0,0,0,0,0],
       [0,0,0,0,0,0,0,0],
       [0,0,0,0,0,0,0,0],
       [0,0,0,0,0,0,0,0]]
data=[]
for i in range(8):
    x=[]
    x=list(map(int,input().split()))
    data.append(x)
max1=0
def can_put(x,y):
    #1.判断x行是否有皇后
    for i in range(0,y):
        if board[x][i]==1:
            return False
    #2.判断y列是否有皇后
    for i in range(0,x):
        if board[i][y]==1:
            return False
    #3.判断/方向是否有皇后
    for i in range(0,x):
        if x+y-i<=7 and board[i][x+y-i]==1:
            return False
    #4.判断\方向是否有皇后
    #enumerate为执行循环次数，从0开始，index为他的值
    for index,i in enumerate(range(x-1,-1,-1)):
        if y-index-1>=0 and board[i][y-index-1]==1:
            return False
    return True
def put_queen(step):
    if step==8:
        js()
    else:
        for i in range(8):
            if can_put(step,i)==True:
                #1.布置现场
                board[step][i]=1
                #2.开始递归
                put_queen(step+1)
                #3.恢复现场
                board[step][i]=0
def js():
    global max1
    s=0
    for i in range(8):
        for j in range(8):
            if board[i][j]==1:
                s=s+data[i][j]
    if s>max1:
        max1=s
put_queen(0)
print(max1)

套用了八皇后的模板，稍加改动即可。