#include "robber.h"
#include <iostream>
+#include <iterator>
+#include <cmath>
using namespace std;
using namespace __gnu_cxx;
-string Robber::turn(){
+struct FindCop : SPGoal{
+ int _limit;
+ const hash_map<string, Player>& _players;
+ FindCop(const hash_map<string, Player>& players, int limit = 0) : _players(players), _limit(limit){}
+ int operator()(const SPInfo* node) const{
+ if (_limit > 0 && node->cost >= _limit)
+ return -1;
+ for(hash_map<string, Player>::const_iterator player = _players.begin();
+ player != _players.end(); ++player){
+ if (player->second.type != robber && player->second.location == node->name){
+ return 1;
+ }
+ }
+ return 0;
+ }
+};
+string Robber::turn(){
+ hash_map<string,double> streets;
Intersection& inter = _intersections[_location];
-
- cerr << "Number of connecting streets: " << inter.connections.size() << endl;
-
for (hash_map<string,StreetType>::const_iterator street = inter.connections.begin();
- street != inter.connections.end(); ++street){
- cerr << "Checking: " << street->first << endl;
- if (street->second != car){
- cerr << "Moving to: " << street->first << endl;
- return street->first;
+ street != inter.connections.end(); ++street){
+ if (street->second == car){
+ cerr << "Discarding: " << street->first << " since car is needed" << endl;
+ continue;
+ }
+ double goodness = 10;
+ Intersection& conInter = _intersections[street->first];
+
+ list<string> l = shortestPath(street->first, _type, FindCop(_players, 5));
+ if (l.size() > 0){
+ cerr << "Cop " << l.size() << " intersections away." << endl;
+ if (l.size() < 3)
+ continue;
+ goodness *= 1 - 1/l.size();
+ }
+
+ if (conInter.type == bank){
+ cerr << "FOUND A BANK" << endl;
+ if (l.size() > 0 && l.size() < 4)
+ continue;
+ else if (_banks[street->first] > 0){
+ cerr << "No cop close to bank" << endl;
+ return street->first;
+ }
+ }
+ if (goodness == 0)
+ continue;
+ vector<double> banks;
+ for(hash_map<string,int>::const_iterator bank = _banks.begin();
+ bank != _banks.end(); ++bank){
+ //cerr << "Handling bank at: " << bank->first << endl;
+ if (bank->second > 0){
+ list<string> l = shortestPath(street->first, _type, SimpleSPGoal(bank->first));
+ if (l.size() < 1)
+ continue;
+ list<string>::iterator i = l.begin();
+ //++i;
+ banks.push_back(bank->second/(pow(l.size(),2.0)));
+ }
+ }
+ sort(banks.begin(),banks.end());
+ for (unsigned int i = 0; i < 2 && i < banks.size();++i)
+ goodness += banks[i];
+ cerr << "Street: " << street->first << " goodness: " << goodness << endl;
+ streets[street->first] = goodness;
+ }
+ streets[_oldLocation] /= 10;
+
+
+
+ /*cerr << "Using route: ";
+ copy(v.begin(), v.end(), ostream_iterator<string>(cerr, " : "));
+ cerr << endl;
+ */
+
+ string destination;
+ double goodness = 0;
+ for (hash_map<string,double>::const_iterator dest = streets.begin();
+ dest != streets.end(); ++dest){
+ cerr << "Goodness: " << dest->second << endl;
+ if (dest->second > goodness){
+ cerr << "New Goodness: " << dest->second << endl;
+ goodness = dest->second;
+ destination = dest->first;
}
}
- return _location;
+ _oldLocation = _location;
+
+ return destination;
}