-
Notifications
You must be signed in to change notification settings - Fork 0
/
referee.cc
297 lines (255 loc) · 9.07 KB
/
referee.cc
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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
#include "referee.h"
#include <iostream>
#include <fstream>
#include <sstream>
#include <stdlib.h>
#include <time.h>
referee::referee (const int nanomuncher_num, const char *input,
const char * port) :
file_name (input),
port (port),
red_score(0),
blue_score(0),
red_left(nanomuncher_num),
blue_left(nanomuncher_num),
graph_m_ (20,10),
is_munching (false),
prepare_done (false) {
// read input and generate graph
prepare ();
}
referee::~referee () {
// destruct the server
if (ptr_server != NULL) {
delete ptr_server;
}
}
void referee::prepare () {
// read input from local input file
std::ifstream inputfile (file_name.c_str());
std::map<int, std::pair<int, int> > id2coord;
std::vector< std::pair<int, int> > edges;
if ( !inputfile.is_open() ) { prepare_done = false; return; }
std::string line;
int phase = 0;
const int parsing_nodes = phase + 1;
const int parsing_edges = phase + 2;
while ( inputfile.good() ) {
std::getline (inputfile, line);
if ( line.empty() ) { continue; }
if (line.find ("nodeid,xloc,yloc") != std::string::npos) {
phase++;
continue;
}
if (line.find ("nodeid1,nodeid2") != std::string::npos) {
phase++;
continue;
}
if (parsing_nodes == phase) {
std::istringstream iss (line);
char not_used;
int nodeid, x, y;
iss >> nodeid >> not_used >> x >> not_used >> y;
id2coord.insert (std::pair< int, std::pair<int, int> >
(nodeid, std::pair<int, int> (x, y)));
continue;
}
if (parsing_edges == phase) {
std::istringstream iss (line);
char not_used;
int nodeid1, nodeid2;
iss >> nodeid1 >> not_used >> nodeid2;
edges.push_back (std::pair<int, int> (nodeid1, nodeid2) );
continue;
}
}
inputfile.close();
graph_m_.set_nodes(id2coord).set_edges(edges);
graph_msg = protocol::generate_graph_msg (id2coord, edges);
// new delete pair
ptr_server = new conn::socket_server(port.c_str(), 10, "\n");
if ( !ptr_server->is_good () ) { prepare_done = false; return; }
// set file descriptors
fd_for_red = ptr_server->accept_client();
fd_for_blue = ptr_server->accept_client();
if (fd_for_red < 0 || fd_for_blue < 0) { prepare_done = false; return; }
srand ( time(NULL) );
prepare_done = true;
return;
}
bool referee::is_prepare_done () {
return prepare_done;
}
void referee::game_init () {
// read team names from both player
std::string red_join_msg;
std::string blue_join_msg;
ptr_server->read (fd_for_red, red_join_msg);
ptr_server->read (fd_for_blue, blue_join_msg);
red_team_name = protocol::parse_join (red_join_msg);
blue_team_name = protocol::parse_join (blue_join_msg);
std::string role_msg_red = protocol::generate_role_msg ("RED");
std::string role_msg_blue = protocol::generate_role_msg ("BLUE");
ptr_server->write (fd_for_red, role_msg_red);
ptr_server->write (fd_for_blue, role_msg_blue);
// send GRAPH message
ptr_server->write(fd_for_red, graph_msg);
ptr_server->write(fd_for_blue, graph_msg);
}
void referee::game_loop () {
do {
state s (get_current_state ());
std::string play_msg = protocol::generate_play_msg ( s );
ptr_server->write (fd_for_red, play_msg);
ptr_server->write (fd_for_blue, play_msg);
std::string msg_from_red;
std::string msg_from_blue;
// receive ADD message from players
ptr_server->read (fd_for_red, msg_from_red);
ptr_server->read (fd_for_blue, msg_from_blue);
std::cout << "[RED player] " << msg_from_red << std::endl;
std::cout << "[BLUE player] " << msg_from_blue << std::endl;
// play all nanomunchers ( old and new )
std::vector<muncher> new_munchers_red =
protocol::parse_add (1, msg_from_red);
std::vector<muncher> new_munchers_blue =
protocol::parse_add (2, msg_from_blue);
// Send ACK message to player
ptr_server->write (fd_for_red, protocol::generate_ack_msg ("OK"));
ptr_server->write (fd_for_blue, protocol::generate_ack_msg ("OK"));
is_munching = false;
// Let all nanomunchers, along with new ones, to make one
// move.
play_one_round (new_munchers_red, new_munchers_blue);
// Print out the graph state after one round.
std::cout << "[Referee] " << std::endl << graph_m_.str() << std::endl;
} while ( is_munching );
}
// Play all nanomunchers for one round.
// Resolve any conflict.
void referee::play_one_round(std::vector<muncher> &reds,
std::vector<muncher> &blues) {
// Update red_left and blue_left
int new_red_size = reds.size();
int new_blue_size = blues.size();
// Truncate if give more nanomunchers allowed.
if ( new_red_size > red_left ) {
new_red_size = red_left;
reds.resize(new_red_size);
}
if ( new_blue_size > blue_left) {
new_blue_size = blue_left;
blues.resize(new_blue_size);
}
red_left -= new_red_size;
blue_left -= new_blue_size;
// Phase one, apply new nanomunchers before move
deploy_new_nanomunchers (reds, blues);
// Phase two, run all nanomunchers.
run_nanomunchers ();
}
void referee::deploy_new_nanomunchers (std::vector<muncher> &reds,
std::vector<muncher> &blues) {
std::map<int, std::vector<muncher> > id2old_munchers;
std::map<int, std::vector<muncher> > id2new_munchers;
for (int i = 0; i < red_munchers.size(); i++) {
id2old_munchers[ red_munchers[i].get_nodeid() ].push_back(red_munchers[i]);
}
for (int i = 0; i < blue_munchers.size(); i++) {
id2old_munchers[ blue_munchers[i].get_nodeid() ].push_back(blue_munchers[i]);
}
for (int i = 0; i < reds.size(); i++) {
id2new_munchers[ reds[i].get_nodeid() ].push_back(reds[i]);
}
for (int i = 0; i < blues.size(); i++) {
id2new_munchers[ blues[i].get_nodeid() ].push_back(blues[i]);
}
// red_munchers.clear();
// blue_munchers.clear();
// Resolve conflict when adding new nanomunchers
std::map<int, std::vector<muncher> >::iterator it;
for (it = id2new_munchers.begin(); it != id2new_munchers.end(); it++) {
// Old nanomuncher kill new nanomunchers.
if (id2old_munchers.find( (*it).first ) != id2old_munchers.end()) continue;
// Randomly pick one nanomuncher.
int index = 0;
if ( (*it).second.size() > 1) {
index = rand () % (*it).second.size();
}
if ( (*it).second[index].get_player() == 1 ) {
// a red nanomuncher
red_munchers.push_back( (*it).second[index] );
} else {
// a blue nanomuncher
blue_munchers.push_back ( (*it).second[index] );
}
}
}
void referee::run_nanomunchers () {
// For each nanomuncher, munch the node at current position
for (int i = 0; i < red_munchers.size(); i++) {
is_munching = true;
red_munchers[i].munch ( graph_m_ );
red_score++;
// Temporarily move to next moveable node.
// If this nanomuncher can't move in any direction, remove it.
if ( -1 == red_munchers[i].move_to_next_node ( graph_m_ ) )
red_munchers.erase (red_munchers.begin() + i);
}
for (int i = 0; i < blue_munchers.size(); i++) {
is_munching = true;
blue_munchers[i].munch ( graph_m_ );
blue_score++;
if ( -1 == blue_munchers[i].move_to_next_node ( graph_m_ ) )
blue_munchers.erase (blue_munchers.begin() + i);
}
// Resolve conflict when more than one nanomunchers move into
// a single node.
std::map< int, std::vector<muncher> > id2munchers;
for (int i = 0; i < red_munchers.size(); i++) {
id2munchers[ red_munchers[i].get_nodeid() ].push_back (red_munchers[i]);
}
for (int i = 0; i < blue_munchers.size(); i++) {
id2munchers[ blue_munchers[i].get_nodeid() ].push_back (blue_munchers[i]);
}
red_munchers.clear();
blue_munchers.clear();
std::map<int, std::vector<muncher> >::iterator it;
for (it = id2munchers.begin(); it != id2munchers.end(); it++) {
int index = 0;
if ( (*it).second.size() > 1 ) {
int max_priority = -1;
// up > left > down > right
for (int i = 0; i < (*it).second.size(); i++) {
int current_priority = (*it).second[i].get_last_movement_priority ();
if ( current_priority > max_priority ) {
max_priority = current_priority;
index = i;
}
}
}
if ( (*it).second[index].get_player() == 1 ) {
// a red nanomuncher
red_munchers.push_back( (*it).second[index] );
} else {
// a blue nanomuncher
blue_munchers.push_back ( (*it).second[index] );
}
}
}
std::string referee::declare_result () {
// send result to two clients
std::string gameover_msg = protocol::generate_gameover_msg (red_score, blue_score);
ptr_server->write (fd_for_red, gameover_msg);
ptr_server->write (fd_for_blue, gameover_msg);
std::stringstream ss (std::stringstream::in | std::stringstream::out);
std::cout << "[Referee] " << gameover_msg << std::endl;
return gameover_msg;
}
state referee::get_current_state () const {
// constuct a state class to reflect current state
std::vector<int> eaten_nodes = graph_m_.get_eaten_nodes();
state s (red_score, blue_score, red_left, red_munchers, blue_left, blue_munchers,
eaten_nodes);
return s;
}