-
Notifications
You must be signed in to change notification settings - Fork 0
/
IA.cpp
120 lines (90 loc) · 2.39 KB
/
IA.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
#include "IA.hpp"
#define DOUBLEWEIGHT 16
#define TRIPLEWEIGHT 64
#define QUADRUPLEWEIGHT 256
#define ATTACKCONSTANT 1
#define DEFENSECONSTANT 1
#define MAX 4
IA::IA() {
}
IA::~IA() {
}
std::pair<int,int> IA::makeYourMove(Array _board) {
Element e(_board);
std::pair<int,int> cord;
cord = minimaxStart(e);
return cord;
}
int IA::heuristic(Element e) {
int attackValue = ATTACKCONSTANT * (DOUBLEWEIGHT * e.getN_IADoubles()
+ TRIPLEWEIGHT * e.getN_IATriples()
+ QUADRUPLEWEIGHT * e.getN_IAQuadruples());
int defenseValue = DEFENSECONSTANT * (DOUBLEWEIGHT * e.getN_AdvDoubles()
+ TRIPLEWEIGHT * e.getN_AdvTriples()
+ QUADRUPLEWEIGHT * e.getN_AdvQuadruples());
return attackValue - defenseValue;
}
int IA::minimax(Element e, int level, bool player, int alpha, int beta) {
if (e.isLeaf()) {
//e.printBoard();
return this->utility(level, player);
} else if (level == MAX) {
return this->heuristic(e);
}
std::list<std::pair<int,int>> children = e.getPossibleMoves();
if (!player) {
for (auto it = children.begin(); it != children.end(); ++it) {
Element newElement(e.getBoard(),*it, false, e.getCounters());
int score = minimax(newElement, level + 1, true, alpha, beta);
if (score > alpha) {
alpha = score;
}
if (alpha >= beta) {
break;
}
}
return alpha;
}
else{
for (auto it = children.begin(); it != children.end(); ++it) {
Element newElement(e.getBoard(), *it, true, e.getCounters());
int score = minimax(newElement, level + 1, false, alpha, beta);
if (score < beta) {
beta = score;
}
if (alpha >= beta) {
break;
}
}
return beta;
}
}
std::pair<int,int> IA::minimaxStart(Element e){
std::list<std::pair<int,int>> children = e.getPossibleMoves();
std::pair<int,int> ret;
int alpha = -1000000;
int beta = 1000000;
if (children.size() == 225) {
ret.first = 7;
ret.second = 7;
return ret;
}
for (auto it = children.begin(); it != children.end(); ++it) {
Element newElement(e.getBoard(),(*it), false, e.getCounters());
int score = minimax(newElement, 1, true, alpha, beta);
if (score > alpha) {
alpha = score;
ret = *it;
}
if (alpha >= beta) {
break;
}
}
std::cout << "Heuristica : " << alpha << std::endl;
return ret;
}
int IA::utility(int level, bool player) {
if (player)
return 32 * QUADRUPLEWEIGHT * (MAX/level);
return -32 * QUADRUPLEWEIGHT * (MAX/level);
}