-
Notifications
You must be signed in to change notification settings - Fork 0
/
AlphaBeta.cpp
151 lines (136 loc) · 3.64 KB
/
AlphaBeta.cpp
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
//
// AlphaBeta.cpp
// Chess
//
// Created by mustafa tok on 10.12.2011.
//
#include <iostream>
#include "AlphaBeta.h"
#include "Board.h"
bool CutOffTest1(Board* state, int level, clock_t st){
clock_t ft = clock();
float diff = ((float)ft - (float)st) / 1000000.0F;
if(state->getLevel()==level || state->isFinished() || diff > 99.9){
return true;
}
return false;
}
int Max1(int x,int y){
return (x > y)? x : y;
}
int Min1(int x, int y){
return (x < y)? x : y;
}
int changeTurn1(int turn){
if(turn == BLACK)
return WHITE;
else
return BLACK;
}
inline int MaxValuePruning(Board* state, int turn, int alpha, int beta, int level, clock_t st){
if(CutOffTest1(state, level, st)){
return state->getValue();
}
BoardQueue *q;
q = state->successor(turn);
while(!q->isEmpty()){
Board* s = q->dequeue();
alpha = Max1(alpha, MinValuePruning(s,changeTurn1(turn), alpha, beta, level, st));
delete s;
if(alpha >= beta){
while(!q->isEmpty()){
Board* s = q->dequeue();
delete s;
}
delete q;
return beta;
}
}
delete q;
return alpha;
}
inline int MinValuePruning(Board* state, int turn, int alpha, int beta, int level, clock_t st){
if(CutOffTest1(state, level, st)){
return state->getValue();
}
BoardQueue *q;
q = state->successor(turn);
// cout << endl;
while(!q->isEmpty()){
Board* s = q->dequeue();
beta = Min1(beta, MaxValuePruning(s,changeTurn1(turn), alpha, beta, level, st));
delete s;
if(beta <= alpha){
while(!q->isEmpty()){
Board* s = q->dequeue();
delete s;
}
delete q;
return alpha;
}
// cout << "Minimum : " << beta;
// s->draw();
}
delete q;
return beta;
}
Board* PruningDecision(Board* board, int turn, int level, clock_t st){
if(board->isFinished())
return board;
BoardQueue *q;
q = board->successor(turn);
cout << endl;
Board* tmpboard = board;
int tmpvalue = -99999;
int min;
while(!q->isEmpty()){
Board* b = q->dequeue();
min = MinValuePruning(b, changeTurn1(turn), -99999, +99999, level, st);
if(min > tmpvalue){
tmpvalue = min;
if(tmpboard != board){
Board* tmmp = tmpboard;
tmpboard = b;
delete tmmp;
}else{
tmpboard = b;
}
}else{
delete b;/////// Burayı control et hacıııı
}
}
tmpboard->resetLevel();
cout << "Min : " << tmpvalue << endl;
delete q;
return tmpboard;
}
Board* PruningDecisionW(Board* board, int turn, int level, clock_t st){
if(board->isFinished())
return board;
BoardQueue *q;
q = board->successor(turn);
cout << endl;
Board* tmpboard = board;
int tmpvalue = +99999;
int max;
while(!q->isEmpty()){
Board* b = q->dequeue();
max = MaxValuePruning(b, changeTurn1(turn), -99999, +99999, level, st);
if(max < tmpvalue){
tmpvalue = max;
if(tmpboard != board){
Board* tmmp = tmpboard;
tmpboard = b;
delete tmmp;
}else{
tmpboard = b;
}
}else{
delete b;/////// Burayı control et
}
}
delete q;
tmpboard->resetLevel();
cout << "Min : " << tmpvalue << endl;
return tmpboard;
}