-
Notifications
You must be signed in to change notification settings - Fork 0
/
minimax.py
173 lines (146 loc) · 5.92 KB
/
minimax.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
from utility import utility
from IsTerminal import isTerminal
#
# board = [
# [E, E, E, E, E, E, E],
# [E, E, E, E, E, E, E],
# [E, E, E, E, E, E, E],
# [A, E, E, E, E, E, E],
# [A, H, E, H, A, H, E],
# [A, H, E, H, A, H, E]
# ]
# return board
count = 1
def minimax(board, depth, alpha, beta, maximizingPlayer,AiIsFirstPlayer,difficulty):
global count
# if board == [[-1, -1, -1, -1, -1, -1, -1], [-1, -1, -1, -1, -1, -1, -1], [+1, -1, -1, -1, -1, -1, -1], [1, -1, -1, -1, -1, -1, -1], [1, 0, -1, 0, 1, 0, -1], [1, 0, -1, 0, 1, 0, -1]]:
# print("HIIII")
ret = isTerminal(board)
if(depth == 0 or ret):
output = utility(board,ret,AiIsFirstPlayer,difficulty)
# print("count = " , count ," is ",output)
# count = count + 1
return 0, output
if maximizingPlayer:
value = -1000008
# col = 0
# children function to be implemented
for child in children(board, AiIsFirstPlayer):
columnIndex=child["col"]
childBoard=child["board"]
_,outputFromMinMax = minimax(childBoard, depth-1, alpha, beta, False,AiIsFirstPlayer,difficulty)
if outputFromMinMax > value: # lw al fr3 dah maximum
value = outputFromMinMax # save al value
col = columnIndex # save al index
alpha = max(alpha, value)
# cutoff
if(alpha >= beta):
# print("alpha cutoff")
break
return col,value
else:
value = 1000008
# col = 0
for child in children(board, not (AiIsFirstPlayer)):
columnIndex = child["col"]
childBoard = child["board"]
_,outputFromMinMax = minimax(childBoard, depth-1, alpha, beta, True,AiIsFirstPlayer,difficulty)
if outputFromMinMax < value: # lw al fr3 dah minimum
value = outputFromMinMax # save al value
col = columnIndex # save al index
beta = min(beta, value)
if(alpha >= beta):
# print("beta cutoff")
break
return col,value
def children(board, coin):
children = []
columnsDiscovered = [0, 0, 0, 0, 0, 0, 0]
# print(board[5])
for rowIndex in range(5, -1, -1):
for columnIndex in range(7):
if(columnsDiscovered[columnIndex]):
continue
childBoard = list(map(list, board))
row = childBoard[rowIndex]
if(row[columnIndex] == -1):
row[columnIndex] = coin
columnsDiscovered[columnIndex] = 1
children.append({"col":columnIndex, "board":childBoard})
children.sort(key=lambda k: k['col'])
return children
def initializeBoard():
E = -1 # Empty
H = 0 # Human
A = 1 # AI
board = [
[E, E, E, E, E, E, E],
[E, E, E, E, E, E, E],
[E, E, E, E, E, E, E],
[E, E, E, E, E, E, E],
[E, E, E, E, E, E, E],
[E, E, E, E, E, E, E]
]
return board
#
# depth = 2
# initialBoard = initializeBoard()
# col,ret = minimax(initialBoard,depth,-1000000,1000000,True)
# print("Chosen col = ",col)
# print("score =",ret)
# # depth level of 6 seemed to be the optimal
# Testing children #
# initialBoard = initializeBoard()
# chiiii = children(initialBoard,1)
#
# print(chiiii)
# [[2, [[-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [1, -1, -1, -1, -1, -1, -1],
# [1, 0, -1, 0, 1, 0, -1],
# [1, 0, 1, 0, 1, 0, -1]]],
#
# [6, [[-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [1, -1, -1, -1, -1, -1, -1],
# [1, 0, -1, 0, 1, 0, -1],
# [1, 0, -1, 0, 1, 0, 1]]],
#
#
# [1, [[-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [1, 1, -1, -1, -1, -1, -1],
# [1, 0, -1, 0, 1, 0, -1],
# [1, 0, -1, 0, 1, 0, -1]]],
#
#
# [3, [[-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [1, -1, -1, 1, -1, -1, -1],
# [1, 0, -1, 0, 1, 0, -1],
# [1, 0, -1, 0, 1, 0, -1]]],
#
# [4, [[-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [1, -1, -1, -1, 1, -1, -1],
# [1, 0, -1, 0, 1, 0, -1],
# [1, 0, -1, 0, 1, 0, -1]]],
#
# [5, [[-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [1, -1, -1, -1, -1, 1, -1],
# [1, 0, -1, 0, 1, 0, -1],
# [1, 0, -1, 0, 1, 0, -1]]],
#
# [0, [[-1, -1, -1, -1, -1, -1, -1],
# [-1, -1, -1, -1, -1, -1, -1],
# [1, -1, -1, -1, -1, -1, -1],
# [1, -1, -1, -1, -1, -1, -1],
# [1, 0, -1, 0, 1, 0, -1],
# [1, 0, -1, 0, 1, 0, -1]]]]