DangerHitMapAnalyzer.cpp 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
  1. /*
  2. * DangerHitMapAnalyzer.cpp, part of VCMI engine
  3. *
  4. * Authors: listed in file AUTHORS in main folder
  5. *
  6. * License: GNU General Public License v2.0 or later
  7. * Full text of license available in license.txt file, in main folder
  8. *
  9. */
  10. #include "StdInc.h"
  11. #include "DangerHitMapAnalyzer.h"
  12. #include "lib/mapping/CMap.h" //for victory conditions
  13. extern boost::thread_specific_ptr<CCallback> cb;
  14. extern boost::thread_specific_ptr<VCAI> ai;
  15. void DangerHitMapAnalyzer::updateHitMap()
  16. {
  17. if(upToDate)
  18. return;
  19. upToDate = true;
  20. auto mapSize = cb->getMapSize();
  21. hitMap.resize(boost::extents[mapSize.x][mapSize.y][mapSize.z]);
  22. enemyHeroAccessibleObjects.clear();
  23. std::map<PlayerColor, std::vector<HeroPtr>> heroes;
  24. for(const CGObjectInstance * obj : ai->visitableObjs)
  25. {
  26. if(obj->ID == Obj::HERO)
  27. {
  28. HeroPtr hero = dynamic_cast<const CGHeroInstance *>(obj);
  29. heroes[hero->tempOwner].push_back(hero);
  30. }
  31. }
  32. foreach_tile_pos([&](const int3 & pos){
  33. hitMap[pos.x][pos.y][pos.z].reset();
  34. });
  35. for(auto pair : heroes)
  36. {
  37. ai->ah->updatePaths(pair.second, false);
  38. foreach_tile_pos([&](const int3 & pos)
  39. {
  40. for(AIPath & path : ai->ah->getPathsToTile(pos))
  41. {
  42. auto tileDanger = path.getHeroStrength();
  43. auto turn = path.turn();
  44. auto & node = hitMap[pos.x][pos.y][pos.z];
  45. if(tileDanger > node.maximumDanger.danger
  46. || tileDanger == node.maximumDanger.danger && node.maximumDanger.turn > turn)
  47. {
  48. node.maximumDanger.danger = tileDanger;
  49. node.maximumDanger.turn = turn;
  50. node.maximumDanger.hero = path.targetHero;
  51. }
  52. if(turn < node.fastestDanger.turn
  53. || turn == node.fastestDanger.turn && node.fastestDanger.danger < tileDanger)
  54. {
  55. node.fastestDanger.danger = tileDanger;
  56. node.fastestDanger.turn = turn;
  57. node.fastestDanger.hero = path.targetHero;
  58. }
  59. if(turn == 0)
  60. {
  61. auto objects = cb->getVisitableObjs(pos, false);
  62. for(auto obj : objects)
  63. {
  64. if(cb->getPlayerRelations(obj->tempOwner, ai->playerID) != PlayerRelations::ENEMIES)
  65. enemyHeroAccessibleObjects[path.targetHero].insert(obj);
  66. }
  67. }
  68. }
  69. });
  70. }
  71. }
  72. uint64_t DangerHitMapAnalyzer::enemyCanKillOurHeroesAlongThePath(const AIPath & path) const
  73. {
  74. int3 tile = path.targetTile();
  75. int turn = path.turn();
  76. const HitMapNode & info = hitMap[tile.x][tile.y][tile.z];
  77. return info.fastestDanger.turn <= turn && !isSafeToVisit(path.targetHero, path.heroArmy, info.fastestDanger.danger)
  78. || info.maximumDanger.turn <= turn && !isSafeToVisit(path.targetHero, path.heroArmy, info.maximumDanger.danger);
  79. }
  80. const HitMapNode & DangerHitMapAnalyzer::getObjectTreat(const CGObjectInstance * obj) const
  81. {
  82. auto tile = obj->visitablePos();
  83. const HitMapNode & info = hitMap[tile.x][tile.y][tile.z];
  84. return info;
  85. }
  86. const std::set<const CGObjectInstance *> empty = {};
  87. const std::set<const CGObjectInstance *> & DangerHitMapAnalyzer::getOneTurnAccessibleObjects(const CGHeroInstance * enemy) const
  88. {
  89. auto result = enemyHeroAccessibleObjects.find(enemy);
  90. if(result == enemyHeroAccessibleObjects.end())
  91. {
  92. return empty;
  93. }
  94. return result->second;
  95. }
  96. void DangerHitMapAnalyzer::reset()
  97. {
  98. upToDate = false;
  99. }