-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDxTTT.py
527 lines (323 loc) · 10.3 KB
/
DxTTT.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
# PSEUDOCODE
# /*******
# * for Tic-Tac-Toe, make an array for the 3D space
# * take inputs
# *
# * recursive call
# * check whose turn
# *
# * if PLAYER's turn then place its symbol at each empty space
# * if only one was empty then check if PLAYER is winning
# * if yes then return -inf
# * if not then return 0
# * if more than one was empty then place a symbol wherever result is -inf
# *
# * if COMPUTER's turn then place its symbol at each empty space
# * if only one was empty then check if COMPUTER is winning
# * if yes then return +inf
# * if not then return 0
# * if more than one was empty then place a symbol wherever result is +inf
# *
# */
"""
"""
# getIndex function
def getIndex(rowNum, colNum):
return ((rowNum - 1) * 3) + (colNum - 1)
# getRowCol function
def getRowCol(index):
r = int((index / 3)) + 1
c = index - ((r - 1) * 3) + 1
r = str(r)
c = str(c)
retString = r + " " + c
return retString
"""
"""
# winnerCheck function
def winnerCheck(grid, symbol):
# checking for diagonal
if (
grid[getIndex(2, 2)] == symbol
and grid[getIndex(1, 1)] == symbol
and grid[getIndex(3, 3)] == symbol
):
return 1
elif (
grid[getIndex(2, 2)] == symbol
and grid[getIndex(1, 3)] == symbol
and grid[getIndex(3, 1)] == symbol
):
return 1
# checking for horizontals
if (
grid[getIndex(1, 1)] == symbol
and grid[getIndex(1, 2)] == symbol
and grid[getIndex(1, 3)] == symbol
):
return 1
elif (
grid[getIndex(2, 1)] == symbol
and grid[getIndex(2, 2)] == symbol
and grid[getIndex(2, 3)] == symbol
):
return 1
elif (
grid[getIndex(3, 1)] == symbol
and grid[getIndex(3, 2)] == symbol
and grid[getIndex(3, 3)] == symbol
):
return 1
# checking for verticals
if (
grid[getIndex(1, 1)] == symbol
and grid[getIndex(2, 1)] == symbol
and grid[getIndex(3, 1)] == symbol
):
return 1
elif (
grid[getIndex(1, 2)] == symbol
and grid[getIndex(2, 2)] == symbol
and grid[getIndex(3, 2)] == symbol
):
return 1
elif (
grid[getIndex(1, 3)] == symbol
and grid[getIndex(2, 3)] == symbol
and grid[getIndex(3, 3)] == symbol
):
return 1
# final return in case of NONE OF ABOVE
return 0
"""
"""
# planMove function
def planMove(grid, turn, numTurns):
# computer's turn
if turn == 1:
# base case
if numTurns == 8:
# creating return dictionary
outcomes = dict()
# putting at empty place
x = 0
for y in range(9):
if grid[y] == " ":
grid[y] = "0"
x = y
break
# checking the winner
if winnerCheck(grid, "0") == 1:
outcomes.update({x: [1, 0, 0]})
elif winnerCheck(grid, "*") == 1:
outcomes.update({x: [0, 1, 0]})
else:
outcomes.update({x: [0, 0, 1]})
# setting things back
grid[x] = " "
# returning the dictionary
return outcomes
# else case
else:
# creating return dictionary
outcomes = dict()
# run through all the possible combinations
for x in range(9):
if grid[x] == " ":
grid[x] = "0"
# checking if win created
if winnerCheck(grid, "0") == 1:
outcomes.update({x: [1, 0, 0]})
elif winnerCheck(grid, "*") == 1:
outcomes.update({x: [0, 1, 0]})
else:
# moving on
ele = planMove(grid, 0, numTurns + 1)
# updating in the final values
WINS = 0
LOSES = 0
DRAWS = 0
for e in ele:
WINS += ele.get(e)[0]
LOSES += ele.get(e)[1]
DRAWS += ele.get(e)[2]
# updating in the outcomes dictionary
outcomes.update({x: [WINS, LOSES, DRAWS]})
# setting things back
grid[x] = " "
# returning the outcomes
return outcomes
# player's turn
if turn == 0:
# base case
if numTurns == 8:
# creating return dictionary
outcomes = dict()
# putting at empty place
x = 0
for y in range(9):
if grid[y] == " ":
grid[y] = "*"
x = y
break
# checking the winner
if winnerCheck(grid, "0") == 1:
outcomes.update({x: [1, 0, 0]})
elif winnerCheck(grid, "*") == 1:
outcomes.update({x: [0, 1, 0]})
else:
outcomes.update({x: [0, 0, 1]})
# setting things back
grid[x] = " "
# returning the dictionary
return outcomes
# else case
else:
# creating return dictionary
outcomes = dict()
# run through all the possible combinations
for x in range(9):
if grid[x] == " ":
grid[x] = "*"
# checking if win created
if winnerCheck(grid, "0") == 1:
outcomes.update({x: [1, 0, 0]})
elif winnerCheck(grid, "*") == 1:
outcomes.update({x: [0, 1, 0]})
else:
# moving on
ele = planMove(grid, 1, numTurns + 1)
# updating in the final values
WINS = 0
LOSES = 0
DRAWS = 0
for e in ele:
WINS += ele.get(e)[0]
LOSES += ele.get(e)[1]
DRAWS += ele.get(e)[2]
# updating in the outcomes dictionary
outcomes.update({x: [WINS, LOSES, DRAWS]})
# setting things back
grid[x] = " "
# returning the outcomes
return outcomes
"""
"""
# makeMove function
def makeMove(grid, turn, numTurns):
# planning the next move
result = planMove(grid, turn, numTurns)
retString = ""
# checking for any CLEAR WINS
clearWin = 0
for all in result:
if (
result.get(all)[0] == 1
and result.get(all)[1] == 0
and result.get(all)[2] == 0
):
retString = getRowCol(all)
clearWin = 1
break
if clearWin == 0:
# checking for any CLEAR LOSES
clearLoss = 0
for x in range(9):
if grid[x] == " ":
grid[x] = "*"
if winnerCheck(grid, "*") == 1:
retString = getRowCol(x)
clearLoss = 1
grid[x] = " "
break
grid[x] = " "
if clearWin == 0 and clearLoss == 0:
# otherwise minimizing loses and maximizing wins
minLoses = 100000000
maxWins = -1
maxDraws = -1
winIndex = -1
for all in result:
if result.get(all)[2] < minLoses:
minLoses = result.get(all)[2]
winIndex = all
elif result.get(all)[2] == minLoses:
if result.get(all)[0] > maxWins:
maxWins = result.get(all)[0]
winIndex = all
elif result.get(all)[0] == maxWins:
if result.get(all)[1] > maxDraws:
maxDraws = result.get(all)[1]
winIndex = all
# getting the return string
retString = getRowCol(winIndex)
# returning value
return retString
"""
"""
# displayGrid function
def displayGrid(grid):
print("-------")
print("|" + grid[0] + "|" + grid[1] + "|" + grid[2] + "|")
print("|" + grid[3] + "|" + grid[4] + "|" + grid[5] + "|")
print("|" + grid[6] + "|" + grid[7] + "|" + grid[8] + "|")
print("-------")
print("This is the current grid!\n")
"""
"""
# main function
def main():
# taking input of player name
Player = input("Enter your player name: ")
print("\nWelcome {}!".format(Player))
# making a grid list
grid = list()
# initializing arr
for i in range(9):
grid.append(" ")
# displaying the initial grid
print("Let's BEGIN!!\n")
# loop till winner not found
turn = 0
numTurns = 0
while numTurns != 9 and winnerCheck(grid, "*") == 0 and winnerCheck(grid, "0") == 0:
# player's turn
if turn == 0:
displayGrid(grid)
print("{}'s turn".format(Player))
r, c = input("Enter row & column number of your next move : ").split(" ")
r = int(r)
c = int(c)
print("\n\n")
# updating the grid after turn
grid[getIndex(r, c)] = "*"
# updating other values
turn = 1
numTurns += 1
# computer's turn
elif turn == 1:
print("Computer's turn")
print("\n\n")
r, c = makeMove(grid, turn, numTurns).split(" ")
r = int(r)
c = int(c)
# updating the grid after turn
grid[getIndex(r, c)] = "0"
# updating other values
turn = 0
numTurns += 1
# printing the WINNER
if winnerCheck(grid, "*") == 1:
displayGrid(grid)
print("{} WINS! Congratulations!!".format(Player))
elif winnerCheck(grid, "0") == 1:
displayGrid(grid)
print("Computer WINS!")
else:
displayGrid(grid)
print("It's a DRAW! Well played!")
return 1
"""
"""
# calling the main function
main()