vmann/gpn-maze-bot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

consider field size ;)

Browse source
This commit is contained in:
Thomas Lindner 2022-05-20 21:06:25 +02:00
parent 7e64cf85e0
commit 56aa4261f6
1 changed files with 14 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
src/main.cc
View file

@ -53,6 +53,7 @@ class Bot {
int x, y; int x, y;
bool up, right, down, left; bool up, right, down, left;
std::map<std::pair<int, int>, unsigned> known_map; std::map<std::pair<int, int>, unsigned> known_map;
int field_width, field_height;
asio::awaitable<void> Protocol(); asio::awaitable<void> Protocol();
asio::awaitable<void> Join(); asio::awaitable<void> Join();
@ -192,19 +193,23 @@ unsigned Bot::ShortestPath(int x, int y) {
if (visited.count(position)) { if (visited.count(position)) {
continue; continue;
} }
if (!(known_map[position] & static_cast<unsigned>(Direction::LEFT))) { if (!(known_map[position] & static_cast<unsigned>(Direction::LEFT)) &&
position.first > 0) {
queue.emplace(distance + 1, queue.emplace(distance + 1,
std::make_pair(position.first - 1, position.second)); std::make_pair(position.first - 1, position.second));
} }
if (!(known_map[position] & static_cast<unsigned>(Direction::RIGHT))) { if (!(known_map[position] & static_cast<unsigned>(Direction::RIGHT)) &&
position.first < field_width) {
queue.emplace(distance + 1, queue.emplace(distance + 1,
std::make_pair(position.first + 1, position.second)); std::make_pair(position.first + 1, position.second));
} }
if (!(known_map[position] & static_cast<unsigned>(Direction::UP))) { if (!(known_map[position] & static_cast<unsigned>(Direction::UP)) &&
position.second > 0) {
queue.emplace(distance + 1, queue.emplace(distance + 1,
std::make_pair(position.first, position.second - 1)); std::make_pair(position.first, position.second - 1));
} }
if (!(known_map[position] & static_cast<unsigned>(Direction::DOWN))) { if (!(known_map[position] & static_cast<unsigned>(Direction::DOWN)) &&
position.second < field_height) {
queue.emplace(distance + 1, queue.emplace(distance + 1,
std::make_pair(position.first, position.second + 1)); std::make_pair(position.first, position.second + 1));
} }
@ -215,6 +220,11 @@ unsigned Bot::ShortestPath(int x, int y) {
} }
asio::awaitable<void> Bot::ChooseMove() { asio::awaitable<void> Bot::ChooseMove() {
if (known_map.empty()) {
field_width = x;
field_height = y;
}
// update map // update map
known_map[std::make_pair(x, y)] = known_map[std::make_pair(x, y)] =
(up ? static_cast<unsigned>(Direction::UP) : 0) | (up ? static_cast<unsigned>(Direction::UP) : 0) |