-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathN-Queen.py
39 lines (32 loc) · 905 Bytes
/
N-Queen.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
N = int(input("Enter the number of queens: "))
print()
board = [[0]*N for _ in range(N)]
def is_attack(i, j):
for k in range(0,N):
if board[i][k]==1 or board[k][j]==1:
return True
for k in range(0,N):
for l in range(0,N):
if (k+l==i+j) or (k-l==i-j):
if board[k][l]==1:
return True
return False
def N_queen(n):
if n==0:
return True
for i in range(0,N):
for j in range(0,N):
if (not(is_attack(i,j))) and (board[i][j]!=1):
board[i][j] = 1
if N_queen(n-1)==True:
return True
board[i][j] = 0
return False
if N_queen(N):
print("N Queen Possible")
print()
for i in board:
print (i)
else:
print("N Queen Possible Not Possible")
print()