X-Git-Url: https://ruin.nu/git/?a=blobdiff_plain;f=robber%2Frobber.cpp;h=52e00de1fc50775d37093db9373e234976a66c3f;hb=33d49b42ba7bb8e9d043d0f33489cffaad303d43;hp=4e2ec89521436121c22d5f62cc8f4bc2233a94cc;hpb=f42b544842d9b9f21da3898225a70dec23c57a36;p=icfp05.git diff --git a/robber/robber.cpp b/robber/robber.cpp index 4e2ec89..52e00de 100644 --- a/robber/robber.cpp +++ b/robber/robber.cpp @@ -6,60 +6,76 @@ using namespace std; using namespace __gnu_cxx; +struct FindCop : SPGoal{ + int _limit; + const hash_map& _players; + FindCop(const hash_map& 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::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 streets; Intersection& inter = _intersections[_location]; for (hash_map::const_iterator street = inter.connections.begin(); street != inter.connections.end(); ++street){ + if (street->second == car){ + cerr << "Discarding: " << street->first << " since car is needed" << endl; + continue; + } double goodness = 10; - int curx = _intersections[_location].x; - int cury = _intersections[_location].y; + Intersection& conInter = _intersections[street->first]; - int newx = _intersections[street->first].x; - int newy = _intersections[street->first].y; - for (hash_map::const_iterator player = _players.begin(); - player != _players.end(); ++player){ - if (player->first == _name) + list 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(); + } - 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; - - + 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 banks; + for(hash_map::const_iterator bank = _banks.begin(); + bank != _banks.end(); ++bank){ + //cerr << "Handling bank at: " << bank->first << endl; + if (bank->second > 0){ + list l = shortestPath(street->first, _type, SimpleSPGoal(bank->first)); + if (l.size() < 1) + continue; + list::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; - for(hash_map::const_iterator bank = _banks.begin(); - bank != _banks.end(); ++bank){ - //cerr << "Handling bank at: " << bank->first << endl; - if (bank->second > 0){ - list l = shortestPath(_location, bank->first,_type); - if (l.size() < 1) - continue; - list::iterator i = l.begin(); - streets[*++i] += bank->second/(pow(5.0,double(l.size()))); - } - } /*cerr << "Using route: "; copy(v.begin(), v.end(), ostream_iterator(cerr, " : "));