X-Git-Url: https://ruin.nu/git/?p=icfp05.git;a=blobdiff_plain;f=robber%2Frobber.cpp;h=dbb287a4d760b5bb2dd231497778866318fb24a4;hp=c888362d8768c231638aa52208b70b6bea697e22;hb=d7d9942fc9d1066670e166182e36791dfbf035d7;hpb=dc67a266d0011df3e82a5c7231d12a52d01dfc39

diff --git a/robber/robber.cpp b/robber/robber.cpp
index c888362..dbb287a 100644
--- a/robber/robber.cpp
+++ b/robber/robber.cpp
@@ -1,24 +1,104 @@
 #include "robber.h"
 #include <iostream>
+#include <iterator>
+#include <queue>
+#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){
+		if (street->second == car){
+			cerr << "Discarding: " << street->first << " since car is needed" << endl;
+			continue;
+		}
+		double goodness = 0;
+		Intersection& conInter = _intersections[street->first];
+
+		list<string> closestFootCop = shortestPath(street->first, cop_foot, FindPlayer(_players, cop_foot, 6), true);
+		list<string> closestCarCop = shortestPath(street->first, cop_car, FindPlayer(_players, cop_car, 5), true);
+
+		unsigned int closestCop = 0;
+		bool copInCar = false;
+
+		if (closestCarCop.size() < closestFootCop.size() && closestCarCop.size() > 0){
+			closestCop = closestCarCop.size();
+			copInCar = true;
+		}else 
+			closestCop = closestFootCop.size();
+
+		if (closestCop > 0 && closestCop < 3){
+			cerr << "Cop " << closestCop << " intersections away." << endl;
+			continue;
+		}
+
+		priority_queue<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(bank->second/(pow(l.size(),4.0)));
+			}
+		}
+		//sort(banks.begin(),banks.end(),greater<double>());
+
+		for (unsigned int i = 0; i < 2 && banks.size() > 0;++i){
+			goodness += banks.top();
+			banks.pop();
+		}
+
+		cerr << "Goodness before cop: " << goodness << endl;
+		if (closestCop > 2){
+			cerr << "Cop " << closestCop << " intersections away." << endl;
+			goodness *= 1 - 1/(copInCar ? closestCop : closestCop - 1);
+		}
+		cerr << "Goodness after cop: " << goodness << endl;
+
+		if (conInter.type == bank){
+			cerr << "FOUND A BANK" << endl;
+			if (closestCop > 0 && closestCop < 4)
+				continue;
+			else if (_banks[street->first] > 0){
+				cerr << "No cop close to bank" << endl;
+				return street->first;
+			}
+		}
+		
+		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 = _location;
+	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;
 	
 }