-
Notifications
You must be signed in to change notification settings - Fork 1
/
queen.py
55 lines (39 loc) · 1.15 KB
/
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
QueenNumber = 5
def printBoard(board):
for i in range(QueenNumber):
for j in range(QueenNumber):
print(board[i][j],end = ' ')
print()
def SafeCell(board, row, col):
for i in range(col):
if board[row][i] == 1:
return False
for i, j in zip(range(row, -1, -1), range(col, -1, -1)):
if board[i][j] == 1:
return False
for i, j in zip(range(row, QueenNumber, 1), range(col, -1, -1)):
if board[i][j] == 1:
return False
return True
def solveNQueen(board, col):
if col >= QueenNumber:
return True
for i in range(QueenNumber):
if SafeCell(board, i, col):
board[i][col] = 1
if solveNQueen(board, col + 1) == True:
return True
board[i][col] = 0
return False
def NQueen():
board = [ [0, 0, 0, 0, 0],
[0, 0, 0, 0, 0],
[0, 0, 0, 0, 0],
[0, 0, 0, 0, 0],
[0, 0, 0, 0, 0]]
if solveNQueen(board, 0) == False:
print ("No Solution")
return False
printBoard(board)
return True
NQueen()