more sane shortest path implementation and more tuning of the robber algorithm

[icfp05.git] / robber / robber.cpp

diff --git a/robber/robber.cpp b/robber/robber.cpp
index c888362d8768c231638aa52208b70b6bea697e22..4e2ec89521436121c22d5f62cc8f4bc2233a94cc 100644 (file)
--- a/robber/robber.cpp
+++ b/robber/robber.cpp
@@ -1,24 +1,85 @@
 #include "robber.h"
 #include <iostream>
+#include <iterator>
+#include <cmath>
 
 using namespace std;
 using namespace __gnu_cxx;
 
 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){
+               double goodness = 10;
+               int curx = _intersections[_location].x;
+               int cury = _intersections[_location].y;
+
+               int newx = _intersections[street->first].x;
+               int newy = _intersections[street->first].y;
+               for (hash_map<string, Player>::const_iterator player = _players.begin();
+                               player != _players.end(); ++player){
+                       if (player->first == _name)
+                               continue;
+
+                       int px = _intersections[player->second.location].x;
+                       int py = _intersections[player->second.location].y;
+
+                       double dist1 = sqrt(pow((curx-px),2.0)+pow((cury-py),2.0));
+                       double dist2 = sqrt(pow((newx-px),2.0)+pow((newy-py),2.0));
+                       /*cerr << "Original distance: " << dist1 << endl;
+                       cerr << "New distance: " << dist2 << endl;
+                       */
+
+
+                       if (dist2 < 50 && dist2 < dist1)
+                               goodness *= 0.95;
+
+                       if (player->second.type == cop_foot && dist2 <= 3)
+                               goodness /= 100;
+                       else if (player->second.type == cop_car && dist2 <= 2)
+                               goodness /= 100;
+
+
+               }
+               
+               cerr << "Street: " << street->first << " goodness: " << goodness << endl;
+               streets[street->first] = goodness;
+       }
+       streets[_oldLocation] /= 10;
+
+       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(_location, bank->first,_type);
+                       if (l.size() < 1)
+                               continue;
+                       list<string>::iterator i = l.begin();
+                       streets[*++i] += bank->second/(pow(5.0,double(l.size())));
+
+               }
+       }
+
+       /*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;
        
 }