}
if (positions.size() > 0){
_robberLocation = positions.top().second;
- cerr << "Sending myself to: " << _robberLocation << ", probability of robber: " << positions.top().first << endl;
+ //cerr << "Sending myself to: " << _robberLocation << ", probability of robber: " << positions.top().first << endl;
}
for (int i = 0; i < 2 && positions.size() > 1; ++i ){
positions.pop();
locations.push_back(positions.top().second);
- cerr << "Sending another cop to: " << locations.back() << ", probability of robber: " << positions.top().first << endl;
+ //cerr << "Sending another cop to: " << locations.back() << ", probability of robber: " << positions.top().first << endl;
}
}else{
locations.push_back(_robberLocation);
}
}
if (!cop.empty()){
- cerr << "Sending " << cop << " to " << locations.front() << endl;
+ //cerr << "Sending " << cop << " to " << locations.front() << endl;
_copTargets[cop].first = locations.front();
busyCops.push_back(cop);
}
return 0;
}
+
+#include "../botsrc/shortestPath.cpp"