-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnqueen2.py
43 lines (37 loc) · 1.13 KB
/
nqueen2.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
class NQueen(object):
def __init__(self):
self.n = n
self.x = []
for i in range(0, n):
self.x.append(-1)
self.output = []
self.flag = False
def place(self, k, i):
for j in range(0, k):
if self.x[j] == i or abs(self.x[j]-i) == abs(j-k):
return False
return True
def n_queens(self, k, n):
for i in range(0, n):
if self.place(k, i):
self.x[k] = i
if k == n-1:
y = list(self.x)
self.output.append(y)
# print self.x
# sys.exit()
self.flag = True
if self.flag:
return
else:
if not self.flag:
self.n_queens(k+1, n)
else:
return
def get_result(self):
self.n_queens(0, self.n)
return self.output
n = input("enter value of n:")
q = NQueen()
for i in q.get_result():
print i