-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathdefensive.cpp
More file actions
127 lines (119 loc) · 2.53 KB
/
Copy pathdefensive.cpp
File metadata and controls
127 lines (119 loc) · 2.53 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
#include "defensive.h"
#include <iostream>
void defensive::execute(Player* user){
while (canAttack(user)){
vector<Country*> countries = user->GetCountries();
for (size_t i = 0; i < countries.size(); i++)
{
int j;
Country** a = countries[i]->getAdjacent();
vector<Country*> attAdj;
for (j = 0; j < countries[i]->getAdjacentCount(); j++)
{
if (a[j]->occupiedBy->name != user->name)
{
if (countries[i]->getNumberOfPieces()*0.4 < a[j]->getNumberOfPieces())
{
break;
}
else
attAdj.push_back(a[j]);
}
}
if (j == countries[i]->getAdjacentCount()){
Battle(countries[i], attAdj[rand() % attAdj.size()]);
}
}
}
}
bool defensive::canAttack(Player* user){
vector<Country*> countries = user->GetCountries();
for (size_t i = 0; i < countries.size(); i++)
{
int j;
Country** a = countries[i]->getAdjacent();
vector<Country*> attAdj;
for (j = 0; j < countries[i]->getAdjacentCount(); j++)
{
if (a[j]->occupiedBy->name != user->name)
{
if (countries[i]->getNumberOfPieces()*0.4 < a[j]->getNumberOfPieces())
{
break;
}
else
attAdj.push_back(a[j]);
}
}
if (j == countries[i]->getAdjacentCount()){
return true;
}
}
return false;
}
int defensive::reinforce(Player* user)
{
int max = 0;
int index = 0;
vector<Country*> countries = user->GetCountries();
for (size_t i = 0; i < countries.size(); i++)
{
int tmp = 0;
for (int j = 0; j < countries[i]->getAdjacentCount(); j++)
{
Country** a = countries[i]->getAdjacent();
if ((*a)->occupiedBy->name == user->name)
tmp++;
}
if (tmp > max)
{
max = tmp;
index = i;
}
}
return index;
}
void defensive::fortification(Player* user)
{
vector<Country*> countries = user->GetCountries();
vector<Country*> temp;
int max;
int index;
for (size_t i = 0; i < countries.size(); i++)
{
Country** a = countries[i]->getAdjacent();
for (int j = 0; j < countries[i]->getAdjacentCount(); j++)
{
if (a[j]->occupiedBy->name == user->name)
{
temp.push_back(a[j]);
}
}
}
max = 0;
index = 0;
Country** country = NULL;
if (temp.size() > 0)
{
for (int k = 0; k < temp.size(); k++)
{
int tmp = 0;
for (int j = 0; j < temp[k]->getAdjacentCount(); j++)
{
Country** a = countries.at(k)->getAdjacent();
if ((*a)->occupiedBy->name != user->name)
{
tmp++;
country = a;
}
}
if (tmp > max)
{
max = tmp;
index = k;
}
}
temp[index]->numberOfPieces = (*country)->numberOfPieces - 1;
(*country)->numberOfPieces = 1;
}
}