find_way(x,y):
if x==n-1 and y==n-1:
return True
if M[x][y] == safe:
try_down = find_way(x+1,y)
if try_down == True:
return True
try_east = find_way(x,y+1)
return try_east
else:
return False
pseudo-code
Nqueens(k): # x[k]를 결정 (열의 번호)
if k >= N:
return
for c in range(N):
if queen can place at (k,c):
x[k] = c
Nqueens(k+1)
공부 중...