def Promising(pan, y, depth) : for i in range(depth) : if y == pan[i] or (depth-i == abs(y-pan[i])): return False return True def Nqueen(n, pan, depth) : global answer if depth == n : answer += 1 else : for y in range(n) : if Promising(pan, y, depth) : pan[depth] = y Nqueen(n, pan, depth+1) def solution(n): global answer answer = 0 pan = [0] * n Nqueen(n, pan, 0) return answer 백트래킹 문제 첨 풀어보는거라 엄..