Question

求高手解八皇后问题(python)

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
想请问pos是从0到num-1走的把 ，如果是，pos=0时程序是怎么走的

Answer 1

pos是从0到num-1走的

pos=0时程序走这一段：
for result in queens(num, state + (pos,)):
yield (pos,) + result

就是先找第一个位置

追问

那就是for result in queens(8,(0,)) 这句会执行？怎么执行