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):
14行Python代码实现 n 皇后问题(可求出所有结果)
最新推荐文章于 2024-03-06 20:06:57 发布
