八皇后问题求解方法

八皇后问题

问题描述

    八皇后问题，即在8*8的棋盘上，放8个皇后，让她们相互之间不能吃，共有多少种摆法(备注：国际象棋中的皇后，能够横向、竖向、对角方向吃掉任何直接面对的棋子，但不能跳过第一个吃后方的子)。其中一种摆法如下图示：
                                 
                                      图片1. 八皇后问题的棋子一种摆法

实现思路

     将棋盘抽象成8*8的稀疏矩阵A，放皇后处数值为1，其他位置数值为0。因为八皇后问题的特性，矩阵A满足一下条件：1. 任意行只有1个元素为1，其余为0；2. 任意列只有一个元素为1，其余为0；3. 任意一条左上至右下对角线，只有一个元素为1，其余为0；4. 任意一条右上至左下的对角线，只有一个元素为1，其余为0。
     要生成满足以上条件的矩阵A，流程如下：1. 从第一列开始，该列中某个元素赋值为1；2. 给下一列中满足条件的位置赋值为1；3. 继续执行步骤2到第8列；4. 如果全部满足条件，输出结果，返回上一列，搜索其他位置；如果中间到某一步不存在满足条件的位置，停止执行，并返回上一列，搜索上一列的其他位置。

代码实现

     用Python可以很方便的实现上述流程。代码如下：

EightQueens = []
EightQueen = []
for i1 in range(1, 9, 1):
    Matrix1 = [i1]
    for i2 in range(1, 9, 1):
        if i2 == Matrix1[0]:
            continue
        if i2 == Matrix1[0] - 1:
            continue
        if i2 == Matrix1[0] + 1:
            continue
        Matrix2 = [i1, i2]
        for i3 in range(1, 9, 1):
            s3 = 0
            for t3 in range(1, 3, 1):
                if i3 == Matrix2[t3 - 1]:
                    s3 = 1
                    break
                if i3 == Matrix2[t3 - 1] + (t3 - 3):
                    s3 = 1
                    break
                if i3 == Matrix2[t3 - 1] - (t3 - 3):
                    s3 = 1
                    break
            if s3 == 1:
                continue
            Matrix3 = [i1, i2, i3]
            for i4 in range(1, 9, 1):
                s4 = 0
                for t4 in range(1, 4, 1):
                    if i4 == Matrix3[t4 - 1]:
                        s4 = 1
                        break
                    if i4 == Matrix3[t4 - 1] + (t4 - 4):
                        s4 = 1
                        break
                    if i4 == Matrix3[t4 - 1] - (t4 - 4):
                        s4 = 1
                        break
                if s4 == 1:
                    continue
                Matrix4 = [i1, i2, i3, i4]
                for i5 in range(1, 9, 1):
                    s5 = 0
                    for t5 in range(1, 5, 1):
                        if i5 == Matrix4[t5 - 1]:
                            s5 = 1
                            break
                        if i5 == Matrix4[t5 - 1] + t5 - 5:
                            s5 = 1
                            break
                        if i5 == Matrix4[t5 - 1] - t5 + 5:
                            s5 = 1
                            break
                    if s5 == 1:
                        continue
                    Matrix5 = [i1, i2, i3, i4, i5]
                    for i6 in range(1, 9, 1):
                        s6 = 0
                        for t6 in range(1, 6, 1):
                            if i6 == Matrix5[t6 - 1]:
                                s6 = 1
                                break
                            if i6 == Matrix5[t6 - 1] + t6 - 6:
                                s6 = 1
                                break
                            if i6 == Matrix5[t6 - 1] - t6 + 6:
                                s6 = 1
                                break
                        if s6 == 1:
                            continue
                        Matrix6 = [i1, i2, i3, i4, i5, i6]
                        for i7 in range(1, 9, 1):
                            s7 = 0
                            for t7 in range(1, 7, 1):
                                if i7 == Matrix6[t7 - 1]:
                                    s7 = 1
                                    break
                                if i7 == Matrix6[t7 - 1] + t7 - 7:
                                    s7 = 1
                                    break
                                if i7 == Matrix6[t7 - 1] - t7 + 7:
                                    s7 = 1
                                    break
                            if s7 == 1:
                                continue
                            Matrix7 = [i1, i2, i3, i4, i5, i6, i7]
                            for i8 in range(1, 9, 1):
                                s8 = 0
                                for t8 in range(1, 8, 1):
                                    if i8 == Matrix7[t8 - 1]:
                                        s8 = 1
                                        break
                                    if i8 == Matrix7[t8 - 1] + t8 - 8:
                                        s8 = 1
                                        break
                                    if i8 == Matrix7[t8 - 1] - t8 + 8:
                                        s8 = 1
                                        break
                                if s8 == 1:
                                    continue
                                Matrix8 = [i1, i2, i3, i4, i5, i6, i7, i8]
                                EightQueens.append(Matrix8)
count_Queens = len(EightQueens)
print(count_Queens)
for i in range(count_Queens):
    print(EightQueens[i])

运行结果

     上述代码可以求出解的总数和具体的每组解，运行结果如下：
