#coding:utf-8
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
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
c = 0
for res in queens(8):
c += 1
print ('Solution %d: ' % c)
chest = [[0]*len(res) for i in range(len(res))]
for i in range(len(res)):
chest[i][res[i]] = 1
print (chest[i])
print ()
|