-
Notifications
You must be signed in to change notification settings - Fork 0
/
app.py
561 lines (541 loc) · 16.2 KB
/
app.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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
from time import time
import numpy as np
import pygame
import sys
from pygame.locals import *
import tkinter
from tkinter import *
from tkinter import messagebox
def IsSafeBacktrack(x,y,board,N):
return (x < N and x >= 0 and y < N and y >= 0 and board[x][y] == -1)
def backtrack(x,y,N,start_time):
dx=[2, 1, -1, -2, -2, -1, 1, 2]
dy=[1, 2, 2, 1, -1, -2, -2, -1]
sol=np.zeros([N,N])
for i in range(N):
for j in range(N):
sol[i][j]=-1
sol[x][y]=0;
foundSolution=solveUtil(x,y,1,sol,N,dx,dy)
for i in range(N):
for j in range(N):
if sol[i][j] == -1:
foundSolution=False
if foundSolution == False :
t.insert(tkinter.END,"Couldn't find a solution")
t.tag_config("center",justify='center')
t.tag_add("center", "1.0",tkinter.END)
values.insert(tkinter.END,"")
values.tag_add("center", "1.0",tkinter.END)
return
end_time = time()
r = "Time taken to execute Backtracking Algorithm " + str(round((end_time-start_time)*1000,2)) + " ms"
t.insert(tkinter.END,r)
t.tag_config("center",justify='center')
t.tag_add("center", "1.0",tkinter.END)
k = 0
L=[]
while k <= N*N-1:
for i in range(N):
for j in range(N):
if sol[i][j] == k:
L.append([i,j])
k += 1
final_x,final_y = L[len(L)-1][0] , L[len(L)-1][1]
initial_x,initial_y = x,y
f = 0
for i in range(8):
if(final_x+dx[i] == initial_x and final_y+dy[i] == initial_y):
f = 1
break
if (f==1):
show1.insert(tkinter.END,"Closed Tour observed\n")
else:
show1.insert(tkinter.END,"Open Tour observed\n")
if(N<=10):
board = np.zeros((N,N))
k = 0
for i in range(len(L)):
board[L[i][0]][L[i][1]] = k
k = k+1
j = ""
for i in range(N):
for k in range(N):
j = j + str(round(int(board[i][k] + 1),0))+ "\t"
j = j + "\n"
show1.insert(tkinter.END,"Tracing path in NxN matrix \n")
values.insert(tkinter.END, j)
values.tag_add("center", "1.0",tkinter.END)
else:
values.insert(tkinter.END,"")
values.tag_add("center", "1.0",tkinter.END)
values.tag_config("center",justify='center')
show1.tag_config("center",justify='center')
show1.tag_add("center", "1.0",tkinter.END)
if N <= 32 :
graphicTour(N,L)
return
def solveUtil(positionx,positiony,movei,sol,N,dx,dy):
if(movei==N*N):
return True
for i in range(8):
Nextx = positionx + dx[i]
Nexty = positiony + dy[i]
if (IsSafeBacktrack(Nextx,Nexty,sol,N)):
sol[Nextx][Nexty]=movei
if(solveUtil(Nextx,Nexty,movei+1,sol,N,dx,dy)==True):
return True
sol[Nextx][Nexty]=-1
return False
def graphicTour(N,LeftCoordinate):
Knight = pygame.image.load("knight.png")
pygame.init()
screen = pygame.display.set_mode((32*N,32*N))
pygame.display.set_caption("Knight's Tour")
background = pygame.image.load("chess.png")
index = 0
font = pygame.font.SysFont("comicsansms", 22)
text = []
Floor = []
while True:
screen.blit(background,(0,0))
if index < N*N:
screen.blit(Knight,(LeftCoordinate[index][0]*32,LeftCoordinate[index][1]*32))
text.append(font.render(str(index+1),True,(255,255,255)))
Floor.append(text[index].get_rect())
Floor[index].center = (LeftCoordinate[index][0]*32+16,LeftCoordinate[index][1]*32+16)
index += 1
else:
screen.blit(Knight,(LeftCoordinate[index-1][0]*32,LeftCoordinate[index-1][1]*32))
pygame.display.quit()
pygame.quit()
return
for x in range(8000000):
pass
for event in pygame.event.get():
if event.type == QUIT:
pygame.quit()
for i in range(index):
screen.blit(text[i],Floor[i])
pygame.display.update()
# To check if we have found out a solution
def ifSolution(Board,N):
for i in range(N):
for j in range(N):
if Board[i][j] == 0:
return False
return True
def basics():
values.delete(1.0,tkinter.END)
t.delete(1.0,tkinter.END)
show1.delete(1.0,tkinter.END)
show.delete(1.0,tkinter.END)
i = e1.get()
j = e2.get()
k = e3.get()
if(i.isdigit() and j.isdigit() and k.isdigit()):
N = int(float(i))
positionx = int(float(j))
positiony= int(float(k))
return N , positionx , positiony
else:
return -1 , -1 , -1
def check(a,b,c):
r = ""
if(e1.get().isdigit()==False):
r = "Enter positive integral value in first field"
elif(e2.get().isdigit()==False):
r = "Enter positive integral value in second field"
else:
r = "Enter positive integral value in third field"
t.insert(tkinter.END,r)
t.tag_config("center",justify='center')
t.tag_add("center", "1.0",tkinter.END)
values.insert(tkinter.END,"")
values.tag_add("center", "1.0",tkinter.END)
return
def validity(a,b,c):
r = ""
if(b<0 and b>=a):
r = "Value of positionx is out of bounds"
elif(c<0 and c>=a):
r = "Value of positiony is out of bounds"
else:
return True
t.insert(tkinter.END,r)
t.tag_config("center",justify='center')
t.tag_add("center", "1.0",tkinter.END)
values.insert(tkinter.END,"")
values.tag_add("center", "1.0",tkinter.END)
return False
def method1():
N , positionx , positiony = basics()
if(N==-1 and positionx==-1 and positiony==-1):
check(N,positionx,positiony)
return
if(validity(N,positionx,positiony)==False):
return
start_time = time()
show.insert("1.0","Results \n Time analysis \n")
show.tag_config("center",justify='center')
show.tag_add("center", "1.0",tkinter.END)
backtrack(positionx,positiony,N,start_time)
return
# Denotes whether the position is within the board and is not visited and hence is safe to move
def IsSafe(x,y,board,N):
return (x < N and x >= 0 and y < N and y >= 0 and board[x][y] == 0)
# To check how many positions are accessible from a given position that is the count of positions where knight can shift to from one position
def checkAccessibility(posx,posy,moves,board,N):
accessibility = 0
for i in range(8):
# Can move to that position if yes then accessibility is increased by 1
if IsSafe(posx+moves[i][0],posy+moves[i][1],board,N):
accessibility += 1
return accessibility
def getNextMoves(move,moves,board,N):
positionx = move[0]
positiony = move[1]
accessibility = 8
for i in range(8):
Nextx = positionx + moves[i][0]
Nexty = positiony + moves[i][1]
# Accessibility checks for every possible next next position knight can move to from the given next position
NewAccessibility = checkAccessibility(Nextx,Nexty,moves,board,N)
if IsSafe(Nextx,Nexty,board,N) and NewAccessibility < accessibility:
move[0] = Nextx
move[1] = Nexty
accessibility = NewAccessibility
# move are updated as position
return
# Implementation of Warnsdorff's Algorithm
def method2():
N , positionx , positiony = basics()
if(N==-1 and positionx==-1 and positiony==-1):
check(N,positionx,positiony)
return
if(validity(N,positionx,positiony)==False):
return
show.insert("1.0","Results \n Time analysis \n")
show.tag_config("center",justify='center')
show.tag_add("center", "1.0",tkinter.END)
start_time = time()
x = positionx
y = positiony
moveNumber = 2
move = [positionx,positiony]
# Direction in which knight can move
moves = [[2,1],[2,-1],[1,2],[1,-2],[-1,2],[-1,-2],[-2,1],[-2,-1]]
# Creating chess board
Board = np.zeros([N,N])
# Marking 1st position of chess board as visited
Board[positionx][positiony] = 1
L = []
for i in range(N*N):
move[0] = positionx
move[1] = positiony
getNextMoves(move,moves,Board,N)
positionx = move[0]
positiony = move[1]
Board[positionx][positiony] = moveNumber
# Incrementing the moveNumber everytime we get an answer
moveNumber += 1
Board[positionx][positiony] -= 1
# To check whether solution exists or not
sol = ifSolution(Board,N)
if sol:
k = 1
while k <= N*N:
for i in range(N):
for j in range(N):
if Board[i][j] == k:
L.append([i,j])
k += 1
else:
moves = [[2,1],[-2,1],[2,-1],[-2,-1],[1,2],[-1,2],[1,-2],[-1,-2]]
Board = np.zeros([N,N])
positionx = x
positiony = y
Board[positionx][positiony] = 1
L = []
moveNumber = 2
move = [positionx,positiony]
for i in range(N*N):
move[0] = positionx
move[1] = positiony
getNextMoves(move,moves,Board,N)
positionx = move[0]
positiony = move[1]
Board[positionx][positiony] = moveNumber
moveNumber += 1
Board[positionx][positiony] -= 1
sol = ifSolution(Board,N)
if sol:
k = 1
while k <= N*N:
for i in range(N):
for j in range(N):
if Board[i][j] == k:
L.append([i,j])
k += 1
if len(L) == 0:
r = "Couldn't find a solution"
t.insert(tkinter.END,r)
t.tag_config("center",justify='center')
t.tag_add("center", "1.0",tkinter.END)
values.insert(tkinter.END,"")
values.tag_add("center", "1.0",tkinter.END)
return
end_time = time()
final_x,final_y = L[len(L)-1]
initial_x,initial_y = positionx,positiony
f = 0
for i in range(8):
if(final_x+moves[i][0] == initial_x and final_y+moves[i][1] == initial_y):
f = 1
break
if (f==1):
show1.insert(tkinter.END,"Closed Tour observed\n")
else:
show1.insert(tkinter.END,"Open Tour observed\n")
if(N<=10):
board = np.zeros((N,N))
k = 0
for i in range(len(L)):
board[L[i][0]][L[i][1]] = k
k = k + 1
j = ""
for i in range(N):
for k in range(N):
j = j + str(round(int(board[i][k] + 1),0))+ "\t"
j = j + "\n"
show1.insert(tkinter.END,"Tracing path in NxN matrix \n")
values.insert(tkinter.END, j)
values.tag_add("center", "1.0",tkinter.END)
values.tag_config("center",justify='center')
else:
values.insert(tkinter.END,"")
values.tag_add("center", "1.0",tkinter.END)
show1.tag_config("center",justify='center')
show1.tag_add("center", "1.0",tkinter.END)
r = "Time taken to execute Warnsdorff\'s Algorithm " + str(round((end_time-start_time)*1000,2)) + " ms"
t.insert(tkinter.END,r)
t.tag_config("center",justify='center')
t.tag_add("center", "1.0",tkinter.END)
if N <= 32:
graphicTour(N,L)
return
# Displays names of group members
def group_info():
h = "Adarsh Misra : 201601004\n"
h = h + "Nishi Doshi : 201601408\n"
h = h + "Smit Shah : 201601410\n"
messagebox.showinfo("Group Members",h)
return
# Shows definitions of open tour and closed tour
def about():
values.delete(1.0,tkinter.END)
t.delete(1.0,tkinter.END)
show1.delete(1.0,tkinter.END)
show.delete(1.0,tkinter.END)
show1.insert(tkinter.END,"Basic Definitions")
h = "Open Tour : When kinght at final poisition in the tour cannot reach the \ninitial position in one move; open tour is observed\n"
h = h + "Closed Tour : When kinght at final poisition in the tour reaches the \ninitial position in one move; open tour is observed\n"
values.insert(tkinter.END,h)
return
# When close button is pressed for window to close
def close():
m.destroy()
def method2_2():
N , positionx , positiony = basics()
if(N==-1 and positionx==-1 and positiony==-1):
check(N,positionx,positiony)
return -1 , -1
if(validity(N,positionx,positiony)==False):
return -1 , -1
start_time = time()
x = positionx
y = positiony
moveNumber = 2
move = [positionx,positiony]
moves = [[2,1],[2,-1],[1,2],[1,-2],[-1,2],[-1,-2],[-2,1],[-2,-1]]
Board = np.zeros([N,N])
# Marking 1st position of chess board as visited
Board[positionx][positiony] = 1
L = []
for i in range(N*N):
move[0] = positionx
move[1] = positiony
getNextMoves(move,moves,Board,N)
positionx = move[0]
positiony = move[1]
Board[positionx][positiony] = moveNumber
moveNumber += 1
Board[positionx][positiony] -= 1
# To check if a valid solution exists or not
sol = ifSolution(Board,N)
if sol:
k = 1
while k <= N*N:
for i in range(N):
for j in range(N):
if Board[i][j] == k:
L.append([i,j])
k += 1
else:
moves = [[2,1],[-2,1],[2,-1],[-2,-1],[1,2],[-1,2],[1,-2],[-1,-2]]
Board = np.zeros([N,N])
positionx = x
positiony = y
Board[positionx][positiony] = 1
L = []
moveNumber = 2
move = [positionx,positiony]
for i in range(N*N):
move[0] = positionx
move[1] = positiony
getNextMoves(move,moves,Board,N)
positionx = move[0]
positiony = move[1]
Board[positionx][positiony] = moveNumber
moveNumber += 1
Board[positionx][positiony] -= 1
sol = ifSolution(Board,N)
if sol:
k = 1
while k <= N*N:
for i in range(N):
for j in range(N):
if Board[i][j] == k:
L.append([i,j])
k += 1
if len(L) == 0:
return -1 , -1
end_time = time()
final_x,final_y = L[len(L)-1]
initial_x,initial_y = positionx,positiony
f = 0
for i in range(8):
if(final_x+moves[i][0] == initial_x and final_y+moves[i][1] == initial_y):
f = 1
break
return end_time-start_time , f
def method1_2():
N , positionx , positiony = basics()
if(N==-1 and positionx==-1 and positiony==-1):
check(N,positionx,positiony)
return -1 , -1
if(validity(N,positionx,positiony)==False):
return -1 , -1
start_time = time()
x = positionx
y = positiony
dx=[2, 1, -1, -2, -2, -1, 1, 2]
dy=[1, 2, 2, 1, -1, -2, -2, -1]
sol=np.zeros([N,N])
for i in range(N):
for j in range(N):
sol[i][j]=-1
sol[x][y]=0;
foundSolution=solveUtil(x,y,1,sol,N,dx,dy)
for i in range(N):
for j in range(N):
if sol[i][j] == -1:
foundSolution=False
if foundSolution == False :
return -1 , -1
end_time = time()
k = 0
L=[]
while k <= N*N-1:
for i in range(N):
for j in range(N):
if sol[i][j] == k:
L.append([i,j])
k += 1
final_x,final_y = L[len(L)-1][0] , L[len(L)-1][1]
initial_x,initial_y = x,y
f = 0
for i in range(8):
if(final_x+dx[i] == initial_x and final_y+dy[i] == initial_y):
f = 1
break
return end_time-start_time , f
def analyze():
times , f = method2_2()
if (f==-1 or times==-1):
values.insert("1.0","Some error in inputs or algorithm does not support this algorithm")
values.tag_config("center",justify='center')
values.tag_add("center", "1.0",tkinter.END)
return
s = "Warnsdorff\'s Algorithm analysis \n"
s = s + "Time taken to find answer : " + str(round(times*1000,4)) + "ms \n"
if(f==1):
s = s + "Closed Tour observed\n\n"
else:
s = s + "Open Tour observed\n\n"
times2 , f2 = method1_2()
if (f2==-1 or times2==-1):
values.insert("1.0","Some error in inputs or algorithm does not support this algorithm")
values.tag_config("center",justify='center')
values.tag_add("center", "1.0",tkinter.END)
return
s = s + "Backtracking Algorithm analysis \n"
s = s + "Time taken to find answer : " + str(round(times2*1000,4)) + "ms \n"
if(f2==1):
s = s + "Closed Tour observed\n"
else:
s = s + "Open Tour observed\n"
show.insert("1.0","\n Results")
show.tag_config("center",justify='center')
show.tag_add("center", "1.0",tkinter.END)
show1.insert("1.0","Time Analysis")
show1.tag_config("center",justify='center')
show1.tag_add("center", "1.0",tkinter.END)
values.insert("1.0",s)
values.tag_config("center",justify='center')
values.tag_add("center", "1.0",tkinter.END)
return
m = tkinter.Tk()
m.geometry("650x650")
m.title('Knight\'s Tour')
heading = tkinter.Text(m,width=50,height=2)
a = tkinter.Label(m,width=40,height=3, text='Value of N \n (No. of squares in a row or column in chessboard)')
b = tkinter.Label(m,width=40, height = 3,text='Value of x \n (Initial x poisition of knight on chessboard)')
c = tkinter.Label(m,width=40, height = 3, text='Value of y \n (Initial y position of knight on chessboard)')
e1 = tkinter.Entry(m,width=25)
e2 = tkinter.Entry(m,width=25)
e3 = tkinter.Entry(m,width=25)
b1 = tkinter.Button(m, text='Backtracking Algorithm',width=25, command=method1)
b2 = tkinter.Button(m, text='Warnsdorff\'s Algorithm', width=25, command=method2)
b3 = tkinter.Button(m, text='Creater\'s Info', width=25,command=group_info)
b4 = tkinter.Button(m, text='Basic Definitions',width=25,command=about)
b5 = tkinter.Button(m, text='Close',width=25,command=close)
b6 = tkinter.Button(m, text='Show Analysis',width=25,command=analyze)
show = tkinter.Text(m,width=75,height=2)
t = tkinter.Text(m,width=75,height=1)
show1 = tkinter.Text(m,width=75,height=2)
values = tkinter.Text(m,width=75,height=12)
heading.insert("1.0","Knight\'s Tour Analysis \n Enter Values for running the algorithm")
heading.tag_config("center",justify='center')
heading.tag_add("center", "1.0",tkinter.END)
e1.insert(tkinter.END,'4')
e2.insert(tkinter.END,'0')
e3.insert(tkinter.END,'0')
heading.grid(row=0,column=0,columnspan=3)
a.grid(row=1,column=0)
b.grid(row=2,column=0)
c.grid(row=3,column=0)
e1.grid(row=1, column=2)
e2.grid(row=2, column=2)
e3.grid(row=3, column=2)
b1.grid(row=4,column=0)
b2.grid(row=4,column=2)
show.grid(row=5,column=0,columnspan=3)
t.grid(row=6,column=0,columnspan=3)
show1.grid(row=7,column=0,columnspan=3)
values.grid(row=8,column=0,columnspan=3)
b3.grid(row=9,column=2)
b6.grid(row=9,column=0)
b5.grid(row=10,column=2)
b4.grid(row=10,column=0)
m.mainloop()