92
[1, 5, 8, 6, 3, 7, 2, 4]
[1, 6, 8, 3, 7, 4, 2, 5]
[1, 7, 4, 6, 8, 2, 5, 3]
[1, 7, 5, 8, 2, 4, 6, 3]
[2, 4, 6, 8, 3, 1, 7, 5]
[2, 5, 7, 1, 3, 8, 6, 4]
[2, 5, 7, 4, 1, 8, 6, 3]
[2, 6, 1, 7, 4, 8, 3, 5]
[2, 6, 8, 3, 1, 4, 7, 5]
[2, 7, 3, 6, 8, 5, 1, 4]
[2, 7, 5, 8, 1, 4, 6, 3]
[2, 8, 6, 1, 3, 5, 7, 4]
[3, 1, 7, 5, 8, 2, 4, 6]
[3, 5, 2, 8, 1, 7, 4, 6]
[3, 5, 2, 8, 6, 4, 7, 1]
[3, 5, 7, 1, 4, 2, 8, 6]
[3, 5, 8, 4, 1, 7, 2, 6]
[3, 6, 2, 5, 8, 1, 7, 4]
[3, 6, 2, 7, 1, 4, 8, 5]
[3, 6, 2, 7, 5, 1, 8, 4]
[3, 6, 4, 1, 8, 5, 7, 2]
[3, 6, 4, 2, 8, 5, 7, 1]
[3, 6, 8, 1, 4, 7, 5, 2]
[3, 6, 8, 1, 5, 7, 2, 4]
[3, 6, 8, 2, 4, 1, 7, 5]
[3, 7, 2, 8, 5, 1, 4, 6]
[3, 7, 2, 8, 6, 4, 1, 5]
[3, 8, 4, 7, 1, 6, 2, 5]
[4, 1, 5, 8, 2, 7, 3, 6]
[4, 1, 5, 8, 6, 3, 7, 2]
[4, 2, 5, 8, 6, 1, 3, 7]
[4, 2, 7, 3, 6, 8, 1, 5]
[4, 2, 7, 3, 6, 8, 5, 1]
[4, 2, 7, 5, 1, 8, 6, 3]
[4, 2, 8, 5, 7, 1, 3, 6]
[4, 2, 8, 6, 1, 3, 5, 7]
[4, 6, 1, 5, 2, 8, 3, 7]
[4, 6, 8, 2, 7, 1, 3, 5]
[4, 6, 8, 3, 1, 7, 5, 2]
[4, 7, 1, 8, 5, 2, 6, 3]
[4, 7, 3, 8, 2, 5, 1, 6]
[4, 7, 5, 2, 6, 1, 3, 8]
[4, 7, 5, 3, 1, 6, 8, 2]
[4, 8, 1, 3, 6, 2, 7, 5]
[4, 8, 1, 5, 7, 2, 6, 3]
[4, 8, 5, 3, 1, 7, 2, 6]
[5, 1, 4, 6, 8, 2, 7, 3]
[5, 1, 8, 4, 2, 7, 3, 6]
[5, 1, 8, 6, 3, 7, 2, 4]
[5, 2, 4, 6, 8, 3, 1, 7]
[5, 2, 4, 7, 3, 8, 6, 1]
[5, 2, 6, 1, 7, 4, 8, 3]
[5, 2, 8, 1, 4, 7, 3, 6]
[5, 3, 1, 6, 8, 2, 4, 7]
[5, 3, 1, 7, 2, 8, 6, 4]
[5, 3, 8, 4, 7, 1, 6, 2]
[5, 7, 1, 3, 8, 6, 4, 2]
[5, 7, 1, 4, 2, 8, 6, 3]
[5, 7, 2, 4, 8, 1, 3, 6]
[5, 7, 2, 6, 3, 1, 4, 8]
[5, 7, 2, 6, 3, 1, 8, 4]
[5, 7, 4, 1, 3, 8, 6, 2]
[5, 8, 4, 1, 3, 6, 2, 7]
[5, 8, 4, 1, 7, 2, 6, 3]
[6, 1, 5, 2, 8, 3, 7, 4]
[6, 2, 7, 1, 3, 5, 8, 4]
[6, 2, 7, 1, 4, 8, 5, 3]
[6, 3, 1, 7, 5, 8, 2, 4]
[6, 3, 1, 8, 4, 2, 7, 5]
[6, 3, 1, 8, 5, 2, 4, 7]
[6, 3, 5, 7, 1, 4, 2, 8]
[6, 3, 5, 8, 1, 4, 2, 7]
[6, 3, 7, 2, 4, 8, 1, 5]
[6, 3, 7, 2, 8, 5, 1, 4]
[6, 3, 7, 4, 1, 8, 2, 5]
[6, 4, 1, 5, 8, 2, 7, 3]
[6, 4, 2, 8, 5, 7, 1, 3]
[6, 4, 7, 1, 3, 5, 2, 8]
[6, 4, 7, 1, 8, 2, 5, 3]
[6, 8, 2, 4, 1, 7, 5, 3]
[7, 1, 3, 8, 6, 4, 2, 5]
[7, 2, 4, 1, 8, 5, 3, 6]
[7, 2, 6, 3, 1, 4, 8, 5]
[7, 3, 1, 6, 8, 5, 2, 4]
[7, 3, 8, 2, 5, 1, 6, 4]
[7, 4, 2, 5, 8, 1, 3, 6]
[7, 4, 2, 8, 6, 1, 3, 5]
[7, 5, 3, 1, 6, 8, 2, 4]
[8, 2, 4, 1, 7, 5, 3, 6]
[8, 2, 5, 3, 1, 7, 4, 6]
[8, 3, 1, 6, 2, 5, 7, 4]
[8, 4, 1, 3, 6, 2, 7, 5]
备注：以最后一组解为例，第一列放在第8行，第二列放在第4行，后面的依次按列根据对应的序号放在对应行上。
以上便是八皇后问题的全部92组解。