八皇后算法

最新推荐文章于 2024-10-04 20:45:38 发布

魔兽为啥只能做防骑

最新推荐文章于 2024-10-04 20:45:38 发布

阅读量762

点赞数

分类专栏：算法文章标签：八皇后算法 Python

本文链接：https://blog.csdn.net/zlymhh/article/details/9617849

版权

算法专栏收录该内容

2 篇文章 0 订阅

订阅专栏

from itertools import permutations
class Queen():
    def __init__(self,num=8):
        self.num = num
    def putQueen(self):
        xylist=[]
        for group in permutations(range(self.num)):
            xylist.append([(group[i],i) for i in range(self.num)])
        for xygroup in xylist:
            if len(set((xy[0]+xy[1] for xy in xygroup)))==len(set((xy[0]-xy[1] for xy in xygroup)))==self.num:
                yield xygroup
print len(list(Queen().putQueen()))

from itertools import permutations
class Queen():
    def __init__(self,num=8):
        self.num = num
    def putQueen(self):
        for group in permutations(range(self.num)):
            if (self.num == len(set(group[i]+i for i in range(self.num)))== len(set(group[i]-i for i in range(self.num)))):
                yield [(group[i],i) for i in range(self.num)]
print len(list(Queen().putQueen()))

from itertools import permutations
class Queen():
    def __init__(self,num=8):
        self.num = num
    def putQueen(self):
        for group in permutations(range(self.num)):
            if self.conditions(group):
                yield [(group[i],i) for i in range(self.num)]
    def conditions(self,group):
        for n in range(self.num):
            for m in range(n):
                if abs(group[n]-group[m]) in (0,n-m):
                    return False
        return True
print len(list(Queen().putQueen()))

def queens(num=8,state=()):
    for pos in range(num):
        if not conflict(state,pos):
            if len(state)==num-1:
                yield(pos,)
            else:
                for result in queens(num,state+(pos,)):
                    yield(pos,)+result
def conflict(state,nextX):
    nextY = len(state)
    for i in range(nextY):
        if abs(state[i]-nextX) in (0,nextY-i):
            return True
    return False
print len(list(queens()))

from itertools import permutations
n = 8
cols = range(n)
for vec in permutations(cols):
    if (n == len(set(vec[i]+i for i in cols))== len(set(vec[i]-i for i in cols))):
        print vec