using namespace std;
using namespace __gnu_cxx;
-string Cop::turn(){
- //cerr << "New turn" << endl;
- string input;
-
- sendInformation();
- //cerr << "Getting information " << endl;
- getInformation();
-
- sendPlan();
- getPlans();
-
- vote();
-
- getline(cin,input);
- if (input != "nowinner:"){
- string winner = value<string>(input);
- if (winner != _name)
- ++_winningPlans[winner];
- }
-
- return _location;
-}
-
void Cop::preGamePreparations(){
//cerr << "Preparing.." << endl;
_copTargets[_name].first = _robberLocation;
banks.pop();
}
for (hash_map<string,Player>::const_iterator player = _players.begin();
- player != _players.end() && banks2.size() > 0; ++player){
- if (player->first == _name || player->second.type == robber)
+ player != _players.end(); ++player){
+ //cerr << "Inital plan for player: " << player->first << endl;
+ if (player->second.type == robber){
+ _robber = player->first;
+ continue;
+ }else if (banks2.size() <= 0 || player->first == _name)
continue;
+
const pair<int,string>& bank = banks2.top();
_copTargets[player->first].first = bank.second;
//cerr << "Sending: " << player->first << " to: " << bank.second;
_winningPlans[player->first] = 0;
banks2.pop();
}
+ _maybeRobber.push_back(hash_map<string,int>());
}
void Cop::sendInformation(){
+ _maybeRobber.push_back(hash_map<string,int>());
+ hash_map<string,int>& maybeRobber = _maybeRobber.back();
+ int possibilities = 0;
+ if (_robberLocation.empty()){
+
+ hash_map<string, Intersection>::const_iterator intersection = _intersections.find(_location);
+
+ for (hash_map<string,StreetType>::const_iterator adj = intersection->second.connections.begin();
+ adj != intersection->second.connections.end(); ++adj){
+
+ if (_smell == 1){
+ hash_map<string,int>::iterator location = maybeRobber.find(adj->first);
+ if (location == maybeRobber.end()){
+ hash_map<string, Intersection>::const_iterator intersection = _intersections.find(adj->first);
+ int neigh = maybeAtNeighbor(intersection->second);
+ if (neigh > -1){
+ maybeRobber[adj->first] = 100 + neigh;
+ ++possibilities;
+ }else
+ maybeRobber[adj->first] = -100;
+ }
+ }else{
+ if (_smell == 0)
+ maybeRobber[adj->first] = -100;
+ hash_map<string, Intersection>::const_iterator intersection = _intersections.find(adj->first);
+ for (hash_map<string,StreetType>::const_iterator adj = intersection->second.connections.begin();
+ adj != intersection->second.connections.end(); ++adj){
+ hash_map<string,int>::iterator location = maybeRobber.find(adj->first);
+ if (location == maybeRobber.end()){
+ if (_smell == 0)
+ maybeRobber[adj->first] = -100;
+ else {
+ hash_map<string, Intersection>::const_iterator intersection = _intersections.find(adj->first);
+ int neigh = maybeAtNeighbor(intersection->second);
+ if (neigh > -1){
+ maybeRobber[adj->first] = 100 + neigh;
+ ++possibilities;
+ }
+ else
+ maybeRobber[adj->first] = -100;
+ }
+ }
+ }
+ }
+ }
+ } else {
+ maybeRobber[_robberLocation] = 100;
+ possibilities = 1;
+ hash_map<string, Intersection>::const_iterator intersection = _intersections.find(_location);
+
+ for (hash_map<string,StreetType>::const_iterator adj = intersection->second.connections.begin();
+ adj != intersection->second.connections.end(); ++adj){
+ maybeRobber[adj->first] = -100;
+ for (hash_map<string,StreetType>::const_iterator adj = intersection->second.connections.begin();
+ adj != intersection->second.connections.end(); ++adj){
+ hash_map<string,int>::iterator location = maybeRobber.find(adj->first);
+ if (location != maybeRobber.end())
+ maybeRobber[adj->first] = -100;
+ }
+
+ }
+
+
+ }
cout << "inf\\" << endl;
+ for (hash_map<string,int>::iterator location = maybeRobber.begin();
+ location != maybeRobber.end(); ++location){
+ if (location->second > 0)
+ location->second /= possibilities;
+ cout << "inf: " << _robber << " " << location->first << " " << _playerTypeNames[robber] << " "
+ << _world << " " << location->second << endl;
+ }
cout << "inf/" << endl;
}
void Cop::getInformation(){
string input;
-
- if (false && _robberLocation.empty()){ //Disable for now, since it takes to long time, and does nothing
- if (_smell > 0){
- //TODO: Calculate smell
- }
+ if (_robberLocation.empty()){
+ hash_map<string,int>& maybeRobber = _maybeRobber.back();
while (true){
getline(cin, input);
if (input == "from/")
inf >> bot;
string loc;
inf >> loc;
+ string type;
+ inf >> type;
+ if (type != _playerTypeNames[robber])
+ continue;
int world;
inf >> world;
if (world != _world)
int certainty;
inf >> certainty;
- //TODO: Calculate possibilties
+ hash_map<string,int>::iterator location = maybeRobber.find(loc);
+ if (location == maybeRobber.end()){
+ hash_map<string, Intersection>::const_iterator intersection = _intersections.find(loc);
+ if (intersection != _intersections.end())
+ continue; //The intersection doesn't exist, so ignore it.
+ int neigh = maybeAtNeighbor(intersection->second);
+ if (neigh >= 0)
+ maybeRobber[loc] = certainty + neigh;
+ else
+ maybeRobber[loc] = -200;
+ }else if (location->second > 0)
+ location->second += certainty;
}
}
}else{
getline(cin,input);
}while(input != "from/");
}
+ _maybeRobber.pop_front();
+
+}
+int Cop::maybeAtNeighbor(const Intersection& intersection){
+ int possibility = -1;
+ for (hash_map<string,StreetType>::const_iterator adj = intersection.connections.begin();
+ adj != intersection.connections.end(); ++adj){
+ hash_map<string,int>::iterator oldLoc = _maybeRobber.front().find(adj->first);
+ if (oldLoc == _maybeRobber.front().end() || oldLoc->second > 0){
+ if (possibility < 0){
+ possibility = 0;
+ }
+ if (oldLoc != _maybeRobber.front().end())
+ possibility += oldLoc->second;
+ }
+ }
+ return possibility;
}
void Cop::sendPlan(){
//cerr << "Planning" << endl;
+ list<string> locations;
if (_robberLocation.empty()){
- //Use information for plan.
+ priority_queue<pair<int,string> > positions;
+ for (hash_map<string,int>::iterator location = _maybeRobber.front().begin();
+ location != _maybeRobber.front().end(); ++location){
+ if (location->second > 0)
+ positions.push(pair<int,string>(location->second,location->first));
+
+ }
+ if (positions.size() > 0){
+ _robberLocation = positions.top().second;
+ //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;
+ }
+ }else{
+ locations.push_back(_robberLocation);
+ locations.push_back(_robberLocation);
}
- else{
+ if (!_robberLocation.empty()){
//cerr << "Robber found at " << _robberLocation << endl;
_copTargets[_name].first = _robberLocation;
- list<string> closestFootCop = shortestPath(_robberLocation, cop_foot, FindPlayer(_players, cop_foot), true);
- list<string> closestCarCop = shortestPath(_robberLocation, cop_car, FindPlayer(_players, cop_car, closestFootCop.size() - 1), true);
- PlayerType copType = cop_foot;
- string copLocation;
- if (closestCarCop.size() > 0){
- copType = cop_car;
- copLocation = closestCarCop.back();
- }else
- copLocation = closestFootCop.back();
-
-
- for (hash_map<string,Player>::const_iterator player = _players.begin();
- player != _players.end(); ++player){
- if (player->first == _name || player->second.type == robber)
- continue;
- if (player->second.type == copType && player->second.location == copLocation)
- _copTargets[player->first].first = _robberLocation;
+
+ vector<string> busyCops;
+ busyCops.push_back(_name);
+ while (locations.size() > 0){
+ string cop;
+ int dist = 1000000;
+ for (hash_map<string,Player>::const_iterator player = _players.begin();
+ player != _players.end();++player){
+ if (player->second.type == robber || find(busyCops.begin(), busyCops.end(), player->first) != busyCops.end())
+ continue;
+ list<string> l = shortestPath(player->second.location, player->second.type,SimpleSPGoal(locations.front(), dist-1));
+ if (l.size() > 0 && l.size() < dist){
+ dist = l.size();
+ cop = player->first;
+ if (dist == 1)
+ break;
+ }
+ }
+ if (!cop.empty()){
+ //cerr << "Sending " << cop << " to " << locations.front() << endl;
+ _copTargets[cop].first = locations.front();
+ busyCops.push_back(cop);
+ }
+ locations.pop_front();
}
}
//cerr << "Sending plan." << endl;
cout << "plan/" << endl;
}
-void Cop::getPlans(){
- string input;
-
-
- //ignore From-plan
- do{
- getline(cin,input);
- }while(input != "from/");
-
-
-}
-
-void Cop::vote(){
- cout << "vote\\" << endl;
- cout << "vote: " << _name << endl;
- priority_queue<pair<int,string> > players;
- for (hash_map<string,int>::const_iterator player = _winningPlans.begin();
- player != _winningPlans.end(); ++player){
- players.push(pair<int,string>(-player->second, player->first));
- }
- while (players.size() > 0){
- const pair<int,string>& player = players.top();
- cout << "vote: " << player.second << endl;
- //cerr << "voted for " << player.second << " with " << player.first << " previously won plans" << endl;
- players.pop();
- }
- cout << "vote/" << endl;
+void Cop::move(std::string location){
+ cout << "cmov\\" << endl;
+ cout << "straight-arrow:" << endl;
+ cout << "mov\\" << endl;
+ Bot::move(location);
+ cout << "mov/" << endl;
+ cout << "acc\\" << endl;
+ cout << "acc/" << endl;
+ cout << "cmov/" << endl;
}
int main(){
return 0;
}
+
+#include "../botsrc/shortestPath.cpp"
projects / icfp05.git / blobdiff