-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAI.py
More file actions
128 lines (92 loc) · 2.98 KB
/
AI.py
File metadata and controls
128 lines (92 loc) · 2.98 KB
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
from utilities import *
# implement your agent here
def connect4_ai(board, turn, depth):
copyboard = board.copy()
for i in range(6):
for j in range(7):
copyboard[i][j] = board[5 - i][j]
print(copyboard)
if turn == 2:
for i in range(6):
for j in range(7):
if copyboard[i][j] == 2:
copyboard[i][j] = 1
elif copyboard[i][j] == 1:
copyboard[i][j] = 2
c = [-1]
alpha = float('-inf')
beta = float('inf')
maxi(copyboard, depth, c, alpha, beta)
return c[0]
def mini(board, depth, alpha, beta):
if is_draw(board):
return 0
empty = get_empty(board)
for i in range(7):
if empty[i] != -1:
board[empty[i]][i] = 2
isWin = is_win(board, empty[i], i)
board[empty[i]][i] = 0
if isWin:
return float('-inf')
minimmum = float('inf')
if depth == 0:
for i in range(7):
if empty[i] != -1:
board[empty[i]][i] = 2
minimmum = min(maxi(board, 0, [0], alpha, beta), minimmum)
board[empty[i]][i] = 0
#alpha beta pruning
beta = min(beta, minimmum)
if alpha >= beta:
return minimmum
return minimmum
for i in range(7):
if empty[i] != -1:
board[empty[i]][i] = 2
minimmum = min(maxi(board, depth - 1, [0], alpha, beta), minimmum)
board[empty[i]][i] = 0
#alpha beta pruning
beta = min(beta, minimmum)
if alpha >= beta:
return minimmum
return minimmum
def maxi(board, depth, c, alpha, beta):
if is_draw(board):
c[0] = -1
return 0
empty = get_empty(board)
for i in range(7):
if empty[i] != -1:
board[empty[i]][i] = 1
isWin = is_win(board, empty[i], i)
board[empty[i]][i] = 0
if isWin:
c[0] = i
return float('inf')
maximmum = float('-inf')
if depth == 0:
for i in range(7):
if empty[i] != -1:
board[empty[i]][i] = 1
maximmum = max(score_position(board, 1), maximmum)
board[empty[i]][i] = 0
#alpha beta pruning
alpha = max(alpha, maximmum)
if alpha >= beta:
return maximmum
return maximmum
for i in range(7):
if empty[i] != -1:
board[empty[i]][i] = 1
d = mini(board, depth - 1, alpha, beta)
if d == float('-inf') and c[0] == -1: c[0] = i
if maximmum < d:
maximmum = d
c[0] = i
board[empty[i]][i] = 0
#alpha beta pruning
alpha = max(alpha, maximmum)
if alpha >= beta:
return maximmum
return maximmum