#include <sstream>
#include <iterator>
#include <queue>
+#include <vector>
#include <utility>
#include "bot.h"
using namespace std;
using namespace __gnu_cxx;
-struct VectComp{
- bool operator()(const vector<string>& v1, const vector<string>& v2){
- return v1.size() > v2.size();
- }
-};
-Bot::Bot(string name, string type){
+
+Bot::Bot(const string& name, PlayerType type){
_name = name;
_type = type;
- /*
- priority_queue<vector<string>, vector<vector<string> >, VectComp> pq;
-
- vector<string> v;
- v.push_back("hej");
- pq.push(v);
- v.push_back("hå");
- pq.push(v);
- v.push_back("blaha");
- pq.push(v);
- v.clear();
- v.push_back("hej hå");
- pq.push(v);
- v.clear();
- v.push_back("hejsan");
- pq.push(v);
- v.push_back("what?");
- pq.push(v);
- v.push_back("blaha");
- pq.push(v);
-
- cerr << "Size: " << pq.top().size() << " " << pq.top()[0] << endl;
- pq.pop();
- cerr << "Size: " << pq.top().size() << " " << pq.top()[0] << endl;
- pq.pop();
- cerr << "Size: " << pq.top().size() << " " << pq.top()[0] << endl;
- pq.pop();
- cerr << "Size: " << pq.top().size() << " " << pq.top()[0] << endl;
- pq.pop();
- cerr << "Size: " << pq.top().size() << " " << pq.top()[0] << endl;
- pq.pop();
- cerr << "Size: " << pq.top().size() << " " << pq.top()[0] << endl;
- pq.pop();
+ _playerTypeNames[robber] = "robber";
+ _playerTypeNames[cop_foot] = "cop-foot";
+ _playerTypeNames[cop_car] = "cop-car";
-*/
+ _playerTypes["robber"] = robber;
+ _playerTypes["cop-foot"] = cop_foot;
+ _playerTypes["cop-car"] = cop_car;
}
void Bot::play(){
- cout << "reg: " << _name << " " << _type << endl;
+ cout << "reg: " << _name << " " << _playerTypeNames[_type] << endl;
string input;
getline(cin, input);
_name = value<string>(input);
cerr << "Got name: " << _name << endl;
- //robber and 5 cops
- getline(cin, input);
- _players[value<string>(input)].type = "robber";
- getline(cin, input);
- _players[value<string>(input)].type = "cop-foot";
- getline(cin, input);
- _players[value<string>(input)].type = "cop-foot";
- getline(cin, input);
- _players[value<string>(input)].type = "cop-foot";
- getline(cin, input);
- _players[value<string>(input)].type = "cop-foot";
+ getPlayers();
cerr << "Got players, building graph." << endl;
getline(cin, input);
buildGraph();
- getline(cin, input);
while (true){
getline(cin, input);
updateWorld();
_type = _players[_name].type;
_location = _players[_name].location;
- getline(cin, input);
cerr << "New turn" << endl;
move(turn());
cerr << "Done with turn." << endl;
}
}
-Bot::~Bot(){
+void Bot::getPlayers(){
+ string input;
+ //robber and 5 cops
+ getline(cin, input);
+ _players[value<string>(input)].type = robber;
+ getline(cin, input);
+ _players[value<string>(input)].type = cop_foot;
+ getline(cin, input);
+ _players[value<string>(input)].type = cop_foot;
+ getline(cin, input);
+ _players[value<string>(input)].type = cop_foot;
+ getline(cin, input);
+ _players[value<string>(input)].type = cop_foot;
}
/**
node >> input;
node >> input;
Intersection& inter = _intersections[input];
- node >> inter.type;
+ node >> input;
+ if (input == "bank")
+ inter.type = bank;
+ else if (input == "hq")
+ inter.type = hq;
+ else if (input == "robber-start")
+ inter.type = robber_start;
+ else
+ inter.type = ordinary;
node >> inter.x;
node >> inter.y;
}
street >> to;
string type;
street >> type;
- cerr << "Street between: " << from << " and " << to << " of type: " << type << endl;
+ //cerr << "Street between: " << from << " and " << to << " of type: " << type << endl;
if (type == "foot"){
_intersections[from].connections[to] = both;
Intersection& inter = _intersections[to];
_intersections[from].connections[to] = car;
}
cerr << "Number of streets: " << streets << endl;
+ getline(cin, input);
}
void Bot::updateWorld(){
if (input == "ev/")
break;
istringstream evidence(input);
+ int world;
+ evidence >> input;
+ evidence >> input;
+ evidence >> world;
+ _evidence[world] = input;
}
getline(cin,input);
//cerr << "Player: " << input << endl;
Player& pl = _players[input];
player >> pl.location;
- player >> pl.type;
+ player >> input;
+ pl.type = _playerTypes[input];
}
//cerr << "Number of players: " << _players.size() << endl;
+ getline(cin, input);
}
void Bot::move(std::string location){
cerr << "Moving to: " << location << endl;
- cout << "mov: " << location << " " << _type << endl;
+ cout << "mov: " << location << " " << _playerTypeNames[_type] << endl;
}
template<class T>
return _location;
}
-std::vector<std::string> Bot::shortestPath(std::string from, std::string to, std::string type){
-
- priority_queue<vector<string>, vector<vector<string> >, VectComp > pq;
+struct SPInfoComp{
+ bool operator()(const SPInfo* v1, const SPInfo* v2){
+ return v1->cost > v2->cost;
+ }
+};
+
+std::list<std::string> Bot::shortestPath(const std::string& from, PlayerType type, const SPGoal& goal, bool reverse){
- vector<string> v;
- v.push_back(from);
+ //cerr << "New shortest path from: " << from << endl;
+
+ priority_queue<SPInfo*, vector<SPInfo* >, SPInfoComp > pq;
+ hash_map<string,SPInfo> nodes;
- pq.push(v);
- hash_map<string,bool> settled;
+ SPInfo* node = &nodes[from];
+ node->name = from;
+ node->settled = false;
+ node->parent = 0;
+ node->cost = 0;
+ pq.push(node);
+ int g = 0;
+ bool hascar = type == cop_car;
while(!pq.empty()){
- const vector<string> w = pq.top();
+ node = pq.top();
pq.pop();
//cerr << "Vector with size: " << w.size() << endl;
- //cerr << "Looking at: " << w.back() << endl;
+ //cerr << "Looking at: " << node->name << endl;
//copy(w.begin(), w.end(), ostream_iterator<string>(cerr, " : "));
- if (w.back() == to)
- return w;
- settled[w.back()] = true;
- Intersection& inter = _intersections[w.back()];
+
+ g = goal(node);
+ if (g < 0)
+ break;
+ else if (g){
+ list<string> l;
+ front_insert_iterator<list<string> > ii(l);
+ do{
+ *ii++ = node->name;
+ node = node->parent;
+ }while (node != 0);
+ return l;
+ }
+ node->settled = true;
+
+ Intersection& inter = _intersections[node->name];
for (hash_map<string,StreetType>::const_iterator street = inter.connections.begin();
street != inter.connections.end(); ++street){
- if (settled.find(street->first) != settled.end())
- continue;
- //cerr << "Adding: " << street->first << endl;
- bool hascar = type == "cop-car";
- if ( (hascar && (street->second == car || street->second == both)) ||
- (!hascar && (street->second == foot || street->second == both))){
-
- v = w;
- v.push_back(street->first);
- pq.push(v);
+ hash_map<string,SPInfo>::iterator newNode = nodes.find(street->first);
+ bool travelStreet = false;
+ if (hascar){
+ if (reverse){
+ if (street->second != foot){
+ hash_map<string,StreetType>::const_iterator st = _intersections[street->first].connections.find(node->name);
+ if (st != _intersections[street->first].connections.end())
+ travelStreet = st->second != foot;
+ else
+ travelStreet = false;
+ }else
+ travelStreet = true;
+ }else
+ travelStreet = street->second != foot;
+ }else{
+ travelStreet = street->second != car;
+ }
+ if (travelStreet){
+ //cerr << "Adding street: " << street->first << endl;
+ SPInfo* n = 0;
+ if (newNode == nodes.end()){
+ n = &nodes[street->first];
+ n->name = street->first;
+ n->settled = false;
+ n->parent = 0;
+ n->cost = 10000;
+ }else if (newNode->second.settled)
+ continue;
+ else
+ n = &newNode->second;
+
+ if (n->cost > node->cost + 1){
+ n->cost = node->cost + 1;
+ n->parent = node;
+ pq.push(n);
+ }
}
}
}
- return vector<string>();
+ return list<string>();
+}
+
+SimpleSPGoal::SimpleSPGoal(std::string to):_to(to){
+}
+
+int SimpleSPGoal::operator()(const SPInfo* node) const{
+ if (node->name == _to)
+ return 1;
+ return 0;
+}
+
+FindPlayer::FindPlayer(const hash_map<string, Player>& players, PlayerType type, int limit) : _players(players), _type(type), _limit(limit){
+}
+
+int FindPlayer::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 == _type && player->second.location == node->name){
+ return 1;
+ }
+ }
+ return 0;
}
projects / icfp05.git / blobdiff