-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNqueens.py
More file actions
31 lines (27 loc) · 1.16 KB
/
Nqueens.py
File metadata and controls
31 lines (27 loc) · 1.16 KB
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
chessboard = [[]]
chessboard = [[0 for i in range(3)] for j in range(3)] # 0 indicates queen not placed at the (i,j)th position
def check_attack(i, j):
for k in range(3):
if chessboard[k][j] == 1:
return True # check for queen vertically
for x in range(3):
for y in range(3):
if x+y == i+j or x-y == i-j: # upper left diagonal or upper right diagonal
if chessboard[x][y] == 1:
return True # check for queen diagonally
return False
def Nqueen(row, n):
if row == n: # all queens placed successfully
return True
for column in range(n):
if check_attack(row, column) == False:
chessboard[row][column] = 1 # place the queen at i,jth position
if Nqueen(row+1, n) is True: # queen successfully placed
return True
chessboard[row][column] = 0 # backtrack if no place available in a particular row
return False
Nqueen(0, 3) # 3 is the board size
for x in range(3):
for y in range(3):
print(chessboard[x][y], end='')
print()