VCAI.cpp 103 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584
  1. /*
  2. * VCAI.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 "VCAI.h"
  12. #include "Fuzzy.h"
  13. #include "../../lib/UnlockGuard.h"
  14. #include "../../lib/mapObjects/MapObjects.h"
  15. #include "../../lib/CConfigHandler.h"
  16. #include "../../lib/CHeroHandler.h"
  17. #include "../../lib/CModHandler.h"
  18. #include "../../lib/CGameState.h"
  19. #include "../../lib/NetPacks.h"
  20. #include "../../lib/serializer/CTypeList.h"
  21. #include "../../lib/serializer/BinarySerializer.h"
  22. #include "../../lib/serializer/BinaryDeserializer.h"
  23. extern FuzzyHelper *fh;
  24. class CGVisitableOPW;
  25. const double SAFE_ATTACK_CONSTANT = 1.5;
  26. const int GOLD_RESERVE = 10000; //when buying creatures we want to keep at least this much gold (10000 so at least we'll be able to reach capitol)
  27. //one thread may be turn of AI and another will be handling a side effect for AI2
  28. boost::thread_specific_ptr<CCallback> cb;
  29. boost::thread_specific_ptr<VCAI> ai;
  30. //std::map<int, std::map<int, int> > HeroView::infosCount;
  31. //helper RAII to manage global ai/cb ptrs
  32. struct SetGlobalState
  33. {
  34. SetGlobalState(VCAI * AI)
  35. {
  36. assert(!ai.get());
  37. assert(!cb.get());
  38. ai.reset(AI);
  39. cb.reset(AI->myCb.get());
  40. }
  41. ~SetGlobalState()
  42. {
  43. ai.release();
  44. cb.release();
  45. }
  46. };
  47. #define SET_GLOBAL_STATE(ai) SetGlobalState _hlpSetState(ai);
  48. #define NET_EVENT_HANDLER SET_GLOBAL_STATE(this)
  49. #define MAKING_TURN SET_GLOBAL_STATE(this)
  50. void foreach_tile(std::vector< std::vector< std::vector<unsigned char> > > &vectors, std::function<void(unsigned char &in)> foo)
  51. {
  52. for (auto & vector : vectors)
  53. for (auto j = vector.begin(); j != vector.end(); j++)
  54. for (auto & elem : *j)
  55. foo(elem);
  56. }
  57. struct ObjInfo
  58. {
  59. int3 pos;
  60. std::string name;
  61. ObjInfo(){}
  62. ObjInfo(const CGObjectInstance *obj):
  63. pos(obj->pos),
  64. name(obj->getObjectName())
  65. {
  66. }
  67. };
  68. std::map<const CGObjectInstance *, ObjInfo> helperObjInfo;
  69. VCAI::VCAI(void)
  70. {
  71. LOG_TRACE(logAi);
  72. makingTurn = nullptr;
  73. destinationTeleport = ObjectInstanceID();
  74. destinationTeleportPos = int3(-1);
  75. }
  76. VCAI::~VCAI(void)
  77. {
  78. LOG_TRACE(logAi);
  79. finish();
  80. }
  81. void VCAI::availableCreaturesChanged(const CGDwelling *town)
  82. {
  83. LOG_TRACE(logAi);
  84. NET_EVENT_HANDLER;
  85. }
  86. void VCAI::heroMoved(const TryMoveHero & details)
  87. {
  88. LOG_TRACE(logAi);
  89. NET_EVENT_HANDLER;
  90. validateObject(details.id); //enemy hero may have left visible area
  91. auto hero = cb->getHero(details.id);
  92. cachedSectorMaps.clear();
  93. const int3 from = CGHeroInstance::convertPosition(details.start, false),
  94. to = CGHeroInstance::convertPosition(details.end, false);
  95. const CGObjectInstance *o1 = vstd::frontOrNull(cb->getVisitableObjs(from)),
  96. *o2 = vstd::frontOrNull(cb->getVisitableObjs(to));
  97. if(details.result == TryMoveHero::TELEPORTATION)
  98. {
  99. auto t1 = dynamic_cast<const CGTeleport *>(o1);
  100. auto t2 = dynamic_cast<const CGTeleport *>(o2);
  101. if(t1 && t2)
  102. {
  103. if(cb->isTeleportChannelBidirectional(t1->channel))
  104. {
  105. if(o1->ID == Obj::SUBTERRANEAN_GATE && o1->ID == o2->ID) // We need to only add subterranean gates in knownSubterraneanGates. Used for features not yet ported to use teleport channels
  106. {
  107. knownSubterraneanGates[o1] = o2;
  108. knownSubterraneanGates[o2] = o1;
  109. logAi->debug("Found a pair of subterranean gates between %s and %s!", from.toString(), to.toString());
  110. }
  111. }
  112. }
  113. //FIXME: teleports are not correctly visited
  114. unreserveObject(hero, t1);
  115. unreserveObject(hero, t2);
  116. }
  117. else if(details.result == TryMoveHero::EMBARK && hero)
  118. {
  119. //make sure AI not attempt to visit used boat
  120. validateObject(hero->boat);
  121. }
  122. else if(details.result == TryMoveHero::DISEMBARK && o1)
  123. {
  124. auto boat = dynamic_cast<const CGBoat *>(o1);
  125. if(boat)
  126. addVisitableObj(boat);
  127. }
  128. }
  129. void VCAI::stackChagedCount(const StackLocation &location, const TQuantity &change, bool isAbsolute)
  130. {
  131. LOG_TRACE_PARAMS(logAi, "isAbsolute '%i'", isAbsolute);
  132. NET_EVENT_HANDLER;
  133. }
  134. void VCAI::heroInGarrisonChange(const CGTownInstance *town)
  135. {
  136. LOG_TRACE(logAi);
  137. NET_EVENT_HANDLER;
  138. }
  139. void VCAI::centerView(int3 pos, int focusTime)
  140. {
  141. LOG_TRACE_PARAMS(logAi, "focusTime '%i'", focusTime);
  142. NET_EVENT_HANDLER;
  143. }
  144. void VCAI::artifactMoved(const ArtifactLocation &src, const ArtifactLocation &dst)
  145. {
  146. LOG_TRACE(logAi);
  147. NET_EVENT_HANDLER;
  148. }
  149. void VCAI::artifactAssembled(const ArtifactLocation &al)
  150. {
  151. LOG_TRACE(logAi);
  152. NET_EVENT_HANDLER;
  153. }
  154. void VCAI::showTavernWindow(const CGObjectInstance *townOrTavern)
  155. {
  156. LOG_TRACE(logAi);
  157. NET_EVENT_HANDLER;
  158. }
  159. void VCAI::showThievesGuildWindow (const CGObjectInstance * obj)
  160. {
  161. LOG_TRACE(logAi);
  162. NET_EVENT_HANDLER;
  163. }
  164. void VCAI::playerBlocked(int reason, bool start)
  165. {
  166. LOG_TRACE_PARAMS(logAi, "reason '%i', start '%i'", reason % start);
  167. NET_EVENT_HANDLER;
  168. if (start && reason == PlayerBlocked::UPCOMING_BATTLE)
  169. status.setBattle(UPCOMING_BATTLE);
  170. if(reason == PlayerBlocked::ONGOING_MOVEMENT)
  171. status.setMove(start);
  172. }
  173. void VCAI::showPuzzleMap()
  174. {
  175. LOG_TRACE(logAi);
  176. NET_EVENT_HANDLER;
  177. }
  178. void VCAI::showShipyardDialog(const IShipyard *obj)
  179. {
  180. LOG_TRACE(logAi);
  181. NET_EVENT_HANDLER;
  182. }
  183. void VCAI::gameOver(PlayerColor player, const EVictoryLossCheckResult & victoryLossCheckResult)
  184. {
  185. LOG_TRACE_PARAMS(logAi, "victoryLossCheckResult '%s'", victoryLossCheckResult.messageToSelf);
  186. NET_EVENT_HANDLER;
  187. logAi->debug("Player %d (%s): I heard that player %d (%s) %s.", playerID, playerID.getStr(), player, player.getStr(),(victoryLossCheckResult.victory() ? "won" : "lost"));
  188. if(player == playerID)
  189. {
  190. if(victoryLossCheckResult.victory())
  191. {
  192. logAi->debug("VCAI: I won! Incredible!");
  193. logAi->debug("Turn nr %d", myCb->getDate());
  194. }
  195. else
  196. {
  197. logAi->debug("VCAI: Player %d (%s) lost. It's me. What a disappointment! :(", player, player.getStr());
  198. }
  199. finish();
  200. }
  201. }
  202. void VCAI::artifactPut(const ArtifactLocation &al)
  203. {
  204. LOG_TRACE(logAi);
  205. NET_EVENT_HANDLER;
  206. }
  207. void VCAI::artifactRemoved(const ArtifactLocation &al)
  208. {
  209. LOG_TRACE(logAi);
  210. NET_EVENT_HANDLER;
  211. }
  212. void VCAI::stacksErased(const StackLocation &location)
  213. {
  214. LOG_TRACE(logAi);
  215. NET_EVENT_HANDLER;
  216. }
  217. void VCAI::artifactDisassembled(const ArtifactLocation &al)
  218. {
  219. LOG_TRACE(logAi);
  220. NET_EVENT_HANDLER;
  221. }
  222. void VCAI::heroVisit(const CGHeroInstance *visitor, const CGObjectInstance *visitedObj, bool start)
  223. {
  224. LOG_TRACE_PARAMS(logAi, "start '%i'; obj '%s'", start % (visitedObj ? visitedObj->getObjectName() : std::string("n/a")));
  225. NET_EVENT_HANDLER;
  226. if(start && visitedObj) //we can end visit with null object, anyway
  227. {
  228. markObjectVisited (visitedObj);
  229. unreserveObject(visitor, visitedObj);
  230. completeGoal (sptr(Goals::GetObj(visitedObj->id.getNum()).sethero(visitor))); //we don't need to visit it anymore
  231. //TODO: what if we visited one-time visitable object that was reserved by another hero (shouldn't, but..)
  232. }
  233. status.heroVisit(visitedObj, start);
  234. }
  235. void VCAI::availableArtifactsChanged(const CGBlackMarket * bm)
  236. {
  237. LOG_TRACE(logAi);
  238. NET_EVENT_HANDLER;
  239. }
  240. void VCAI::heroVisitsTown(const CGHeroInstance* hero, const CGTownInstance * town)
  241. {
  242. LOG_TRACE(logAi);
  243. NET_EVENT_HANDLER;
  244. //buildArmyIn(town);
  245. //moveCreaturesToHero(town);
  246. }
  247. void VCAI::tileHidden(const std::unordered_set<int3, ShashInt3> &pos)
  248. {
  249. LOG_TRACE(logAi);
  250. NET_EVENT_HANDLER;
  251. validateVisitableObjs();
  252. clearPathsInfo();
  253. }
  254. void VCAI::tileRevealed(const std::unordered_set<int3, ShashInt3> &pos)
  255. {
  256. LOG_TRACE(logAi);
  257. NET_EVENT_HANDLER;
  258. for(int3 tile : pos)
  259. for(const CGObjectInstance *obj : myCb->getVisitableObjs(tile))
  260. addVisitableObj(obj);
  261. clearPathsInfo();
  262. }
  263. void VCAI::heroExchangeStarted(ObjectInstanceID hero1, ObjectInstanceID hero2, QueryID query)
  264. {
  265. LOG_TRACE(logAi);
  266. NET_EVENT_HANDLER;
  267. auto firstHero = cb->getHero(hero1);
  268. auto secondHero = cb->getHero(hero2);
  269. status.addQuery(query, boost::str(boost::format("Exchange between heroes %s (%d) and %s (%d)") % firstHero->name % firstHero->tempOwner % secondHero->name % secondHero->tempOwner));
  270. requestActionASAP([=]()
  271. {
  272. float goalpriority1 = 0, goalpriority2 = 0;
  273. auto firstGoal = getGoal(firstHero);
  274. if (firstGoal->goalType == Goals::GATHER_ARMY)
  275. goalpriority1 = firstGoal->priority;
  276. auto secondGoal = getGoal(secondHero);
  277. if (secondGoal->goalType == Goals::GATHER_ARMY)
  278. goalpriority2 = secondGoal->priority;
  279. auto transferFrom2to1 = [this](const CGHeroInstance * h1, const CGHeroInstance *h2) -> void
  280. {
  281. this->pickBestCreatures(h1, h2);
  282. this->pickBestArtifacts(h1, h2);
  283. };
  284. //Do not attempt army or artifacts exchange if we visited ally player
  285. //Visits can still be useful if hero have skills like Scholar
  286. if(firstHero->tempOwner != secondHero->tempOwner)
  287. logAi->debug("Heroes owned by different players. Do not exchange army or artifacts.");
  288. else if(goalpriority1 > goalpriority2)
  289. transferFrom2to1 (firstHero, secondHero);
  290. else if(goalpriority1 < goalpriority2)
  291. transferFrom2to1 (secondHero, firstHero);
  292. else //regular criteria
  293. {
  294. if (firstHero->getFightingStrength() > secondHero->getFightingStrength() && canGetArmy(firstHero, secondHero))
  295. transferFrom2to1 (firstHero, secondHero);
  296. else if (canGetArmy(secondHero, firstHero))
  297. transferFrom2to1 (secondHero, firstHero);
  298. }
  299. completeGoal(sptr(Goals::VisitHero(firstHero->id.getNum()))); //TODO: what if we were visited by other hero in the meantime?
  300. completeGoal(sptr(Goals::VisitHero(secondHero->id.getNum())));
  301. answerQuery(query, 0);
  302. });
  303. }
  304. void VCAI::heroPrimarySkillChanged(const CGHeroInstance * hero, int which, si64 val)
  305. {
  306. LOG_TRACE_PARAMS(logAi, "which '%i', val '%i'", which % val);
  307. NET_EVENT_HANDLER;
  308. }
  309. void VCAI::showRecruitmentDialog(const CGDwelling *dwelling, const CArmedInstance *dst, int level)
  310. {
  311. LOG_TRACE_PARAMS(logAi, "level '%i'", level);
  312. NET_EVENT_HANDLER;
  313. }
  314. void VCAI::heroMovePointsChanged(const CGHeroInstance * hero)
  315. {
  316. LOG_TRACE(logAi);
  317. NET_EVENT_HANDLER;
  318. }
  319. void VCAI::stackChangedType(const StackLocation &location, const CCreature &newType)
  320. {
  321. LOG_TRACE(logAi);
  322. NET_EVENT_HANDLER;
  323. }
  324. void VCAI::stacksRebalanced(const StackLocation &src, const StackLocation &dst, TQuantity count)
  325. {
  326. LOG_TRACE(logAi);
  327. NET_EVENT_HANDLER;
  328. }
  329. void VCAI::newObject(const CGObjectInstance * obj)
  330. {
  331. LOG_TRACE(logAi);
  332. NET_EVENT_HANDLER;
  333. if(obj->isVisitable())
  334. addVisitableObj(obj);
  335. cachedSectorMaps.clear();
  336. }
  337. void VCAI::objectRemoved(const CGObjectInstance *obj)
  338. {
  339. LOG_TRACE(logAi);
  340. NET_EVENT_HANDLER;
  341. vstd::erase_if_present(visitableObjs, obj);
  342. vstd::erase_if_present(alreadyVisited, obj);
  343. for (auto h : cb->getHeroesInfo())
  344. unreserveObject(h, obj);
  345. //TODO: Find better way to handle hero boat removal
  346. if(auto hero = dynamic_cast<const CGHeroInstance *>(obj))
  347. {
  348. if(hero->boat)
  349. {
  350. vstd::erase_if_present(visitableObjs, hero->boat);
  351. vstd::erase_if_present(alreadyVisited, hero->boat);
  352. for (auto h : cb->getHeroesInfo())
  353. unreserveObject(h, hero->boat);
  354. }
  355. }
  356. cachedSectorMaps.clear(); //invalidate all paths
  357. //TODO
  358. //there are other places where CGObjectinstance ptrs are stored...
  359. //
  360. if(obj->ID == Obj::HERO && obj->tempOwner == playerID)
  361. {
  362. lostHero(cb->getHero(obj->id)); //we can promote, since objectRemoved is called just before actual deletion
  363. }
  364. }
  365. void VCAI::showHillFortWindow(const CGObjectInstance *object, const CGHeroInstance *visitor)
  366. {
  367. LOG_TRACE(logAi);
  368. NET_EVENT_HANDLER;
  369. requestActionASAP([=]()
  370. {
  371. makePossibleUpgrades(visitor);
  372. });
  373. }
  374. void VCAI::playerBonusChanged(const Bonus &bonus, bool gain)
  375. {
  376. LOG_TRACE_PARAMS(logAi, "gain '%i'", gain);
  377. NET_EVENT_HANDLER;
  378. }
  379. void VCAI::newStackInserted(const StackLocation &location, const CStackInstance &stack)
  380. {
  381. LOG_TRACE(logAi);
  382. NET_EVENT_HANDLER;
  383. }
  384. void VCAI::heroCreated(const CGHeroInstance* h)
  385. {
  386. LOG_TRACE(logAi);
  387. if (h->visitedTown)
  388. townVisitsThisWeek[HeroPtr(h)].insert(h->visitedTown);
  389. NET_EVENT_HANDLER;
  390. }
  391. void VCAI::advmapSpellCast(const CGHeroInstance * caster, int spellID)
  392. {
  393. LOG_TRACE_PARAMS(logAi, "spellID '%i", spellID);
  394. NET_EVENT_HANDLER;
  395. }
  396. void VCAI::showInfoDialog(const std::string &text, const std::vector<Component*> &components, int soundID)
  397. {
  398. LOG_TRACE_PARAMS(logAi, "soundID '%i'", soundID);
  399. NET_EVENT_HANDLER;
  400. }
  401. void VCAI::requestRealized(PackageApplied *pa)
  402. {
  403. LOG_TRACE(logAi);
  404. NET_EVENT_HANDLER;
  405. if(status.haveTurn())
  406. {
  407. if(pa->packType == typeList.getTypeID<EndTurn>())
  408. if(pa->result)
  409. status.madeTurn();
  410. }
  411. if(pa->packType == typeList.getTypeID<QueryReply>())
  412. {
  413. status.receivedAnswerConfirmation(pa->requestID, pa->result);
  414. }
  415. }
  416. void VCAI::receivedResource()
  417. {
  418. LOG_TRACE(logAi);
  419. NET_EVENT_HANDLER;
  420. }
  421. void VCAI::stacksSwapped(const StackLocation &loc1, const StackLocation &loc2)
  422. {
  423. LOG_TRACE(logAi);
  424. NET_EVENT_HANDLER;
  425. }
  426. void VCAI::showUniversityWindow(const IMarket *market, const CGHeroInstance *visitor)
  427. {
  428. LOG_TRACE(logAi);
  429. NET_EVENT_HANDLER;
  430. }
  431. void VCAI::heroManaPointsChanged(const CGHeroInstance * hero)
  432. {
  433. LOG_TRACE(logAi);
  434. NET_EVENT_HANDLER;
  435. }
  436. void VCAI::heroSecondarySkillChanged(const CGHeroInstance * hero, int which, int val)
  437. {
  438. LOG_TRACE_PARAMS(logAi, "which '%d', val '%d'", which % val);
  439. NET_EVENT_HANDLER;
  440. }
  441. void VCAI::battleResultsApplied()
  442. {
  443. LOG_TRACE(logAi);
  444. NET_EVENT_HANDLER;
  445. assert(status.getBattle() == ENDING_BATTLE);
  446. status.setBattle(NO_BATTLE);
  447. }
  448. void VCAI::objectPropertyChanged(const SetObjectProperty * sop)
  449. {
  450. LOG_TRACE(logAi);
  451. NET_EVENT_HANDLER;
  452. if(sop->what == ObjProperty::OWNER)
  453. {
  454. if(myCb->getPlayerRelations(playerID, (PlayerColor)sop->val) == PlayerRelations::ENEMIES)
  455. {
  456. //we want to visit objects owned by oppponents
  457. auto obj = myCb->getObj(sop->id, false);
  458. if (obj)
  459. {
  460. addVisitableObj(obj); // TODO: Remove once save compatability broken. In past owned objects were removed from this set
  461. vstd::erase_if_present(alreadyVisited, obj);
  462. }
  463. }
  464. }
  465. }
  466. void VCAI::buildChanged(const CGTownInstance *town, BuildingID buildingID, int what)
  467. {
  468. LOG_TRACE_PARAMS(logAi, "what '%i'", what);
  469. NET_EVENT_HANDLER;
  470. }
  471. void VCAI::heroBonusChanged(const CGHeroInstance *hero, const Bonus &bonus, bool gain)
  472. {
  473. LOG_TRACE_PARAMS(logAi, "gain '%i'", gain);
  474. NET_EVENT_HANDLER;
  475. }
  476. void VCAI::showMarketWindow(const IMarket *market, const CGHeroInstance *visitor)
  477. {
  478. LOG_TRACE(logAi);
  479. NET_EVENT_HANDLER;
  480. }
  481. void VCAI::showWorldViewEx(const std::vector<ObjectPosInfo> & objectPositions)
  482. {
  483. //TODO: AI support for ViewXXX spell
  484. LOG_TRACE(logAi);
  485. NET_EVENT_HANDLER;
  486. }
  487. void VCAI::init(std::shared_ptr<CCallback> CB)
  488. {
  489. LOG_TRACE(logAi);
  490. myCb = CB;
  491. cbc = CB;
  492. NET_EVENT_HANDLER;
  493. playerID = *myCb->getMyColor();
  494. myCb->waitTillRealize = true;
  495. myCb->unlockGsWhenWaiting = true;
  496. if(!fh)
  497. fh = new FuzzyHelper();
  498. retreiveVisitableObjs();
  499. }
  500. void VCAI::yourTurn()
  501. {
  502. LOG_TRACE(logAi);
  503. NET_EVENT_HANDLER;
  504. status.startedTurn();
  505. makingTurn = make_unique<boost::thread>(&VCAI::makeTurn, this);
  506. }
  507. void VCAI::heroGotLevel(const CGHeroInstance *hero, PrimarySkill::PrimarySkill pskill, std::vector<SecondarySkill> &skills, QueryID queryID)
  508. {
  509. LOG_TRACE_PARAMS(logAi, "queryID '%i'", queryID);
  510. NET_EVENT_HANDLER;
  511. status.addQuery(queryID, boost::str(boost::format("Hero %s got level %d") % hero->name % hero->level));
  512. requestActionASAP([=](){ answerQuery(queryID, 0); });
  513. }
  514. void VCAI::commanderGotLevel (const CCommanderInstance * commander, std::vector<ui32> skills, QueryID queryID)
  515. {
  516. LOG_TRACE_PARAMS(logAi, "queryID '%i'", queryID);
  517. NET_EVENT_HANDLER;
  518. status.addQuery(queryID, boost::str(boost::format("Commander %s of %s got level %d") % commander->name % commander->armyObj->nodeName() % (int)commander->level));
  519. requestActionASAP([=](){ answerQuery(queryID, 0); });
  520. }
  521. void VCAI::showBlockingDialog(const std::string &text, const std::vector<Component> &components, QueryID askID, const int soundID, bool selection, bool cancel)
  522. {
  523. LOG_TRACE_PARAMS(logAi, "text '%s', askID '%i', soundID '%i', selection '%i', cancel '%i'", text % askID % soundID % selection % cancel);
  524. NET_EVENT_HANDLER;
  525. int sel = 0;
  526. status.addQuery(askID, boost::str(boost::format("Blocking dialog query with %d components - %s")
  527. % components.size() % text));
  528. if(selection) //select from multiple components -> take the last one (they're indexed [1-size])
  529. sel = components.size();
  530. if(!selection && cancel) //yes&no -> always answer yes, we are a brave AI :)
  531. sel = 1;
  532. requestActionASAP([=]()
  533. {
  534. answerQuery(askID, sel);
  535. });
  536. }
  537. void VCAI::showTeleportDialog(TeleportChannelID channel, TTeleportExitsList exits, bool impassable, QueryID askID)
  538. {
  539. // LOG_TRACE_PARAMS(logAi, "askID '%i', exits '%s'", askID % exits);
  540. NET_EVENT_HANDLER;
  541. status.addQuery(askID, boost::str(boost::format("Teleport dialog query with %d exits")
  542. % exits.size()));
  543. int choosenExit = -1;
  544. if(impassable)
  545. knownTeleportChannels[channel]->passability = TeleportChannel::IMPASSABLE;
  546. else if(destinationTeleport != ObjectInstanceID() && destinationTeleportPos.valid())
  547. {
  548. auto neededExit = std::make_pair(destinationTeleport, destinationTeleportPos);
  549. if(destinationTeleport != ObjectInstanceID() && vstd::contains(exits, neededExit))
  550. choosenExit = vstd::find_pos(exits, neededExit);
  551. }
  552. for(auto exit : exits)
  553. {
  554. if(status.channelProbing() && exit.first == destinationTeleport)
  555. {
  556. choosenExit = vstd::find_pos(exits, exit);
  557. break;
  558. }
  559. else
  560. {
  561. // TODO: Implement checking if visiting that teleport will uncovert any FoW
  562. // So far this is the best option to handle decision about probing
  563. auto obj = cb->getObj(exit.first, false);
  564. if(obj == nullptr && !vstd::contains(teleportChannelProbingList, exit.first) &&
  565. exit.first != destinationTeleport)
  566. {
  567. teleportChannelProbingList.push_back(exit.first);
  568. }
  569. }
  570. }
  571. requestActionASAP([=]()
  572. {
  573. answerQuery(askID, choosenExit);
  574. });
  575. }
  576. void VCAI::showGarrisonDialog(const CArmedInstance *up, const CGHeroInstance *down, bool removableUnits, QueryID queryID)
  577. {
  578. LOG_TRACE_PARAMS(logAi, "removableUnits '%i', queryID '%i'", removableUnits % queryID);
  579. NET_EVENT_HANDLER;
  580. std::string s1 = up ? up->nodeName() : "NONE";
  581. std::string s2 = down ? down->nodeName() : "NONE";
  582. status.addQuery(queryID, boost::str(boost::format("Garrison dialog with %s and %s") % s1 % s2));
  583. //you can't request action from action-response thread
  584. requestActionASAP([=]()
  585. {
  586. if(removableUnits)
  587. pickBestCreatures(down, up);
  588. answerQuery(queryID, 0);
  589. });
  590. }
  591. void VCAI::showMapObjectSelectDialog(QueryID askID, const Component & icon, const MetaString & title, const MetaString & description, const std::vector<ObjectInstanceID> & objects)
  592. {
  593. status.addQuery(askID, "Map object select query");
  594. requestActionASAP([=](){ answerQuery(askID, 0); });
  595. //TODO: Town portal destination selection goes here
  596. }
  597. void VCAI::saveGame(BinarySerializer & h, const int version)
  598. {
  599. LOG_TRACE_PARAMS(logAi, "version '%i'", version);
  600. NET_EVENT_HANDLER;
  601. validateVisitableObjs();
  602. registerGoals(h);
  603. CAdventureAI::saveGame(h, version);
  604. serializeInternal(h, version);
  605. }
  606. void VCAI::loadGame(BinaryDeserializer & h, const int version)
  607. {
  608. LOG_TRACE_PARAMS(logAi, "version '%i'", version);
  609. NET_EVENT_HANDLER;
  610. registerGoals(h);
  611. CAdventureAI::loadGame(h, version);
  612. serializeInternal(h, version);
  613. }
  614. void makePossibleUpgrades(const CArmedInstance *obj)
  615. {
  616. if(!obj)
  617. return;
  618. for(int i = 0; i < GameConstants::ARMY_SIZE; i++)
  619. {
  620. if(const CStackInstance *s = obj->getStackPtr(SlotID(i)))
  621. {
  622. UpgradeInfo ui;
  623. cb->getUpgradeInfo(obj, SlotID(i), ui);
  624. if(ui.oldID >= 0 && cb->getResourceAmount().canAfford(ui.cost[0] * s->count))
  625. {
  626. cb->upgradeCreature(obj, SlotID(i), ui.newID[0]);
  627. }
  628. }
  629. }
  630. }
  631. void VCAI::makeTurn()
  632. {
  633. logGlobal->info("Player %d (%s) starting turn", playerID, playerID.getStr());
  634. MAKING_TURN;
  635. boost::shared_lock<boost::shared_mutex> gsLock(CGameState::mutex);
  636. setThreadName("VCAI::makeTurn");
  637. switch(cb->getDate(Date::DAY_OF_WEEK))
  638. {
  639. case 1:
  640. {
  641. townVisitsThisWeek.clear();
  642. std::vector<const CGObjectInstance *> objs;
  643. retreiveVisitableObjs(objs, true);
  644. for(const CGObjectInstance *obj : objs)
  645. {
  646. if (isWeeklyRevisitable(obj))
  647. {
  648. addVisitableObj(obj);
  649. vstd::erase_if_present(alreadyVisited, obj);
  650. }
  651. }
  652. }
  653. break;
  654. }
  655. markHeroAbleToExplore (primaryHero());
  656. makeTurnInternal();
  657. return;
  658. }
  659. void VCAI::makeTurnInternal()
  660. {
  661. saving = 0;
  662. //it looks messy here, but it's better to have armed heroes before attempting realizing goals
  663. for(const CGTownInstance *t : cb->getTownsInfo())
  664. moveCreaturesToHero(t);
  665. try
  666. {
  667. //Pick objects reserved in previous turn - we expect only nerby objects there
  668. auto reservedHeroesCopy = reservedHeroesMap; //work on copy => the map may be changed while iterating (eg because hero died when attempting a goal)
  669. for (auto hero : reservedHeroesCopy)
  670. {
  671. if(reservedHeroesMap.count(hero.first))
  672. continue; //hero might have been removed while we were in this loop
  673. if(!hero.first.validAndSet())
  674. {
  675. logAi->error("Hero %s present on reserved map. Shouldn't be.", hero.first.name);
  676. continue;
  677. }
  678. std::vector<const CGObjectInstance *> vec(hero.second.begin(), hero.second.end());
  679. boost::sort (vec, CDistanceSorter(hero.first.get()));
  680. for (auto obj : vec)
  681. {
  682. if(!obj || !cb->getObj(obj->id))
  683. {
  684. logAi->error("Error: there is wrong object on list for hero %s", hero.first->name);
  685. continue;
  686. }
  687. striveToGoal (sptr(Goals::VisitTile(obj->visitablePos()).sethero(hero.first)));
  688. }
  689. }
  690. //now try to win
  691. striveToGoal(sptr(Goals::Win()));
  692. //finally, continue our abstract long-term goals
  693. int oldMovement = 0;
  694. int newMovement = 0;
  695. while (true)
  696. {
  697. oldMovement = newMovement; //remember old value
  698. newMovement = 0;
  699. std::vector<std::pair<HeroPtr, Goals::TSubgoal> > safeCopy;
  700. for (auto mission : lockedHeroes)
  701. {
  702. fh->setPriority (mission.second); //re-evaluate
  703. if (canAct(mission.first))
  704. {
  705. newMovement += mission.first->movement;
  706. safeCopy.push_back (mission);
  707. }
  708. }
  709. if (newMovement == oldMovement) //means our heroes didn't move or didn't re-assign their goals
  710. {
  711. logAi->warn("Our heroes don't move anymore, exhaustive decomposition failed");
  712. break;
  713. }
  714. if (safeCopy.empty())
  715. break; //all heroes exhausted their locked goals
  716. else
  717. {
  718. typedef std::pair<HeroPtr, Goals::TSubgoal> TItrType;
  719. auto lockedHeroesSorter = [](TItrType m1, TItrType m2) -> bool
  720. {
  721. return m1.second->priority < m2.second->priority;
  722. };
  723. boost::sort(safeCopy, lockedHeroesSorter);
  724. striveToGoal (safeCopy.back().second);
  725. }
  726. }
  727. auto quests = myCb->getMyQuests();
  728. for (auto quest : quests)
  729. {
  730. striveToQuest (quest);
  731. }
  732. striveToGoal(sptr(Goals::Build())); //TODO: smarter building management
  733. performTypicalActions();
  734. //for debug purpose
  735. for (auto h : cb->getHeroesInfo())
  736. {
  737. if (h->movement)
  738. logAi->warn("Hero %s has %d MP left", h->name, h->movement);
  739. }
  740. }
  741. catch(boost::thread_interrupted &e)
  742. {
  743. logAi->debug("Making turn thread has been interrupted. We'll end without calling endTurn.");
  744. return;
  745. }
  746. catch(std::exception &e)
  747. {
  748. logAi->debug("Making turn thread has caught an exception: %s", e.what());
  749. }
  750. endTurn();
  751. }
  752. bool VCAI::goVisitObj(const CGObjectInstance * obj, HeroPtr h)
  753. {
  754. int3 dst = obj->visitablePos();
  755. auto sm = getCachedSectorMap(h);
  756. logAi->debug("%s will try to visit %s at (%s)",h->name, obj->getObjectName(), dst.toString());
  757. int3 pos = sm->firstTileToGet(h, dst);
  758. if (!pos.valid()) //rare case when we are already standing on one of potential objects
  759. return false;
  760. return moveHeroToTile(pos, h);
  761. }
  762. void VCAI::performObjectInteraction(const CGObjectInstance * obj, HeroPtr h)
  763. {
  764. LOG_TRACE_PARAMS(logAi, "Hero %s and object %s at %s", h->name % obj->getObjectName() % obj->pos.toString());
  765. switch (obj->ID)
  766. {
  767. case Obj::CREATURE_GENERATOR1:
  768. recruitCreatures (dynamic_cast<const CGDwelling *>(obj), h.get());
  769. checkHeroArmy (h);
  770. break;
  771. case Obj::TOWN:
  772. moveCreaturesToHero (dynamic_cast<const CGTownInstance *>(obj));
  773. if (h->visitedTown) //we are inside, not just attacking
  774. {
  775. townVisitsThisWeek[h].insert(h->visitedTown);
  776. if (!h->hasSpellbook() && cb->getResourceAmount(Res::GOLD) >= GameConstants::SPELLBOOK_GOLD_COST + saving[Res::GOLD] &&
  777. h->visitedTown->hasBuilt (BuildingID::MAGES_GUILD_1))
  778. cb->buyArtifact(h.get(), ArtifactID::SPELLBOOK);
  779. }
  780. break;
  781. }
  782. completeGoal (sptr(Goals::GetObj(obj->id.getNum()).sethero(h)));
  783. }
  784. void VCAI::moveCreaturesToHero(const CGTownInstance * t)
  785. {
  786. if(t->visitingHero && t->armedGarrison() && t->visitingHero->tempOwner == t->tempOwner)
  787. {
  788. pickBestCreatures (t->visitingHero, t);
  789. }
  790. }
  791. bool VCAI::canGetArmy (const CGHeroInstance * army, const CGHeroInstance * source)
  792. { //TODO: merge with pickBestCreatures
  793. //if (ai->primaryHero().h == source)
  794. if(army->tempOwner != source->tempOwner)
  795. {
  796. logAi->error("Why are we even considering exchange between heroes from different players?");
  797. return false;
  798. }
  799. const CArmedInstance *armies[] = {army, source};
  800. //we calculate total strength for each creature type available in armies
  801. std::map<const CCreature*, int> creToPower;
  802. for(auto armyPtr : armies)
  803. for(auto &i : armyPtr->Slots())
  804. {
  805. //TODO: allow splitting stacks?
  806. creToPower[i.second->type] += i.second->getPower();
  807. }
  808. //TODO - consider more than just power (ie morale penalty, hero specialty in certain stacks, etc)
  809. int armySize = creToPower.size();
  810. armySize = std::min ((source->needsLastStack() ? armySize - 1 : armySize), GameConstants::ARMY_SIZE); //can't move away last stack
  811. std::vector<const CCreature *> bestArmy; //types that'll be in final dst army
  812. for (int i = 0; i < armySize; i++) //pick the creatures from which we can get most power, as many as dest can fit
  813. {
  814. typedef const std::pair<const CCreature*, int> &CrePowerPair;
  815. auto creIt = boost::max_element(creToPower, [](CrePowerPair lhs, CrePowerPair rhs)
  816. {
  817. return lhs.second < rhs.second;
  818. });
  819. bestArmy.push_back(creIt->first);
  820. creToPower.erase(creIt);
  821. if(creToPower.empty())
  822. break;
  823. }
  824. //foreach best type -> iterate over slots in both armies and if it's the appropriate type, send it to the slot where it belongs
  825. for (int i = 0; i < bestArmy.size(); i++) //i-th strongest creature type will go to i-th slot
  826. {
  827. for(auto armyPtr : armies)
  828. for (int j = 0; j < GameConstants::ARMY_SIZE; j++)
  829. {
  830. if(armyPtr->getCreature(SlotID(j)) == bestArmy[i] && armyPtr != army) //it's a searched creature not in dst ARMY
  831. {
  832. //FIXME: line below is useless when simulating exchange between two non-singular armies
  833. if(!(armyPtr->needsLastStack() && armyPtr->stacksCount() == 1)) //can't take away last creature
  834. return true; //at least one exchange will be performed
  835. else
  836. return false; //no further exchange possible
  837. }
  838. }
  839. }
  840. return false;
  841. }
  842. void VCAI::pickBestCreatures(const CArmedInstance * army, const CArmedInstance * source)
  843. {
  844. //TODO - what if source is a hero (the last stack problem) -> it'd good to create a single stack of weakest cre
  845. const CArmedInstance *armies[] = {army, source};
  846. //we calculate total strength for each creature type available in armies
  847. std::map<const CCreature*, int> creToPower;
  848. for(auto armyPtr : armies)
  849. for(auto &i : armyPtr->Slots())
  850. {//TODO: allow splitting stacks?
  851. creToPower[i.second->type] += i.second->getPower();
  852. }
  853. //TODO - consider more than just power (ie morale penalty, hero specialty in certain stacks, etc)
  854. int armySize = creToPower.size();
  855. armySize = std::min ((source->needsLastStack() ? armySize - 1 : armySize), GameConstants::ARMY_SIZE); //can't move away last stack
  856. std::vector<const CCreature *> bestArmy; //types that'll be in final dst army
  857. for (int i = 0; i < armySize; i++) //pick the creatures from which we can get most power, as many as dest can fit
  858. {
  859. typedef const std::pair<const CCreature*, int> &CrePowerPair;
  860. auto creIt = boost::max_element(creToPower, [](CrePowerPair lhs, CrePowerPair rhs)
  861. {
  862. return lhs.second < rhs.second;
  863. });
  864. bestArmy.push_back(creIt->first);
  865. creToPower.erase(creIt);
  866. if(creToPower.empty())
  867. break;
  868. }
  869. //foreach best type -> iterate over slots in both armies and if it's the appropriate type, send it to the slot where it belongs
  870. for (int i = 0; i < bestArmy.size(); i++) //i-th strongest creature type will go to i-th slot
  871. {
  872. for(auto armyPtr : armies)
  873. for (int j = 0; j < GameConstants::ARMY_SIZE; j++)
  874. {
  875. if(armyPtr->getCreature(SlotID(j)) == bestArmy[i] && (i != j || armyPtr != army)) //it's a searched creature not in dst SLOT
  876. if(!(armyPtr->needsLastStack() && armyPtr->stacksCount() == 1)) //can't take away last creature
  877. cb->mergeOrSwapStacks(armyPtr, army, SlotID(j), SlotID(i));
  878. }
  879. }
  880. //TODO - having now strongest possible army, we may want to think about arranging stacks
  881. auto hero = dynamic_cast<const CGHeroInstance *>(army);
  882. if (hero)
  883. {
  884. checkHeroArmy (hero);
  885. }
  886. }
  887. void VCAI::pickBestArtifacts(const CGHeroInstance * h, const CGHeroInstance * other)
  888. {
  889. auto equipBest = [](const CGHeroInstance * h, const CGHeroInstance * otherh, bool giveStuffToFirstHero) -> void
  890. {
  891. bool changeMade = false;
  892. do
  893. {
  894. changeMade = false;
  895. //we collect gear always in same order
  896. std::vector<ArtifactLocation> allArtifacts;
  897. if (giveStuffToFirstHero)
  898. {
  899. for (auto p : h->artifactsWorn)
  900. {
  901. if (p.second.artifact)
  902. allArtifacts.push_back(ArtifactLocation(h, p.first));
  903. }
  904. }
  905. for (auto slot : h->artifactsInBackpack)
  906. allArtifacts.push_back(ArtifactLocation(h, h->getArtPos(slot.artifact)));
  907. if (otherh)
  908. {
  909. for (auto p : otherh->artifactsWorn)
  910. {
  911. if (p.second.artifact)
  912. allArtifacts.push_back(ArtifactLocation(otherh, p.first));
  913. }
  914. for (auto slot : otherh->artifactsInBackpack)
  915. allArtifacts.push_back(ArtifactLocation(otherh, otherh->getArtPos(slot.artifact)));
  916. }
  917. //we give stuff to one hero or another, depending on giveStuffToFirstHero
  918. const CGHeroInstance * target = nullptr;
  919. if (giveStuffToFirstHero || !otherh)
  920. target = h;
  921. else
  922. target = otherh;
  923. for (auto location : allArtifacts)
  924. {
  925. if (location.relatedObj() == target && location.slot < ArtifactPosition::AFTER_LAST)
  926. continue; //don't reequip artifact we already wear
  927. if(location.slot == ArtifactPosition::MACH4) // don't attempt to move catapult
  928. continue;
  929. auto s = location.getSlot();
  930. if (!s || s->locked) //we can't move locks
  931. continue;
  932. auto artifact = s->artifact;
  933. if (!artifact)
  934. continue;
  935. //FIXME: why are the above possible to be null?
  936. bool emptySlotFound = false;
  937. for (auto slot : artifact->artType->possibleSlots.at(target->bearerType()))
  938. {
  939. ArtifactLocation destLocation(target, slot);
  940. if (target->isPositionFree(slot) && artifact->canBePutAt(destLocation, true)) //combined artifacts are not always allowed to move
  941. {
  942. cb->swapArtifacts(location, destLocation); //just put into empty slot
  943. emptySlotFound = true;
  944. changeMade = true;
  945. break;
  946. }
  947. }
  948. if (!emptySlotFound) //try to put that atifact in already occupied slot
  949. {
  950. for (auto slot : artifact->artType->possibleSlots.at(target->bearerType()))
  951. {
  952. auto otherSlot = target->getSlot(slot);
  953. if (otherSlot && otherSlot->artifact) //we need to exchange artifact for better one
  954. {
  955. ArtifactLocation destLocation(target, slot);
  956. //if that artifact is better than what we have, pick it
  957. if (compareArtifacts(artifact, otherSlot->artifact) && artifact->canBePutAt(destLocation, true)) //combined artifacts are not always allowed to move
  958. {
  959. cb->swapArtifacts(location, ArtifactLocation(target, target->getArtPos(otherSlot->artifact)));
  960. changeMade = true;
  961. break;
  962. }
  963. }
  964. }
  965. }
  966. if (changeMade)
  967. break; //start evaluating artifacts from scratch
  968. }
  969. } while (changeMade);
  970. };
  971. equipBest (h, other, true);
  972. if (other)
  973. {
  974. equipBest(h, other, false);
  975. }
  976. }
  977. void VCAI::recruitCreatures(const CGDwelling * d, const CArmedInstance * recruiter)
  978. {
  979. for(int i = 0; i < d->creatures.size(); i++)
  980. {
  981. if(!d->creatures[i].second.size())
  982. continue;
  983. int count = d->creatures[i].first;
  984. CreatureID creID = d->creatures[i].second.back();
  985. // const CCreature *c = VLC->creh->creatures[creID];
  986. // if(containsSavedRes(c->cost))
  987. // continue;
  988. vstd::amin(count, freeResources() / VLC->creh->creatures[creID]->cost);
  989. if(count > 0)
  990. cb->recruitCreatures(d, recruiter, creID, count, i);
  991. }
  992. }
  993. bool VCAI::tryBuildStructure(const CGTownInstance * t, BuildingID building, unsigned int maxDays)
  994. {
  995. if (maxDays == 0)
  996. {
  997. logAi->warn("Request to build building %d in 0 days!", building.toEnum());
  998. return false;
  999. }
  1000. if (!vstd::contains(t->town->buildings, building))
  1001. return false; // no such building in town
  1002. if (t->hasBuilt(building)) //Already built? Shouldn't happen in general
  1003. return true;
  1004. const CBuilding * buildPtr = t->town->buildings.at(building);
  1005. auto toBuild = buildPtr->requirements.getFulfillmentCandidates([&](const BuildingID & buildID)
  1006. {
  1007. return t->hasBuilt(buildID);
  1008. });
  1009. toBuild.push_back(building);
  1010. for(BuildingID buildID : toBuild)
  1011. {
  1012. EBuildingState::EBuildingState canBuild = cb->canBuildStructure(t, buildID);
  1013. if (canBuild == EBuildingState::HAVE_CAPITAL
  1014. || canBuild == EBuildingState::FORBIDDEN
  1015. || canBuild == EBuildingState::NO_WATER)
  1016. return false; //we won't be able to build this
  1017. }
  1018. if (maxDays && toBuild.size() > maxDays)
  1019. return false;
  1020. TResources currentRes = cb->getResourceAmount();
  1021. //TODO: calculate if we have enough resources to build it in maxDays
  1022. for(const auto & buildID : toBuild)
  1023. {
  1024. const CBuilding *b = t->town->buildings.at(buildID);
  1025. EBuildingState::EBuildingState canBuild = cb->canBuildStructure(t, buildID);
  1026. if(canBuild == EBuildingState::ALLOWED)
  1027. {
  1028. if(!containsSavedRes(b->resources))
  1029. {
  1030. logAi->debug("Player %d will build %s in town of %s at %s", playerID, b->Name(), t->name, t->pos.toString());
  1031. cb->buildBuilding(t, buildID);
  1032. return true;
  1033. }
  1034. continue;
  1035. }
  1036. else if(canBuild == EBuildingState::NO_RESOURCES)
  1037. {
  1038. //TResources income = estimateIncome();
  1039. TResources cost = t->town->buildings.at(buildID)->resources;
  1040. for (int i = 0; i < GameConstants::RESOURCE_QUANTITY; i++)
  1041. {
  1042. //int diff = currentRes[i] - cost[i] + income[i];
  1043. int diff = currentRes[i] - cost[i];
  1044. if(diff < 0)
  1045. saving[i] = 1;
  1046. }
  1047. continue;
  1048. }
  1049. else if (canBuild == EBuildingState::PREREQUIRES)
  1050. {
  1051. // can happen when dependencies have their own missing dependencies
  1052. if (tryBuildStructure(t, buildID, maxDays - 1))
  1053. return true;
  1054. }
  1055. else if (canBuild == EBuildingState::MISSING_BASE)
  1056. {
  1057. if (tryBuildStructure(t, b->upgrade, maxDays - 1))
  1058. return true;
  1059. }
  1060. }
  1061. return false;
  1062. }
  1063. //bool VCAI::canBuildStructure(const CGTownInstance * t, BuildingID building, unsigned int maxDays=7)
  1064. //{
  1065. // if (maxDays == 0)
  1066. // {
  1067. // logAi->warn("Request to build building %d in 0 days!", building.toEnum());
  1068. // return false;
  1069. // }
  1070. //
  1071. // if (!vstd::contains(t->town->buildings, building))
  1072. // return false; // no such building in town
  1073. //
  1074. // if (t->hasBuilt(building)) //Already built? Shouldn't happen in general
  1075. // return true;
  1076. //
  1077. // const CBuilding * buildPtr = t->town->buildings.at(building);
  1078. //
  1079. // auto toBuild = buildPtr->requirements.getFulfillmentCandidates([&](const BuildingID & buildID)
  1080. // {
  1081. // return t->hasBuilt(buildID);
  1082. // });
  1083. // toBuild.push_back(building);
  1084. //
  1085. // for(BuildingID buildID : toBuild)
  1086. // {
  1087. // EBuildingState::EBuildingState canBuild = cb->canBuildStructure(t, buildID);
  1088. // if (canBuild == EBuildingState::HAVE_CAPITAL
  1089. // || canBuild == EBuildingState::FORBIDDEN
  1090. // || canBuild == EBuildingState::NO_WATER)
  1091. // return false; //we won't be able to build this
  1092. // }
  1093. //
  1094. // if (maxDays && toBuild.size() > maxDays)
  1095. // return false;
  1096. //
  1097. // TResources currentRes = cb->getResourceAmount();
  1098. // TResources income = estimateIncome();
  1099. // //TODO: calculate if we have enough resources to build it in maxDays
  1100. //
  1101. // for(const auto & buildID : toBuild)
  1102. // {
  1103. // const CBuilding *b = t->town->buildings.at(buildID);
  1104. //
  1105. // EBuildingState::EBuildingState canBuild = cb->canBuildStructure(t, buildID);
  1106. // if(canBuild == EBuildingState::ALLOWED)
  1107. // {
  1108. // if(!containsSavedRes(b->resources))
  1109. // {
  1110. // logAi->debug("Player %d will build %s in town of %s at %s", playerID, b->Name(), t->name, t->pos.toString());
  1111. // return true;
  1112. // }
  1113. // continue;
  1114. // }
  1115. // else if(canBuild == EBuildingState::NO_RESOURCES)
  1116. // {
  1117. // TResources cost = t->town->buildings.at(buildID)->resources;
  1118. // for (int i = 0; i < GameConstants::RESOURCE_QUANTITY; i++)
  1119. // {
  1120. // int diff = currentRes[i] - cost[i] + income[i];
  1121. // if(diff < 0)
  1122. // saving[i] = 1;
  1123. // }
  1124. // continue;
  1125. // }
  1126. // else if (canBuild == EBuildingState::PREREQUIRES)
  1127. // {
  1128. // // can happen when dependencies have their own missing dependencies
  1129. // if (canBuildStructure(t, buildID, maxDays - 1))
  1130. // return true;
  1131. // }
  1132. // else if (canBuild == EBuildingState::MISSING_BASE)
  1133. // {
  1134. // if (canBuildStructure(t, b->upgrade, maxDays - 1))
  1135. // return true;
  1136. // }
  1137. // }
  1138. // return false;
  1139. //}
  1140. bool VCAI::tryBuildAnyStructure(const CGTownInstance * t, std::vector<BuildingID> buildList, unsigned int maxDays)
  1141. {
  1142. for(const auto & building : buildList)
  1143. {
  1144. if(t->hasBuilt(building))
  1145. continue;
  1146. if (tryBuildStructure(t, building, maxDays))
  1147. return true;
  1148. }
  1149. return false; //Can't build anything
  1150. }
  1151. BuildingID VCAI::canBuildAnyStructure(const CGTownInstance * t, std::vector<BuildingID> buildList, unsigned int maxDays)
  1152. {
  1153. for(const auto & building : buildList)
  1154. {
  1155. if(t->hasBuilt(building))
  1156. continue;
  1157. if (cb->canBuildStructure(t, building))
  1158. return building;
  1159. }
  1160. return BuildingID::NONE; //Can't build anything
  1161. }
  1162. bool VCAI::tryBuildNextStructure(const CGTownInstance * t, std::vector<BuildingID> buildList, unsigned int maxDays)
  1163. {
  1164. for(const auto & building : buildList)
  1165. {
  1166. if(t->hasBuilt(building))
  1167. continue;
  1168. return tryBuildStructure(t, building, maxDays);
  1169. }
  1170. return false;//Nothing to build
  1171. }
  1172. //Set of buildings for different goals. Does not include any prerequisites.
  1173. static const BuildingID essential[] = {BuildingID::TAVERN, BuildingID::TOWN_HALL};
  1174. static const BuildingID goldSource[] = {BuildingID::TOWN_HALL, BuildingID::CITY_HALL, BuildingID::CAPITOL};
  1175. static const BuildingID capitolRequirements[] = { BuildingID::FORT, BuildingID::CITADEL };
  1176. static const BuildingID unitsSource[] = { BuildingID::DWELL_LVL_1, BuildingID::DWELL_LVL_2, BuildingID::DWELL_LVL_3,
  1177. BuildingID::DWELL_LVL_4, BuildingID::DWELL_LVL_5, BuildingID::DWELL_LVL_6, BuildingID::DWELL_LVL_7};
  1178. static const BuildingID unitsUpgrade[] = { BuildingID::DWELL_LVL_1_UP, BuildingID::DWELL_LVL_2_UP, BuildingID::DWELL_LVL_3_UP,
  1179. BuildingID::DWELL_LVL_4_UP, BuildingID::DWELL_LVL_5_UP, BuildingID::DWELL_LVL_6_UP, BuildingID::DWELL_LVL_7_UP};
  1180. static const BuildingID unitGrowth[] = { BuildingID::FORT, BuildingID::CITADEL, BuildingID::CASTLE, BuildingID::HORDE_1,
  1181. BuildingID::HORDE_1_UPGR, BuildingID::HORDE_2, BuildingID::HORDE_2_UPGR};
  1182. static const BuildingID spells[] = {BuildingID::MAGES_GUILD_1, BuildingID::MAGES_GUILD_2, BuildingID::MAGES_GUILD_3,
  1183. BuildingID::MAGES_GUILD_4, BuildingID::MAGES_GUILD_5};
  1184. static const BuildingID extra[] = {BuildingID::RESOURCE_SILO, BuildingID::SPECIAL_1, BuildingID::SPECIAL_2, BuildingID::SPECIAL_3,
  1185. BuildingID::SPECIAL_4, BuildingID::SHIPYARD}; // all remaining buildings
  1186. void VCAI::buildStructure(const CGTownInstance * t)
  1187. {
  1188. //TODO make *real* town development system
  1189. //TODO: faction-specific development: use special buildings, build dwellings in better order, etc
  1190. //TODO: build resource silo, defences when needed
  1191. //Possible - allow "locking" on specific building (build prerequisites and then building itself)
  1192. //below algorithm focuses on economy growth at start of the game.
  1193. TResources currentRes = cb->getResourceAmount();
  1194. TResources currentIncome = t->dailyIncome();
  1195. int townIncome = currentIncome[Res::GOLD];
  1196. if(tryBuildAnyStructure(t, std::vector<BuildingID>(essential, essential + ARRAY_COUNT(essential))))
  1197. return;
  1198. //the more gold the better and less problems later
  1199. if(tryBuildNextStructure(t, std::vector<BuildingID>(goldSource, goldSource + ARRAY_COUNT(goldSource))))
  1200. return;
  1201. //workaround for mantis #2696 - build fort and citadel - building castle will be handled without bug
  1202. if(vstd::contains(t->builtBuildings, BuildingID::CITY_HALL) && cb->canBuildStructure(t, BuildingID::CAPITOL) != EBuildingState::HAVE_CAPITAL &&
  1203. cb->canBuildStructure(t, BuildingID::CAPITOL) != EBuildingState::FORBIDDEN)
  1204. if(tryBuildNextStructure(t, std::vector<BuildingID>(capitolRequirements, capitolRequirements + ARRAY_COUNT(capitolRequirements))))
  1205. return;
  1206. if((!vstd::contains(t->builtBuildings, BuildingID::CAPITOL) && cb->canBuildStructure(t, BuildingID::CAPITOL) != EBuildingState::HAVE_CAPITAL && cb->canBuildStructure(t, BuildingID::CAPITOL) != EBuildingState::FORBIDDEN)
  1207. || (!vstd::contains(t->builtBuildings, BuildingID::CITY_HALL) && cb->canBuildStructure(t, BuildingID::CAPITOL) == EBuildingState::HAVE_CAPITAL && cb->canBuildStructure(t, BuildingID::CITY_HALL) != EBuildingState::FORBIDDEN)
  1208. || (!vstd::contains(t->builtBuildings, BuildingID::TOWN_HALL) && cb->canBuildStructure(t, BuildingID::TOWN_HALL) != EBuildingState::FORBIDDEN))
  1209. return; //save money for capitol or city hall if capitol unavailable, do not build other things (unless gold source buildings are disabled in map editor)
  1210. if(cb->getDate(Date::DAY_OF_WEEK) > 6)// last 2 days of week - try to focus on growth
  1211. {
  1212. if(tryBuildNextStructure(t, std::vector<BuildingID>(unitGrowth, unitGrowth + ARRAY_COUNT(unitGrowth)), 2))
  1213. return;
  1214. }
  1215. // first in-game week or second half of any week: try build dwellings
  1216. if(cb->getDate(Date::DAY) < 7 || cb->getDate(Date::DAY_OF_WEEK) > 3)
  1217. if(tryBuildAnyStructure(t, std::vector<BuildingID>(unitsSource, unitsSource + ARRAY_COUNT(unitsSource)), 8 - cb->getDate(Date::DAY_OF_WEEK)))
  1218. return;
  1219. //try to upgrade dwelling
  1220. for(int i = 0; i < ARRAY_COUNT(unitsUpgrade); i++)
  1221. {
  1222. if(t->hasBuilt(unitsSource[i]) && !t->hasBuilt(unitsUpgrade[i]))
  1223. {
  1224. if(tryBuildStructure(t, unitsUpgrade[i]))
  1225. return;
  1226. }
  1227. }
  1228. //remaining tasks
  1229. if(tryBuildNextStructure(t, std::vector<BuildingID>(spells, spells + ARRAY_COUNT(spells))))
  1230. return;
  1231. if(tryBuildAnyStructure(t, std::vector<BuildingID>(extra, extra + ARRAY_COUNT(extra))))
  1232. return;
  1233. //at the end, try to get and build any extra buildings with nonstandard slots (for example HotA 3rd level dwelling)
  1234. std::vector<BuildingID> extraBuildings;
  1235. for(auto buildingInfo : t->town->buildings)
  1236. if(buildingInfo.first > 43)
  1237. extraBuildings.push_back(buildingInfo.first);
  1238. if(tryBuildAnyStructure(t, extraBuildings))
  1239. return;
  1240. }
  1241. bool VCAI::isGoodForVisit(const CGObjectInstance *obj, HeroPtr h, SectorMap &sm)
  1242. {
  1243. const int3 pos = obj->visitablePos();
  1244. const int3 targetPos = sm.firstTileToGet(h, pos);
  1245. if (!targetPos.valid())
  1246. return false;
  1247. if (isTileNotReserved(h.get(), targetPos) &&
  1248. !obj->wasVisited(playerID) &&
  1249. (cb->getPlayerRelations(ai->playerID, obj->tempOwner) == PlayerRelations::ENEMIES || isWeeklyRevisitable(obj)) && //flag or get weekly resources / creatures
  1250. isSafeToVisit(h, pos) &&
  1251. shouldVisit(h, obj) &&
  1252. !vstd::contains(alreadyVisited, obj) &&
  1253. !vstd::contains(reservedObjs, obj) &&
  1254. isAccessibleForHero(targetPos, h))
  1255. {
  1256. const CGObjectInstance *topObj = cb->getVisitableObjs(obj->visitablePos()).back(); //it may be hero visiting this obj
  1257. //we don't try visiting object on which allied or owned hero stands
  1258. // -> it will just trigger exchange windows and AI will be confused that obj behind doesn't get visited
  1259. if (topObj->ID == Obj::HERO && cb->getPlayerRelations(h->tempOwner, topObj->tempOwner) != PlayerRelations::ENEMIES)
  1260. return false;
  1261. else
  1262. return true; //all of the following is met
  1263. }
  1264. return false;
  1265. }
  1266. bool VCAI::isTileNotReserved(const CGHeroInstance * h, int3 t)
  1267. {
  1268. if (t.valid())
  1269. {
  1270. auto obj = cb->getTopObj(t);
  1271. if (obj && vstd::contains(ai->reservedObjs, obj) && !vstd::contains(reservedHeroesMap[h], obj))
  1272. return false; //do not capture object reserved by another hero
  1273. else
  1274. return true;
  1275. }
  1276. else
  1277. return false;
  1278. }
  1279. bool VCAI::canRecruitAnyHero (const CGTownInstance * t) const
  1280. {
  1281. //TODO: make gathering gold, building tavern or conquering town (?) possible subgoals
  1282. if (!t)
  1283. t = findTownWithTavern();
  1284. if (t)
  1285. return cb->getResourceAmount(Res::GOLD) >= GameConstants::HERO_GOLD_COST &&
  1286. cb->getHeroesInfo().size() < ALLOWED_ROAMING_HEROES &&
  1287. cb->getAvailableHeroes(t).size();
  1288. else
  1289. return false;
  1290. }
  1291. void VCAI::wander(HeroPtr h)
  1292. {
  1293. //unclaim objects that are now dangerous for us
  1294. auto reservedObjsSetCopy = reservedHeroesMap[h];
  1295. for (auto obj : reservedObjsSetCopy)
  1296. {
  1297. if (!isSafeToVisit(h, obj->visitablePos()))
  1298. unreserveObject(h, obj);
  1299. }
  1300. TimeCheck tc("looking for wander destination");
  1301. while (h->movement)
  1302. {
  1303. validateVisitableObjs();
  1304. std::vector <ObjectIdRef> dests;
  1305. auto sm = getCachedSectorMap(h);
  1306. //also visit our reserved objects - but they are not prioritized to avoid running back and forth
  1307. vstd::copy_if(reservedHeroesMap[h], std::back_inserter(dests), [&](ObjectIdRef obj) -> bool
  1308. {
  1309. int3 pos = sm->firstTileToGet(h, obj->visitablePos());
  1310. if(pos.valid() && isAccessibleForHero(pos, h)) //even nearby objects could be blocked by other heroes :(
  1311. return true;
  1312. return false;
  1313. });
  1314. int pass = 0;
  1315. while(!dests.size() && pass < 3)
  1316. {
  1317. if(pass < 2) // optimization - first check objects in current sector; then in sectors around
  1318. {
  1319. auto objs = sm->getNearbyObjs(h, pass);
  1320. vstd::copy_if(objs, std::back_inserter(dests), [&](ObjectIdRef obj) -> bool
  1321. {
  1322. return isGoodForVisit(obj, h, *sm);
  1323. });
  1324. }
  1325. else // we only check full objects list if for some reason there are no objects in closest sectors
  1326. {
  1327. vstd::copy_if(visitableObjs, std::back_inserter(dests), [&](ObjectIdRef obj) -> bool
  1328. {
  1329. return isGoodForVisit(obj, h, *sm);
  1330. });
  1331. }
  1332. pass++;
  1333. }
  1334. vstd::erase_if(dests, [&](ObjectIdRef obj) -> bool
  1335. {
  1336. return !isSafeToVisit(h, sm->firstTileToGet(h, obj->visitablePos()));
  1337. });
  1338. if(!dests.size())
  1339. {
  1340. if (cb->getVisitableObjs(h->visitablePos()).size() > 1)
  1341. moveHeroToTile(h->visitablePos(), h); //just in case we're standing on blocked subterranean gate
  1342. auto compareReinforcements = [h](const CGTownInstance *lhs, const CGTownInstance *rhs) -> bool
  1343. {
  1344. return howManyReinforcementsCanGet(h, lhs) < howManyReinforcementsCanGet(h, rhs);
  1345. };
  1346. std::vector<const CGTownInstance *> townsReachable;
  1347. std::vector<const CGTownInstance *> townsNotReachable;
  1348. for(const CGTownInstance *t : cb->getTownsInfo())
  1349. {
  1350. if(!t->visitingHero && howManyReinforcementsCanGet(h,t) && !vstd::contains(townVisitsThisWeek[h], t))
  1351. {
  1352. if (isAccessibleForHero (t->visitablePos(), h))
  1353. townsReachable.push_back(t);
  1354. else
  1355. townsNotReachable.push_back(t);
  1356. }
  1357. }
  1358. if(townsReachable.size())
  1359. {
  1360. boost::sort(townsReachable, compareReinforcements);
  1361. dests.push_back(townsReachable.back());
  1362. }
  1363. else if(townsNotReachable.size())
  1364. {
  1365. boost::sort(townsNotReachable, compareReinforcements);
  1366. //TODO pick the truly best
  1367. const CGTownInstance *t = townsNotReachable.back();
  1368. logAi->debug("%s can't reach any town, we'll try to make our way to %s at %s",h->name,t->name, t->visitablePos().toString());
  1369. int3 pos1 = h->pos;
  1370. striveToGoal(sptr(Goals::ClearWayTo(t->visitablePos()).sethero(h)));
  1371. //if out hero is stuck, we may need to request another hero to clear the way we see
  1372. if (pos1 == h->pos && h == primaryHero()) //hero can't move
  1373. {
  1374. if (canRecruitAnyHero(t))
  1375. recruitHero(t);
  1376. }
  1377. break;
  1378. }
  1379. else if(cb->getResourceAmount(Res::GOLD) >= GameConstants::HERO_GOLD_COST)
  1380. {
  1381. std::vector<const CGTownInstance *> towns = cb->getTownsInfo();
  1382. vstd::erase_if(towns, [](const CGTownInstance *t) -> bool
  1383. {
  1384. for(const CGHeroInstance *h : cb->getHeroesInfo())
  1385. if(!t->getArmyStrength() || howManyReinforcementsCanGet(h, t))
  1386. return true;
  1387. return false;
  1388. });
  1389. boost::sort(towns, compareArmyStrength);
  1390. if(towns.size())
  1391. recruitHero(towns.back());
  1392. break;
  1393. }
  1394. else
  1395. {
  1396. logAi->debug("Nowhere more to go...");
  1397. break;
  1398. }
  1399. }
  1400. //end of objs empty
  1401. if (dests.size()) //performance improvement
  1402. {
  1403. boost::sort(dests, CDistanceSorter(h.get())); //find next closest one
  1404. //wander should not cause heroes to be reserved - they are always considered free
  1405. const ObjectIdRef&dest = dests.front();
  1406. logAi->debug("Of all %d destinations, object oid=%d seems nice",dests.size(), dest.id.getNum());
  1407. if(!goVisitObj(dest, h))
  1408. {
  1409. if(!dest)
  1410. {
  1411. logAi->debug("Visit attempt made the object (id=%d) gone...", dest.id.getNum());
  1412. }
  1413. else
  1414. {
  1415. logAi->debug("Hero %s apparently used all MPs (%d left)", h->name, h->movement);
  1416. return;
  1417. }
  1418. }
  1419. }
  1420. if (h->visitedTown)
  1421. {
  1422. townVisitsThisWeek[h].insert(h->visitedTown);
  1423. buildArmyIn(h->visitedTown);
  1424. }
  1425. }
  1426. }
  1427. void VCAI::setGoal(HeroPtr h, Goals::TSubgoal goal)
  1428. {
  1429. if(goal->invalid())
  1430. vstd::erase_if_present(lockedHeroes, h);
  1431. else
  1432. {
  1433. lockedHeroes[h] = goal;
  1434. goal->setisElementar(false); //Force always evaluate goals before realizing
  1435. }
  1436. }
  1437. void VCAI::evaluateGoal(HeroPtr h)
  1438. {
  1439. if (vstd::contains(lockedHeroes, h))
  1440. fh->setPriority(lockedHeroes[h]);
  1441. }
  1442. void VCAI::completeGoal (Goals::TSubgoal goal)
  1443. {
  1444. logAi->trace("Completing goal: %s", goal->name());
  1445. if (const CGHeroInstance * h = goal->hero.get(true))
  1446. {
  1447. auto it = lockedHeroes.find(h);
  1448. if (it != lockedHeroes.end())
  1449. if (it->second == goal)
  1450. {
  1451. logAi->debug(goal->completeMessage());
  1452. lockedHeroes.erase(it); //goal fulfilled, free hero
  1453. }
  1454. }
  1455. else //complete goal for all heroes maybe?
  1456. {
  1457. vstd::erase_if(lockedHeroes, [goal](std::pair<HeroPtr, Goals::TSubgoal> p)
  1458. {
  1459. if (*(p.second) == *goal || p.second->fulfillsMe(goal)) //we could have fulfilled goals of other heroes by chance
  1460. {
  1461. logAi->debug(p.second->completeMessage());
  1462. return true;
  1463. }
  1464. return false;
  1465. });
  1466. }
  1467. }
  1468. void VCAI::battleStart(const CCreatureSet *army1, const CCreatureSet *army2, int3 tile, const CGHeroInstance *hero1, const CGHeroInstance *hero2, bool side)
  1469. {
  1470. NET_EVENT_HANDLER;
  1471. assert(playerID > PlayerColor::PLAYER_LIMIT || status.getBattle() == UPCOMING_BATTLE);
  1472. status.setBattle(ONGOING_BATTLE);
  1473. const CGObjectInstance *presumedEnemy = vstd::backOrNull(cb->getVisitableObjs(tile)); //may be nullptr in some very are cases -> eg. visited monolith and fighting with an enemy at the FoW covered exit
  1474. battlename = boost::str(boost::format("Starting battle of %s attacking %s at %s") % (hero1 ? hero1->name : "a army") % (presumedEnemy ? presumedEnemy->getObjectName() : "unknown enemy") % tile.toString());
  1475. CAdventureAI::battleStart(army1, army2, tile, hero1, hero2, side);
  1476. }
  1477. void VCAI::battleEnd(const BattleResult *br)
  1478. {
  1479. NET_EVENT_HANDLER;
  1480. assert(status.getBattle() == ONGOING_BATTLE);
  1481. status.setBattle(ENDING_BATTLE);
  1482. bool won = br->winner == myCb->battleGetMySide();
  1483. logAi->debug("Player %d (%s): I %s the %s!", playerID, playerID.getStr(), (won ? "won" : "lost"), battlename);
  1484. battlename.clear();
  1485. CAdventureAI::battleEnd(br);
  1486. }
  1487. void VCAI::waitTillFree()
  1488. {
  1489. auto unlock = vstd::makeUnlockSharedGuard(CGameState::mutex);
  1490. status.waitTillFree();
  1491. }
  1492. void VCAI::markObjectVisited (const CGObjectInstance *obj)
  1493. {
  1494. if(!obj)
  1495. return;
  1496. if(dynamic_cast<const CGVisitableOPH *>(obj) || //we may want to visit it with another hero
  1497. dynamic_cast<const CGBonusingObject *>(obj) || //or another time
  1498. (obj->ID == Obj::MONSTER))
  1499. return;
  1500. alreadyVisited.insert(obj);
  1501. }
  1502. void VCAI::reserveObject(HeroPtr h, const CGObjectInstance *obj)
  1503. {
  1504. reservedObjs.insert(obj);
  1505. reservedHeroesMap[h].insert(obj);
  1506. logAi->debug("reserved object id=%d; address=%p; name=%s", obj->id ,obj, obj->getObjectName());
  1507. }
  1508. void VCAI::unreserveObject(HeroPtr h, const CGObjectInstance *obj)
  1509. {
  1510. vstd::erase_if_present(reservedObjs, obj); //unreserve objects
  1511. vstd::erase_if_present(reservedHeroesMap[h], obj);
  1512. }
  1513. void VCAI::markHeroUnableToExplore (HeroPtr h)
  1514. {
  1515. heroesUnableToExplore.insert(h);
  1516. }
  1517. void VCAI::markHeroAbleToExplore (HeroPtr h)
  1518. {
  1519. vstd::erase_if_present(heroesUnableToExplore, h);
  1520. }
  1521. bool VCAI::isAbleToExplore (HeroPtr h)
  1522. {
  1523. return !vstd::contains (heroesUnableToExplore, h);
  1524. }
  1525. void VCAI::clearPathsInfo()
  1526. {
  1527. heroesUnableToExplore.clear();
  1528. cachedSectorMaps.clear();
  1529. }
  1530. void VCAI::validateVisitableObjs()
  1531. {
  1532. std::string errorMsg;
  1533. auto shouldBeErased = [&](const CGObjectInstance *obj) -> bool
  1534. {
  1535. if (obj)
  1536. return !cb->getObj(obj->id, false); // no verbose output needed as we check object visibility
  1537. else
  1538. return true;
  1539. };
  1540. //errorMsg is captured by ref so lambda will take the new text
  1541. errorMsg = " shouldn't be on the visitable objects list!";
  1542. vstd::erase_if(visitableObjs, shouldBeErased);
  1543. //FIXME: how comes our own heroes become inaccessible?
  1544. vstd::erase_if(reservedHeroesMap, [](std::pair<HeroPtr, std::set<const CGObjectInstance *>> hp) -> bool
  1545. {
  1546. return !hp.first.get(true);
  1547. });
  1548. for(auto &p : reservedHeroesMap)
  1549. {
  1550. errorMsg = " shouldn't be on list for hero " + p.first->name + "!";
  1551. vstd::erase_if(p.second, shouldBeErased);
  1552. }
  1553. errorMsg = " shouldn't be on the reserved objs list!";
  1554. vstd::erase_if(reservedObjs, shouldBeErased);
  1555. //TODO overkill, hidden object should not be removed. However, we can't know if hidden object is erased from game.
  1556. errorMsg = " shouldn't be on the already visited objs list!";
  1557. vstd::erase_if(alreadyVisited, shouldBeErased);
  1558. }
  1559. void VCAI::retreiveVisitableObjs(std::vector<const CGObjectInstance *> &out, bool includeOwned) const
  1560. {
  1561. foreach_tile_pos([&](const int3 &pos)
  1562. {
  1563. for(const CGObjectInstance *obj : myCb->getVisitableObjs(pos, false))
  1564. {
  1565. if(includeOwned || obj->tempOwner != playerID)
  1566. out.push_back(obj);
  1567. }
  1568. });
  1569. }
  1570. void VCAI::retreiveVisitableObjs()
  1571. {
  1572. foreach_tile_pos([&](const int3 &pos)
  1573. {
  1574. for(const CGObjectInstance *obj : myCb->getVisitableObjs(pos, false))
  1575. {
  1576. if(obj->tempOwner != playerID)
  1577. addVisitableObj(obj);
  1578. }
  1579. });
  1580. }
  1581. std::vector<const CGObjectInstance *> VCAI::getFlaggedObjects() const
  1582. {
  1583. std::vector<const CGObjectInstance *> ret;
  1584. for(const CGObjectInstance *obj : visitableObjs)
  1585. {
  1586. if(obj->tempOwner == playerID)
  1587. ret.push_back(obj);
  1588. }
  1589. return ret;
  1590. }
  1591. void VCAI::addVisitableObj(const CGObjectInstance *obj)
  1592. {
  1593. visitableObjs.insert(obj);
  1594. helperObjInfo[obj] = ObjInfo(obj);
  1595. // All teleport objects seen automatically assigned to appropriate channels
  1596. auto teleportObj = dynamic_cast<const CGTeleport *>(obj);
  1597. if(teleportObj)
  1598. CGTeleport::addToChannel(knownTeleportChannels, teleportObj);
  1599. }
  1600. const CGObjectInstance * VCAI::lookForArt(int aid) const
  1601. {
  1602. for(const CGObjectInstance *obj : ai->visitableObjs)
  1603. {
  1604. if(obj->ID == Obj::ARTIFACT && obj->subID == aid)
  1605. return obj;
  1606. }
  1607. return nullptr;
  1608. //TODO what if more than one artifact is available? return them all or some slection criteria
  1609. }
  1610. bool VCAI::isAccessible(const int3 &pos)
  1611. {
  1612. //TODO precalculate for speed
  1613. for(const CGHeroInstance *h : cb->getHeroesInfo())
  1614. {
  1615. if(isAccessibleForHero(pos, h))
  1616. return true;
  1617. }
  1618. return false;
  1619. }
  1620. HeroPtr VCAI::getHeroWithGrail() const
  1621. {
  1622. for(const CGHeroInstance *h : cb->getHeroesInfo())
  1623. if(h->hasArt(2)) //grail
  1624. return h;
  1625. return nullptr;
  1626. }
  1627. const CGObjectInstance * VCAI::getUnvisitedObj(const std::function<bool(const CGObjectInstance *)> &predicate)
  1628. {
  1629. //TODO smarter definition of unvisited
  1630. for(const CGObjectInstance *obj : visitableObjs)
  1631. if(predicate(obj) && !vstd::contains(alreadyVisited, obj))
  1632. return obj;
  1633. return nullptr;
  1634. }
  1635. bool VCAI::isAccessibleForHero(const int3 & pos, HeroPtr h, bool includeAllies) const
  1636. {
  1637. if (!includeAllies)
  1638. { //don't visit tile occupied by allied hero
  1639. for (auto obj : cb->getVisitableObjs(pos))
  1640. {
  1641. if (obj->ID == Obj::HERO &&
  1642. cb->getPlayerRelations(ai->playerID, obj->tempOwner) != PlayerRelations::ENEMIES &&
  1643. obj != h.get())
  1644. return false;
  1645. }
  1646. }
  1647. return cb->getPathsInfo(h.get())->getPathInfo(pos)->reachable();
  1648. }
  1649. bool VCAI::moveHeroToTile(int3 dst, HeroPtr h)
  1650. {
  1651. //TODO: consider if blockVisit objects change something in our checks: AIUtility::isBlockVisitObj()
  1652. auto afterMovementCheck = [&]() -> void
  1653. {
  1654. waitTillFree(); //movement may cause battle or blocking dialog
  1655. if(!h)
  1656. {
  1657. lostHero(h);
  1658. teleportChannelProbingList.clear();
  1659. if (status.channelProbing()) // if hero lost during channel probing we need to switch this mode off
  1660. status.setChannelProbing(false);
  1661. throw cannotFulfillGoalException("Hero was lost!");
  1662. }
  1663. };
  1664. logAi->debug("Moving hero %s to tile %s", h->name, dst.toString());
  1665. int3 startHpos = h->visitablePos();
  1666. bool ret = false;
  1667. if(startHpos == dst)
  1668. {
  1669. //FIXME: this assertion fails also if AI moves onto defeated guarded object
  1670. assert(cb->getVisitableObjs(dst).size() > 1); //there's no point in revisiting tile where there is no visitable object
  1671. cb->moveHero(*h, CGHeroInstance::convertPosition(dst, true));
  1672. afterMovementCheck();// TODO: is it feasible to hero get killed there if game work properly?
  1673. // not sure if AI can currently reconsider to attack bank while staying on it. Check issue 2084 on mantis for more information.
  1674. ret = true;
  1675. }
  1676. else
  1677. {
  1678. CGPath path;
  1679. cb->getPathsInfo(h.get())->getPath(path, dst);
  1680. if(path.nodes.empty())
  1681. {
  1682. logAi->error("Hero %s cannot reach %s.", h->name, dst.toString());
  1683. throw goalFulfilledException (sptr(Goals::VisitTile(dst).sethero(h)));
  1684. }
  1685. int i = path.nodes.size()-1;
  1686. auto getObj = [&](int3 coord, bool ignoreHero)
  1687. {
  1688. auto tile = cb->getTile(coord, false);
  1689. assert(tile);
  1690. return tile->topVisitableObj(ignoreHero);
  1691. //return cb->getTile(coord,false)->topVisitableObj(ignoreHero);
  1692. };
  1693. auto isTeleportAction = [&](CGPathNode::ENodeAction action) -> bool
  1694. {
  1695. if(action != CGPathNode::TELEPORT_NORMAL &&
  1696. action != CGPathNode::TELEPORT_BLOCKING_VISIT &&
  1697. action != CGPathNode::TELEPORT_BATTLE)
  1698. {
  1699. return false;
  1700. }
  1701. return true;
  1702. };
  1703. auto getDestTeleportObj = [&](const CGObjectInstance * currentObject, const CGObjectInstance * nextObjectTop, const CGObjectInstance * nextObject) -> const CGObjectInstance *
  1704. {
  1705. if(CGTeleport::isConnected(currentObject, nextObjectTop))
  1706. return nextObjectTop;
  1707. if(nextObjectTop && nextObjectTop->ID == Obj::HERO &&
  1708. CGTeleport::isConnected(currentObject, nextObject))
  1709. {
  1710. return nextObject;
  1711. }
  1712. return nullptr;
  1713. };
  1714. auto doMovement = [&](int3 dst, bool transit)
  1715. {
  1716. cb->moveHero(*h, CGHeroInstance::convertPosition(dst, true), transit);
  1717. };
  1718. auto doTeleportMovement = [&](ObjectInstanceID exitId, int3 exitPos)
  1719. {
  1720. destinationTeleport = exitId;
  1721. if(exitPos.valid())
  1722. destinationTeleportPos = CGHeroInstance::convertPosition(exitPos, true);
  1723. cb->moveHero(*h, h->pos);
  1724. destinationTeleport = ObjectInstanceID();
  1725. destinationTeleportPos = int3(-1);
  1726. afterMovementCheck();
  1727. };
  1728. auto doChannelProbing = [&]() -> void
  1729. {
  1730. auto currentPos = CGHeroInstance::convertPosition(h->pos,false);
  1731. auto currentExit = getObj(currentPos, true)->id;
  1732. status.setChannelProbing(true);
  1733. for(auto exit : teleportChannelProbingList)
  1734. doTeleportMovement(exit, int3(-1));
  1735. teleportChannelProbingList.clear();
  1736. status.setChannelProbing(false);
  1737. doTeleportMovement(currentExit, currentPos);
  1738. };
  1739. for(; i>0; i--)
  1740. {
  1741. int3 currentCoord = path.nodes[i].coord;
  1742. int3 nextCoord = path.nodes[i-1].coord;
  1743. auto currentObject = getObj(currentCoord, currentCoord == CGHeroInstance::convertPosition(h->pos,false));
  1744. auto nextObjectTop = getObj(nextCoord, false);
  1745. auto nextObject = getObj(nextCoord, true);
  1746. auto destTeleportObj = getDestTeleportObj(currentObject, nextObjectTop, nextObject);
  1747. if(isTeleportAction(path.nodes[i-1].action) && destTeleportObj != nullptr)
  1748. { //we use special login if hero standing on teleporter it's mean we need
  1749. doTeleportMovement(destTeleportObj->id, nextCoord);
  1750. if(teleportChannelProbingList.size())
  1751. doChannelProbing();
  1752. markObjectVisited(destTeleportObj); //FIXME: Monoliths are not correctly visited
  1753. continue;
  1754. }
  1755. //stop sending move requests if the next node can't be reached at the current turn (hero exhausted his move points)
  1756. if(path.nodes[i-1].turns)
  1757. {
  1758. //blockedHeroes.insert(h); //to avoid attempts of moving heroes with very little MPs
  1759. break;
  1760. }
  1761. int3 endpos = path.nodes[i-1].coord;
  1762. if(endpos == h->visitablePos())
  1763. continue;
  1764. if((i-2 >= 0) // Check there is node after next one; otherwise transit is pointless
  1765. && (CGTeleport::isConnected(nextObjectTop, getObj(path.nodes[i-2].coord, false))
  1766. || CGTeleport::isTeleport(nextObjectTop)))
  1767. { // Hero should be able to go through object if it's allow transit
  1768. doMovement(endpos, true);
  1769. }
  1770. else if(path.nodes[i-1].layer == EPathfindingLayer::AIR)
  1771. doMovement(endpos, true);
  1772. else
  1773. doMovement(endpos, false);
  1774. afterMovementCheck();
  1775. if(teleportChannelProbingList.size())
  1776. doChannelProbing();
  1777. }
  1778. }
  1779. if (h)
  1780. {
  1781. if(auto visitedObject = vstd::frontOrNull(cb->getVisitableObjs(h->visitablePos()))) //we stand on something interesting
  1782. {
  1783. if (visitedObject != *h)
  1784. performObjectInteraction (visitedObject, h);
  1785. }
  1786. }
  1787. if(h) //we could have lost hero after last move
  1788. {
  1789. completeGoal (sptr(Goals::VisitTile(dst).sethero(h))); //we stepped on some tile, anyway
  1790. completeGoal (sptr(Goals::ClearWayTo(dst).sethero(h)));
  1791. ret = (dst == h->visitablePos());
  1792. if(!ret) //reserve object we are heading towards
  1793. {
  1794. auto obj = vstd::frontOrNull(cb->getVisitableObjs(dst));
  1795. if(obj && obj != *h)
  1796. reserveObject(h, obj);
  1797. }
  1798. if(startHpos == h->visitablePos() && !ret) //we didn't move and didn't reach the target
  1799. {
  1800. vstd::erase_if_present(lockedHeroes, h); //hero seemingly is confused
  1801. throw cannotFulfillGoalException("Invalid path found!"); //FIXME: should never happen
  1802. }
  1803. evaluateGoal(h); //new hero position means new game situation
  1804. logAi->debug("Hero %s moved from %s to %s. Returning %d.", h->name, startHpos.toString(), h->visitablePos().toString(), ret);
  1805. }
  1806. return ret;
  1807. }
  1808. void VCAI::tryRealize(Goals::Explore & g)
  1809. {
  1810. throw cannotFulfillGoalException("EXPLORE is not an elementar goal!");
  1811. }
  1812. void VCAI::tryRealize(Goals::RecruitHero & g)
  1813. {
  1814. if(const CGTownInstance *t = findTownWithTavern())
  1815. {
  1816. recruitHero(t, true);
  1817. //TODO try to free way to blocked town
  1818. //TODO: adventure map tavern or prison?
  1819. }
  1820. }
  1821. void VCAI::tryRealize(Goals::VisitTile & g)
  1822. {
  1823. if(!g.hero->movement)
  1824. throw cannotFulfillGoalException("Cannot visit tile: hero is out of MPs!");
  1825. if(g.tile == g.hero->visitablePos() && cb->getVisitableObjs(g.hero->visitablePos()).size() < 2)
  1826. {
  1827. logAi->warn("Why do I want to move hero %s to tile %s? Already standing on that tile! ", g.hero->name, g.tile.toString());
  1828. throw goalFulfilledException (sptr(g));
  1829. }
  1830. if (ai->moveHeroToTile(g.tile, g.hero.get()))
  1831. {
  1832. throw goalFulfilledException (sptr(g));
  1833. }
  1834. }
  1835. void VCAI::tryRealize(Goals::VisitHero & g)
  1836. {
  1837. if(!g.hero->movement)
  1838. throw cannotFulfillGoalException("Cannot visit target hero: hero is out of MPs!");
  1839. const CGObjectInstance * obj = cb->getObj(ObjectInstanceID(g.objid));
  1840. if (obj)
  1841. {
  1842. if (ai->moveHeroToTile(obj->visitablePos(), g.hero.get()))
  1843. {
  1844. throw goalFulfilledException (sptr(g));
  1845. }
  1846. }
  1847. else
  1848. throw cannotFulfillGoalException("Cannot visit hero: object not found!");
  1849. }
  1850. void VCAI::tryRealize(Goals::BuildThis & g)
  1851. {
  1852. const CGTownInstance *t = g.town;
  1853. if(!t && g.hero)
  1854. t = g.hero->visitedTown;
  1855. if(!t)
  1856. {
  1857. for(const CGTownInstance *t : cb->getTownsInfo())
  1858. {
  1859. switch(cb->canBuildStructure(t, BuildingID(g.bid)))
  1860. {
  1861. case EBuildingState::ALLOWED:
  1862. cb->buildBuilding(t, BuildingID(g.bid));
  1863. return;
  1864. default:
  1865. break;
  1866. }
  1867. }
  1868. }
  1869. else if(cb->canBuildStructure(t, BuildingID(g.bid)) == EBuildingState::ALLOWED)
  1870. {
  1871. cb->buildBuilding(t, BuildingID(g.bid));
  1872. return;
  1873. }
  1874. throw cannotFulfillGoalException("Cannot build a given structure!");
  1875. }
  1876. void VCAI::tryRealize(Goals::DigAtTile & g)
  1877. {
  1878. assert(g.hero->visitablePos() == g.tile); //surely we want to crash here?
  1879. if (g.hero->diggingStatus() == EDiggingStatus::CAN_DIG)
  1880. {
  1881. cb->dig(g.hero.get());
  1882. completeGoal(sptr(g)); // finished digging
  1883. }
  1884. else
  1885. {
  1886. ai->lockedHeroes[g.hero] = sptr(g); //hero who tries to dig shouldn't do anything else
  1887. throw cannotFulfillGoalException("A hero can't dig!\n");
  1888. }
  1889. }
  1890. void VCAI::tryRealize(Goals::CollectRes & g)
  1891. {
  1892. if(cb->getResourceAmount(static_cast<Res::ERes>(g.resID)) >= g.value)
  1893. throw cannotFulfillGoalException("Goal is already fulfilled!");
  1894. if(const CGObjectInstance *obj = cb->getObj(ObjectInstanceID(g.objid), false))
  1895. {
  1896. if(const IMarket *m = IMarket::castFrom(obj, false))
  1897. {
  1898. for (Res::ERes i = Res::WOOD; i <= Res::GOLD; vstd::advance(i, 1))
  1899. {
  1900. if(i == g.resID) continue;
  1901. int toGive, toGet;
  1902. m->getOffer(i, g.resID, toGive, toGet, EMarketMode::RESOURCE_RESOURCE);
  1903. toGive = toGive * (cb->getResourceAmount(i) / toGive);
  1904. //TODO trade only as much as needed
  1905. cb->trade(obj, EMarketMode::RESOURCE_RESOURCE, i, g.resID, toGive);
  1906. if(cb->getResourceAmount(static_cast<Res::ERes>(g.resID)) >= g.value)
  1907. return;
  1908. }
  1909. throw cannotFulfillGoalException("I cannot get needed resources by trade!");
  1910. }
  1911. else
  1912. {
  1913. throw cannotFulfillGoalException("I don't know how to use this object to raise resources!");
  1914. }
  1915. }
  1916. else
  1917. {
  1918. saving[g.resID] = 1;
  1919. throw cannotFulfillGoalException("No object that could be used to raise resources!");
  1920. }
  1921. }
  1922. void VCAI::tryRealize(Goals::Build & g)
  1923. {
  1924. for(const CGTownInstance *t : cb->getTownsInfo())
  1925. {
  1926. logAi->debug("Looking into %s", t->name);
  1927. buildStructure(t);
  1928. if(!ai->primaryHero() ||
  1929. (t->getArmyStrength() > ai->primaryHero()->getArmyStrength() * 2 && !isAccessibleForHero(t->visitablePos(), ai->primaryHero())))
  1930. {
  1931. recruitHero(t);
  1932. buildArmyIn(t);
  1933. }
  1934. }
  1935. throw cannotFulfillGoalException("BUILD has been realized as much as possible.");
  1936. }
  1937. void VCAI::tryRealize(Goals::Invalid & g)
  1938. {
  1939. throw cannotFulfillGoalException("I don't know how to fulfill this!");
  1940. }
  1941. void VCAI::tryRealize(Goals::AbstractGoal & g)
  1942. {
  1943. logAi->debug("Attempting realizing goal with code %s",g.name());
  1944. throw cannotFulfillGoalException("Unknown type of goal !");
  1945. }
  1946. const CGTownInstance * VCAI::findTownWithTavern() const
  1947. {
  1948. for(const CGTownInstance *t : cb->getTownsInfo())
  1949. if(t->hasBuilt(BuildingID::TAVERN) && !t->visitingHero)
  1950. return t;
  1951. return nullptr;
  1952. }
  1953. Goals::TSubgoal VCAI::getGoal (HeroPtr h) const
  1954. {
  1955. auto it = lockedHeroes.find(h);
  1956. if (it != lockedHeroes.end())
  1957. return it->second;
  1958. else
  1959. return sptr(Goals::Invalid());
  1960. }
  1961. std::vector<HeroPtr> VCAI::getUnblockedHeroes() const
  1962. {
  1963. std::vector<HeroPtr> ret;
  1964. for (auto h : cb->getHeroesInfo())
  1965. {
  1966. //&& !vstd::contains(lockedHeroes, h)
  1967. //at this point we assume heroes exhausted their locked goals
  1968. if (canAct(h))
  1969. ret.push_back(h);
  1970. }
  1971. return ret;
  1972. }
  1973. bool VCAI::canAct (HeroPtr h) const
  1974. {
  1975. auto mission = lockedHeroes.find(h);
  1976. if (mission != lockedHeroes.end())
  1977. {
  1978. //FIXME: I'm afraid there can be other conditions when heroes can act but not move :?
  1979. if (mission->second->goalType == Goals::DIG_AT_TILE && !mission->second->isElementar)
  1980. return false;
  1981. }
  1982. return h->movement;
  1983. }
  1984. HeroPtr VCAI::primaryHero() const
  1985. {
  1986. auto hs = cb->getHeroesInfo();
  1987. boost::sort(hs, compareHeroStrength);
  1988. if(hs.empty())
  1989. return nullptr;
  1990. return hs.back();
  1991. }
  1992. void VCAI::endTurn()
  1993. {
  1994. logAi->info("Player %d (%s) ends turn", playerID, playerID.getStr());
  1995. if(!status.haveTurn())
  1996. {
  1997. logAi->error("Not having turn at the end of turn???");
  1998. }
  1999. logAi->debug("Resources at the end of turn: %s", cb->getResourceAmount().toString());
  2000. do
  2001. {
  2002. cb->endTurn();
  2003. } while(status.haveTurn()); //for some reasons, our request may fail -> stop requesting end of turn only after we've received a confirmation that it's over
  2004. logGlobal->info("Player %d (%s) ended turn", playerID, playerID.getStr());
  2005. }
  2006. void VCAI::striveToGoal(Goals::TSubgoal ultimateGoal)
  2007. {
  2008. if (ultimateGoal->invalid())
  2009. return;
  2010. //we are looking for abstract goals
  2011. auto abstractGoal = striveToGoalInternal (ultimateGoal, false);
  2012. if (abstractGoal->invalid())
  2013. return;
  2014. //we received abstract goal, need to find concrete goals
  2015. striveToGoalInternal (abstractGoal, true);
  2016. //TODO: save abstract goals not related to hero
  2017. }
  2018. Goals::TSubgoal VCAI::striveToGoalInternal(Goals::TSubgoal ultimateGoal, bool onlyAbstract)
  2019. {
  2020. const int searchDepth = 30;
  2021. const int searchDepth2 = searchDepth-2;
  2022. Goals::TSubgoal abstractGoal = sptr(Goals::Invalid());
  2023. while(1)
  2024. {
  2025. Goals::TSubgoal goal = ultimateGoal;
  2026. logAi->debug("Striving to goal of type %s", ultimateGoal->name());
  2027. int maxGoals = searchDepth; //preventing deadlock for mutually dependent goals
  2028. while(!goal->isElementar && maxGoals && (onlyAbstract || !goal->isAbstract))
  2029. {
  2030. logAi->debug("Considering goal %s", goal->name());
  2031. try
  2032. {
  2033. boost::this_thread::interruption_point();
  2034. goal = goal->whatToDoToAchieve();
  2035. --maxGoals;
  2036. if (*goal == *ultimateGoal) //compare objects by value
  2037. throw cannotFulfillGoalException("Goal dependency loop detected!");
  2038. }
  2039. catch(goalFulfilledException &e)
  2040. {
  2041. //it is impossible to continue some goals (like exploration, for example)
  2042. completeGoal (goal);
  2043. logAi->debug("Goal %s decomposition failed: goal was completed as much as possible", goal->name());
  2044. return sptr(Goals::Invalid());
  2045. }
  2046. catch(std::exception &e)
  2047. {
  2048. logAi->debug("Goal %s decomposition failed: %s", goal->name(), e.what());
  2049. return sptr(Goals::Invalid());
  2050. }
  2051. }
  2052. try
  2053. {
  2054. boost::this_thread::interruption_point();
  2055. if (!maxGoals) //we counted down to 0 and found no solution
  2056. {
  2057. if (ultimateGoal->hero) // we seemingly don't know what to do with hero, free him
  2058. vstd::erase_if_present(lockedHeroes, ultimateGoal->hero);
  2059. std::runtime_error e("Too many subgoals, don't know what to do");
  2060. throw (e);
  2061. }
  2062. else //we can proceed
  2063. {
  2064. if (goal->hero) //lock this hero to fulfill ultimate goal
  2065. {
  2066. setGoal(goal->hero, goal);
  2067. }
  2068. }
  2069. if (goal->isAbstract)
  2070. {
  2071. abstractGoal = goal; //allow only one abstract goal per call
  2072. logAi->debug("Choosing abstract goal %s", goal->name());
  2073. break;
  2074. }
  2075. else
  2076. {
  2077. logAi->debug("Trying to realize %s (value %2.3f)", goal->name(), goal->priority);
  2078. goal->accept(this);
  2079. }
  2080. boost::this_thread::interruption_point();
  2081. }
  2082. catch(boost::thread_interrupted &e)
  2083. {
  2084. logAi->debug("Player %d: Making turn thread received an interruption!", playerID);
  2085. throw; //rethrow, we want to truly end this thread
  2086. }
  2087. catch(goalFulfilledException &e)
  2088. {
  2089. //the goal was completed successfully
  2090. completeGoal (goal);
  2091. //completed goal was main goal //TODO: find better condition
  2092. if (ultimateGoal->fulfillsMe(goal) || maxGoals > searchDepth2)
  2093. return sptr(Goals::Invalid());
  2094. }
  2095. catch(std::exception &e)
  2096. {
  2097. logAi->debug("Failed to realize subgoal of type %s (greater goal type was %s), I will stop.", goal->name(), ultimateGoal->name());
  2098. logAi->debug("The error message was: %s", e.what());
  2099. break;
  2100. }
  2101. }
  2102. return abstractGoal;
  2103. }
  2104. void VCAI::striveToQuest (const QuestInfo &q)
  2105. {
  2106. if (q.quest->missionType && q.quest->progress != CQuest::COMPLETE)
  2107. {
  2108. MetaString ms;
  2109. q.quest->getRolloverText(ms, false);
  2110. logAi->debug("Trying to realize quest: %s", ms.toString());
  2111. auto heroes = cb->getHeroesInfo();
  2112. switch (q.quest->missionType)
  2113. {
  2114. case CQuest::MISSION_ART:
  2115. {
  2116. for (auto hero : heroes) //TODO: remove duplicated code?
  2117. {
  2118. if (q.quest->checkQuest(hero))
  2119. {
  2120. striveToGoal (sptr(Goals::GetObj(q.obj->id.getNum()).sethero(hero)));
  2121. return;
  2122. }
  2123. }
  2124. for (auto art : q.quest->m5arts)
  2125. {
  2126. striveToGoal (sptr(Goals::GetArtOfType(art))); //TODO: transport?
  2127. }
  2128. break;
  2129. }
  2130. case CQuest::MISSION_HERO:
  2131. {
  2132. //striveToGoal (CGoal(RECRUIT_HERO));
  2133. for (auto hero : heroes)
  2134. {
  2135. if (q.quest->checkQuest(hero))
  2136. {
  2137. striveToGoal (sptr(Goals::GetObj(q.obj->id.getNum()).sethero(hero)));
  2138. return;
  2139. }
  2140. }
  2141. striveToGoal (sptr(Goals::FindObj(Obj::PRISON))); //rule of a thumb - quest heroes usually are locked in prisons
  2142. //BNLOG ("Don't know how to recruit hero with id %d\n", q.quest->m13489val);
  2143. break;
  2144. }
  2145. case CQuest::MISSION_ARMY:
  2146. {
  2147. for (auto hero : heroes)
  2148. {
  2149. if (q.quest->checkQuest(hero)) //very bad info - stacks can be split between multiple heroes :(
  2150. {
  2151. striveToGoal (sptr(Goals::GetObj(q.obj->id.getNum()).sethero(hero)));
  2152. return;
  2153. }
  2154. }
  2155. for (auto creature : q.quest->m6creatures)
  2156. {
  2157. striveToGoal (sptr(Goals::GatherTroops(creature.type->idNumber, creature.count)));
  2158. }
  2159. //TODO: exchange armies... oh my
  2160. //BNLOG ("Don't know how to recruit %d of %s\n", (int)(creature.count) % creature.type->namePl);
  2161. break;
  2162. }
  2163. case CQuest::MISSION_RESOURCES:
  2164. {
  2165. if (heroes.size())
  2166. {
  2167. if (q.quest->checkQuest(heroes.front())) //it doesn't matter which hero it is
  2168. {
  2169. striveToGoal (sptr(Goals::GetObj(q.obj->id.getNum())));
  2170. }
  2171. else
  2172. {
  2173. for (int i = 0; i < q.quest->m7resources.size(); ++i)
  2174. {
  2175. if (q.quest->m7resources[i])
  2176. striveToGoal (sptr(Goals::CollectRes(i, q.quest->m7resources[i])));
  2177. }
  2178. }
  2179. }
  2180. else
  2181. striveToGoal (sptr(Goals::RecruitHero())); //FIXME: checkQuest requires any hero belonging to player :(
  2182. break;
  2183. }
  2184. case CQuest::MISSION_KILL_HERO:
  2185. case CQuest::MISSION_KILL_CREATURE:
  2186. {
  2187. auto obj = cb->getObjByQuestIdentifier(q.quest->m13489val);
  2188. if (obj)
  2189. striveToGoal (sptr(Goals::GetObj(obj->id.getNum())));
  2190. else
  2191. striveToGoal (sptr(Goals::GetObj(q.obj->id.getNum()))); //visit seer hut
  2192. break;
  2193. }
  2194. case CQuest::MISSION_PRIMARY_STAT:
  2195. {
  2196. auto heroes = cb->getHeroesInfo();
  2197. for (auto hero : heroes)
  2198. {
  2199. if (q.quest->checkQuest(hero))
  2200. {
  2201. striveToGoal (sptr(Goals::GetObj(q.obj->id.getNum()).sethero(hero)));
  2202. return;
  2203. }
  2204. }
  2205. for (int i = 0; i < q.quest->m2stats.size(); ++i)
  2206. {
  2207. logAi->debug("Don't know how to increase primary stat %d", i);
  2208. }
  2209. break;
  2210. }
  2211. case CQuest::MISSION_LEVEL:
  2212. {
  2213. auto heroes = cb->getHeroesInfo();
  2214. for (auto hero : heroes)
  2215. {
  2216. if (q.quest->checkQuest(hero))
  2217. {
  2218. striveToGoal (sptr(Goals::GetObj(q.obj->id.getNum()).sethero(hero))); //TODO: causes infinite loop :/
  2219. return;
  2220. }
  2221. }
  2222. logAi->debug("Don't know how to reach hero level %d", q.quest->m13489val);
  2223. break;
  2224. }
  2225. case CQuest::MISSION_PLAYER:
  2226. {
  2227. if (playerID.getNum() != q.quest->m13489val)
  2228. logAi->debug("Can't be player of color %d", q.quest->m13489val);
  2229. break;
  2230. }
  2231. case CQuest::MISSION_KEYMASTER:
  2232. {
  2233. striveToGoal (sptr(Goals::FindObj(Obj::KEYMASTER, q.obj->subID)));
  2234. break;
  2235. }
  2236. }
  2237. }
  2238. }
  2239. void VCAI::performTypicalActions()
  2240. {
  2241. //TODO: build army only on request
  2242. for(auto t : cb->getTownsInfo())
  2243. {
  2244. buildArmyIn(t);
  2245. }
  2246. for(auto h : getUnblockedHeroes())
  2247. {
  2248. if(!h) //hero might be lost. getUnblockedHeroes() called once on start of turn
  2249. continue;
  2250. logAi->debug("Looking into %s, MP=%d", h->name.c_str(), h->movement);
  2251. makePossibleUpgrades(*h);
  2252. pickBestArtifacts(*h);
  2253. try
  2254. {
  2255. wander(h);
  2256. }
  2257. catch(std::exception &e)
  2258. {
  2259. logAi->debug("Cannot use this hero anymore, received exception: %s", e.what());
  2260. continue;
  2261. }
  2262. }
  2263. }
  2264. void VCAI::buildArmyIn(const CGTownInstance * t)
  2265. {
  2266. makePossibleUpgrades(t->visitingHero);
  2267. makePossibleUpgrades(t);
  2268. recruitCreatures(t, t->getUpperArmy());
  2269. moveCreaturesToHero(t);
  2270. }
  2271. int3 VCAI::explorationBestNeighbour(int3 hpos, int radius, HeroPtr h)
  2272. {
  2273. int3 ourPos = h->convertPosition(h->pos, false);
  2274. std::map<int3, int> dstToRevealedTiles;
  2275. for (crint3 dir : int3::getDirs())
  2276. {
  2277. int3 tile = hpos + dir;
  2278. if (cb->isInTheMap(tile))
  2279. if (ourPos != dir) //don't stand in place
  2280. if (isSafeToVisit(h, tile) && isAccessibleForHero(tile, h))
  2281. {
  2282. if (isBlockVisitObj(tile))
  2283. continue;
  2284. else
  2285. dstToRevealedTiles[tile] = howManyTilesWillBeDiscovered(radius, hpos, dir);
  2286. }
  2287. }
  2288. if (dstToRevealedTiles.empty()) //yes, it DID happen!
  2289. throw cannotFulfillGoalException("No neighbour will bring new discoveries!");
  2290. auto best = dstToRevealedTiles.begin();
  2291. for (auto i = dstToRevealedTiles.begin(); i != dstToRevealedTiles.end(); i++)
  2292. {
  2293. const CGPathNode *pn = cb->getPathsInfo(h.get())->getPathInfo(i->first);
  2294. //const TerrainTile *t = cb->getTile(i->first);
  2295. if(best->second < i->second && pn->reachable() && pn->accessible == CGPathNode::ACCESSIBLE)
  2296. best = i;
  2297. }
  2298. if(best->second)
  2299. return best->first;
  2300. throw cannotFulfillGoalException("No neighbour will bring new discoveries!");
  2301. }
  2302. int3 VCAI::explorationNewPoint(HeroPtr h)
  2303. {
  2304. int radius = h->getSightRadius();
  2305. CCallback * cbp = cb.get();
  2306. const CGHeroInstance * hero = h.get();
  2307. std::vector<std::vector<int3> > tiles; //tiles[distance_to_fow]
  2308. tiles.resize(radius);
  2309. foreach_tile_pos([&](const int3 &pos)
  2310. {
  2311. if(!cbp->isVisible(pos))
  2312. tiles[0].push_back(pos);
  2313. });
  2314. float bestValue = 0; //discovered tile to node distance ratio
  2315. int3 bestTile(-1,-1,-1);
  2316. int3 ourPos = h->convertPosition(h->pos, false);
  2317. for (int i = 1; i < radius; i++)
  2318. {
  2319. getVisibleNeighbours(tiles[i-1], tiles[i]);
  2320. vstd::removeDuplicates(tiles[i]);
  2321. for(const int3 &tile : tiles[i])
  2322. {
  2323. if (tile == ourPos) //shouldn't happen, but it does
  2324. continue;
  2325. if (!cb->getPathsInfo(hero)->getPathInfo(tile)->reachable()) //this will remove tiles that are guarded by monsters (or removable objects)
  2326. continue;
  2327. CGPath path;
  2328. cb->getPathsInfo(hero)->getPath(path, tile);
  2329. float ourValue = (float)howManyTilesWillBeDiscovered(tile, radius, cbp) / (path.nodes.size() + 1); //+1 prevents erratic jumps
  2330. if (ourValue > bestValue) //avoid costly checks of tiles that don't reveal much
  2331. {
  2332. if(isSafeToVisit(h, tile))
  2333. {
  2334. if (isBlockVisitObj(tile)) //we can't stand on that object
  2335. continue;
  2336. bestTile = tile;
  2337. bestValue = ourValue;
  2338. }
  2339. }
  2340. }
  2341. }
  2342. return bestTile;
  2343. }
  2344. int3 VCAI::explorationDesperate(HeroPtr h)
  2345. {
  2346. auto sm = getCachedSectorMap(h);
  2347. int radius = h->getSightRadius();
  2348. std::vector<std::vector<int3> > tiles; //tiles[distance_to_fow]
  2349. tiles.resize(radius);
  2350. CCallback * cbp = cb.get();
  2351. foreach_tile_pos([&](const int3 &pos)
  2352. {
  2353. if(!cbp->isVisible(pos))
  2354. tiles[0].push_back(pos);
  2355. });
  2356. ui64 lowestDanger = -1;
  2357. int3 bestTile(-1,-1,-1);
  2358. for(int i = 1; i < radius; i++)
  2359. {
  2360. getVisibleNeighbours(tiles[i-1], tiles[i]);
  2361. vstd::removeDuplicates(tiles[i]);
  2362. for(const int3 &tile : tiles[i])
  2363. {
  2364. if (cbp->getTile(tile)->blocked) //does it shorten the time?
  2365. continue;
  2366. if (!howManyTilesWillBeDiscovered(tile, radius, cbp)) //avoid costly checks of tiles that don't reveal much
  2367. continue;
  2368. auto t = sm->firstTileToGet(h, tile);
  2369. if (t.valid())
  2370. {
  2371. ui64 ourDanger = evaluateDanger(t, h.h);
  2372. if (ourDanger < lowestDanger)
  2373. {
  2374. if(!isBlockVisitObj(t))
  2375. {
  2376. if (!ourDanger) //at least one safe place found
  2377. return t;
  2378. bestTile = t;
  2379. lowestDanger = ourDanger;
  2380. }
  2381. }
  2382. }
  2383. }
  2384. }
  2385. return bestTile;
  2386. }
  2387. TResources VCAI::estimateIncome() const
  2388. {
  2389. TResources ret;
  2390. for(const CGTownInstance *t : cb->getTownsInfo())
  2391. {
  2392. ret += t->dailyIncome();
  2393. }
  2394. for(const CGObjectInstance *obj : getFlaggedObjects())
  2395. {
  2396. if(obj->ID == Obj::MINE)
  2397. {
  2398. switch(obj->subID)
  2399. {
  2400. case Res::WOOD:
  2401. case Res::ORE:
  2402. ret[obj->subID] += WOOD_ORE_MINE_PRODUCTION;
  2403. break;
  2404. case Res::GOLD:
  2405. case 7: //abandoned mine -> also gold
  2406. ret[Res::GOLD] += GOLD_MINE_PRODUCTION;
  2407. break;
  2408. default:
  2409. ret[obj->subID] += RESOURCE_MINE_PRODUCTION;
  2410. break;
  2411. }
  2412. }
  2413. }
  2414. return ret;
  2415. }
  2416. bool VCAI::containsSavedRes(const TResources &cost) const
  2417. {
  2418. for (int i = 0; i < GameConstants::RESOURCE_QUANTITY; i++)
  2419. {
  2420. if(saving[i] && cost[i])
  2421. return true;
  2422. }
  2423. return false;
  2424. }
  2425. void VCAI::checkHeroArmy (HeroPtr h)
  2426. {
  2427. auto it = lockedHeroes.find(h);
  2428. if (it != lockedHeroes.end())
  2429. {
  2430. if (it->second->goalType == Goals::GATHER_ARMY && it->second->value <= h->getArmyStrength())
  2431. completeGoal(sptr(Goals::GatherArmy(it->second->value).sethero(h)));
  2432. }
  2433. }
  2434. void VCAI::recruitHero(const CGTownInstance * t, bool throwing)
  2435. {
  2436. logAi->debug("Trying to recruit a hero in %s at %s", t->name, t->visitablePos().toString());
  2437. auto heroes = cb->getAvailableHeroes(t);
  2438. if(heroes.size())
  2439. {
  2440. auto hero = heroes[0];
  2441. if (heroes.size() >= 2) //makes sense to recruit two heroes with starting amries in first week
  2442. {
  2443. if (heroes[1]->getTotalStrength() > hero->getTotalStrength())
  2444. hero = heroes[1];
  2445. }
  2446. cb->recruitHero(t, hero);
  2447. }
  2448. else if(throwing)
  2449. throw cannotFulfillGoalException("No available heroes in tavern in " + t->nodeName());
  2450. }
  2451. void VCAI::finish()
  2452. {
  2453. if(makingTurn)
  2454. {
  2455. makingTurn->interrupt();
  2456. makingTurn->join();
  2457. makingTurn.reset();
  2458. }
  2459. }
  2460. void VCAI::requestActionASAP(std::function<void()> whatToDo)
  2461. {
  2462. boost::thread newThread([this,whatToDo]()
  2463. {
  2464. setThreadName("VCAI::requestActionASAP::whatToDo");
  2465. SET_GLOBAL_STATE(this);
  2466. boost::shared_lock<boost::shared_mutex> gsLock(CGameState::mutex);
  2467. whatToDo();
  2468. });
  2469. }
  2470. void VCAI::lostHero(HeroPtr h)
  2471. {
  2472. logAi->debug("I lost my hero %s. It's best to forget and move on.", h.name);
  2473. vstd::erase_if_present(lockedHeroes, h);
  2474. for(auto obj : reservedHeroesMap[h])
  2475. {
  2476. vstd::erase_if_present(reservedObjs, obj); //unreserve all objects for that hero
  2477. }
  2478. vstd::erase_if_present(reservedHeroesMap, h);
  2479. vstd::erase_if_present(cachedSectorMaps, h);
  2480. }
  2481. void VCAI::answerQuery(QueryID queryID, int selection)
  2482. {
  2483. logAi->debug("I'll answer the query %d giving the choice %d", queryID, selection);
  2484. if(queryID != QueryID(-1))
  2485. {
  2486. cb->selectionMade(selection, queryID);
  2487. }
  2488. else
  2489. {
  2490. logAi->debug("Since the query ID is %d, the answer won't be sent. This is not a real query!", queryID);
  2491. //do nothing
  2492. }
  2493. }
  2494. void VCAI::requestSent(const CPackForServer *pack, int requestID)
  2495. {
  2496. //BNLOG("I have sent request of type %s", typeid(*pack).name());
  2497. if(auto reply = dynamic_cast<const QueryReply*>(pack))
  2498. {
  2499. status.attemptedAnsweringQuery(reply->qid, requestID);
  2500. }
  2501. }
  2502. std::string VCAI::getBattleAIName() const
  2503. {
  2504. if(settings["server"]["enemyAI"].getType() == JsonNode::DATA_STRING)
  2505. return settings["server"]["enemyAI"].String();
  2506. else
  2507. return "BattleAI";
  2508. }
  2509. void VCAI::validateObject(const CGObjectInstance *obj)
  2510. {
  2511. validateObject(obj->id);
  2512. }
  2513. void VCAI::validateObject(ObjectIdRef obj)
  2514. {
  2515. auto matchesId = [&](const CGObjectInstance *hlpObj) -> bool { return hlpObj->id == obj.id; };
  2516. if(!obj)
  2517. {
  2518. vstd::erase_if(visitableObjs, matchesId);
  2519. for(auto &p : reservedHeroesMap)
  2520. vstd::erase_if(p.second, matchesId);
  2521. vstd::erase_if(reservedObjs, matchesId);
  2522. }
  2523. }
  2524. TResources VCAI::freeResources() const
  2525. {
  2526. TResources myRes = cb->getResourceAmount();
  2527. auto iterator = cb->getTownsInfo();
  2528. if(std::none_of(iterator.begin(), iterator.end(), [](const CGTownInstance * x)->bool
  2529. {
  2530. return x->builtBuildings.find(BuildingID::CAPITOL) != x->builtBuildings.end();
  2531. })
  2532. /*|| std::all_of(iterator.begin(), iterator.end(), [](const CGTownInstance * x) -> bool { return x->forbiddenBuildings.find(BuildingID::CAPITOL) != x->forbiddenBuildings.end(); })*/ )
  2533. myRes[Res::GOLD] -= GOLD_RESERVE; //what if capitol is blocked from building in all possessed towns (set in map editor)? What about reserve for city hall or something similar in that case?
  2534. vstd::amax(myRes[Res::GOLD], 0);
  2535. return myRes;
  2536. }
  2537. std::shared_ptr<SectorMap> VCAI::getCachedSectorMap(HeroPtr h)
  2538. {
  2539. auto it = cachedSectorMaps.find(h);
  2540. if (it != cachedSectorMaps.end())
  2541. return it->second;
  2542. else
  2543. {
  2544. cachedSectorMaps[h] = std::make_shared<SectorMap>(h);
  2545. return cachedSectorMaps[h];
  2546. }
  2547. }
  2548. AIStatus::AIStatus()
  2549. {
  2550. battle = NO_BATTLE;
  2551. havingTurn = false;
  2552. ongoingHeroMovement = false;
  2553. ongoingChannelProbing = false;
  2554. }
  2555. AIStatus::~AIStatus()
  2556. {
  2557. }
  2558. void AIStatus::setBattle(BattleState BS)
  2559. {
  2560. boost::unique_lock<boost::mutex> lock(mx);
  2561. LOG_TRACE_PARAMS(logAi, "battle state=%d", (int)BS);
  2562. battle = BS;
  2563. cv.notify_all();
  2564. }
  2565. BattleState AIStatus::getBattle()
  2566. {
  2567. boost::unique_lock<boost::mutex> lock(mx);
  2568. return battle;
  2569. }
  2570. void AIStatus::addQuery(QueryID ID, std::string description)
  2571. {
  2572. if(ID == QueryID(-1))
  2573. {
  2574. logAi->debug("The \"query\" has an id %d, it'll be ignored as non-query. Description: %s", ID, description);
  2575. return;
  2576. }
  2577. assert(ID.getNum() >= 0);
  2578. boost::unique_lock<boost::mutex> lock(mx);
  2579. assert(!vstd::contains(remainingQueries, ID));
  2580. remainingQueries[ID] = description;
  2581. cv.notify_all();
  2582. logAi->debug("Adding query %d - %s. Total queries count: %d", ID, description, remainingQueries.size());
  2583. }
  2584. void AIStatus::removeQuery(QueryID ID)
  2585. {
  2586. boost::unique_lock<boost::mutex> lock(mx);
  2587. assert(vstd::contains(remainingQueries, ID));
  2588. std::string description = remainingQueries[ID];
  2589. remainingQueries.erase(ID);
  2590. cv.notify_all();
  2591. logAi->debug("Removing query %d - %s. Total queries count: %d", ID,description , remainingQueries.size());
  2592. }
  2593. int AIStatus::getQueriesCount()
  2594. {
  2595. boost::unique_lock<boost::mutex> lock(mx);
  2596. return remainingQueries.size();
  2597. }
  2598. void AIStatus::startedTurn()
  2599. {
  2600. boost::unique_lock<boost::mutex> lock(mx);
  2601. havingTurn = true;
  2602. cv.notify_all();
  2603. }
  2604. void AIStatus::madeTurn()
  2605. {
  2606. boost::unique_lock<boost::mutex> lock(mx);
  2607. havingTurn = false;
  2608. cv.notify_all();
  2609. }
  2610. void AIStatus::waitTillFree()
  2611. {
  2612. boost::unique_lock<boost::mutex> lock(mx);
  2613. while(battle != NO_BATTLE || !remainingQueries.empty() || !objectsBeingVisited.empty() || ongoingHeroMovement)
  2614. cv.timed_wait(lock, boost::posix_time::milliseconds(100));
  2615. }
  2616. bool AIStatus::haveTurn()
  2617. {
  2618. boost::unique_lock<boost::mutex> lock(mx);
  2619. return havingTurn;
  2620. }
  2621. void AIStatus::attemptedAnsweringQuery(QueryID queryID, int answerRequestID)
  2622. {
  2623. boost::unique_lock<boost::mutex> lock(mx);
  2624. assert(vstd::contains(remainingQueries, queryID));
  2625. std::string description = remainingQueries[queryID];
  2626. logAi->debug("Attempted answering query %d - %s. Request id=%d. Waiting for results...", queryID, description, answerRequestID);
  2627. requestToQueryID[answerRequestID] = queryID;
  2628. }
  2629. void AIStatus::receivedAnswerConfirmation(int answerRequestID, int result)
  2630. {
  2631. assert(vstd::contains(requestToQueryID, answerRequestID));
  2632. QueryID query = requestToQueryID[answerRequestID];
  2633. assert(vstd::contains(remainingQueries, query));
  2634. requestToQueryID.erase(answerRequestID);
  2635. if(result)
  2636. {
  2637. removeQuery(query);
  2638. }
  2639. else
  2640. {
  2641. logAi->error("Something went really wrong, failed to answer query %d : %s", query.getNum(), remainingQueries[query]);
  2642. //TODO safely retry
  2643. }
  2644. }
  2645. void AIStatus::heroVisit(const CGObjectInstance *obj, bool started)
  2646. {
  2647. boost::unique_lock<boost::mutex> lock(mx);
  2648. if(started)
  2649. objectsBeingVisited.push_back(obj);
  2650. else
  2651. {
  2652. // There can be more than one object visited at the time (eg. hero visits Subterranean Gate
  2653. // causing visit to hero on the other side.
  2654. // However, we are guaranteed that start/end visit notification maintain stack order.
  2655. assert(!objectsBeingVisited.empty());
  2656. objectsBeingVisited.pop_back();
  2657. }
  2658. cv.notify_all();
  2659. }
  2660. void AIStatus::setMove(bool ongoing)
  2661. {
  2662. boost::unique_lock<boost::mutex> lock(mx);
  2663. ongoingHeroMovement = ongoing;
  2664. cv.notify_all();
  2665. }
  2666. void AIStatus::setChannelProbing(bool ongoing)
  2667. {
  2668. boost::unique_lock<boost::mutex> lock(mx);
  2669. ongoingChannelProbing = ongoing;
  2670. cv.notify_all();
  2671. }
  2672. bool AIStatus::channelProbing()
  2673. {
  2674. return ongoingChannelProbing;
  2675. }
  2676. SectorMap::SectorMap()
  2677. {
  2678. update();
  2679. }
  2680. SectorMap::SectorMap(HeroPtr h)
  2681. {
  2682. update();
  2683. makeParentBFS(h->visitablePos());
  2684. }
  2685. bool SectorMap::markIfBlocked(TSectorID &sec, crint3 pos, const TerrainTile *t)
  2686. {
  2687. if(t->blocked && !t->visitable)
  2688. {
  2689. sec = NOT_AVAILABLE;
  2690. return true;
  2691. }
  2692. return false;
  2693. }
  2694. bool SectorMap::markIfBlocked(TSectorID &sec, crint3 pos)
  2695. {
  2696. return markIfBlocked(sec, pos, getTile(pos));
  2697. }
  2698. void SectorMap::update()
  2699. {
  2700. visibleTiles = cb->getAllVisibleTiles();
  2701. auto shape = visibleTiles->shape();
  2702. sector.resize(boost::extents[shape[0]][shape[1]][shape[2]]);
  2703. clear();
  2704. int curSector = 3; //0 is invisible, 1 is not explored
  2705. CCallback * cbp = cb.get(); //optimization
  2706. foreach_tile_pos([&](crint3 pos)
  2707. {
  2708. if(retreiveTile(pos) == NOT_CHECKED)
  2709. {
  2710. if(!markIfBlocked(retreiveTile(pos), pos))
  2711. exploreNewSector(pos, curSector++, cbp);
  2712. }
  2713. });
  2714. valid = true;
  2715. }
  2716. SectorMap::TSectorID &SectorMap::retreiveTileN(SectorMap::TSectorArray &a, const int3 &pos)
  2717. {
  2718. return a[pos.x][pos.y][pos.z];
  2719. }
  2720. const SectorMap::TSectorID &SectorMap::retreiveTileN(const SectorMap::TSectorArray &a, const int3 &pos)
  2721. {
  2722. return a[pos.x][pos.y][pos.z];
  2723. }
  2724. void SectorMap::clear()
  2725. {
  2726. //TODO: rotate to [z][x][y]
  2727. auto fow = cb->getVisibilityMap();
  2728. //TODO: any magic to automate this? will need array->array conversion
  2729. //std::transform(fow.begin(), fow.end(), sector.begin(), [](const ui8 &f) -> unsigned short
  2730. //{
  2731. // return f; //type conversion
  2732. //});
  2733. auto width = fow.size();
  2734. auto height = fow.front().size();
  2735. auto depth = fow.front().front().size();
  2736. for (size_t x = 0; x < width; x++)
  2737. for (size_t y = 0; y < height; y++ )
  2738. for (size_t z = 0; z < depth; z++)
  2739. sector[x][y][z] = fow[x][y][z];
  2740. valid = false;
  2741. }
  2742. void SectorMap::exploreNewSector(crint3 pos, int num, CCallback * cbp)
  2743. {
  2744. Sector &s = infoOnSectors[num];
  2745. s.id = num;
  2746. s.water = getTile(pos)->isWater();
  2747. std::queue<int3> toVisit;
  2748. toVisit.push(pos);
  2749. while(!toVisit.empty())
  2750. {
  2751. int3 curPos = toVisit.front();
  2752. toVisit.pop();
  2753. TSectorID &sec = retreiveTile(curPos);
  2754. if(sec == NOT_CHECKED)
  2755. {
  2756. const TerrainTile *t = getTile(curPos);
  2757. if(!markIfBlocked(sec, curPos, t))
  2758. {
  2759. if(t->isWater() == s.water) //sector is only-water or only-land
  2760. {
  2761. sec = num;
  2762. s.tiles.push_back(curPos);
  2763. foreach_neighbour(cbp, curPos, [&](CCallback * cbp, crint3 neighPos)
  2764. {
  2765. if(retreiveTile(neighPos) == NOT_CHECKED)
  2766. {
  2767. toVisit.push(neighPos);
  2768. //parent[neighPos] = curPos;
  2769. }
  2770. const TerrainTile *nt = getTile(neighPos);
  2771. if(nt && nt->isWater() != s.water && canBeEmbarkmentPoint(nt, s.water))
  2772. {
  2773. s.embarkmentPoints.push_back(neighPos);
  2774. }
  2775. });
  2776. if(t->visitable)
  2777. {
  2778. auto obj = t->visitableObjects.front();
  2779. if(cb->getObj(obj->id, false)) // FIXME: we have to filter invisible objcts like events, but probably TerrainTile shouldn't be used in SectorMap at all
  2780. s.visitableObjs.push_back(obj);
  2781. }
  2782. }
  2783. }
  2784. }
  2785. }
  2786. vstd::removeDuplicates(s.embarkmentPoints);
  2787. }
  2788. void SectorMap::write(crstring fname)
  2789. {
  2790. std::ofstream out(fname);
  2791. for(int k = 0; k < cb->getMapSize().z; k++)
  2792. {
  2793. for(int j = 0; j < cb->getMapSize().y; j++)
  2794. {
  2795. for(int i = 0; i < cb->getMapSize().x; i++)
  2796. {
  2797. out << (int)sector[i][j][k] << '\t';
  2798. }
  2799. out << std::endl;
  2800. }
  2801. out << std::endl;
  2802. }
  2803. }
  2804. bool isWeeklyRevisitable (const CGObjectInstance * obj)
  2805. { //TODO: allow polling of remaining creatures in dwelling
  2806. if (dynamic_cast<const CGVisitableOPW *>(obj) || //ensures future compatibility, unlike IDs
  2807. dynamic_cast<const CGDwelling *>(obj) ||
  2808. dynamic_cast<const CBank *>(obj)) //banks tend to respawn often in mods
  2809. return true;
  2810. switch (obj->ID)
  2811. {
  2812. case Obj::STABLES:
  2813. case Obj::MAGIC_WELL:
  2814. case Obj::HILL_FORT:
  2815. return true;
  2816. case Obj::BORDER_GATE:
  2817. case Obj::BORDERGUARD:
  2818. return (dynamic_cast <const CGKeys *>(obj))->wasMyColorVisited (ai->playerID); //FIXME: they could be revisited sooner than in a week
  2819. }
  2820. return false;
  2821. }
  2822. bool shouldVisit(HeroPtr h, const CGObjectInstance * obj)
  2823. {
  2824. switch (obj->ID)
  2825. {
  2826. case Obj::TOWN:
  2827. case Obj::HERO: //never visit our heroes at random
  2828. return obj->tempOwner != h->tempOwner; //do not visit our towns at random
  2829. break;
  2830. case Obj::BORDER_GATE:
  2831. {
  2832. for (auto q : ai->myCb->getMyQuests())
  2833. {
  2834. if (q.obj == obj)
  2835. {
  2836. return false; // do not visit guards or gates when wandering
  2837. }
  2838. }
  2839. return true; //we don't have this quest yet
  2840. }
  2841. break;
  2842. case Obj::BORDERGUARD: //open borderguard if possible
  2843. return (dynamic_cast <const CGKeys *>(obj))->wasMyColorVisited(ai->playerID);
  2844. case Obj::SEER_HUT:
  2845. case Obj::QUEST_GUARD:
  2846. {
  2847. for (auto q : ai->myCb->getMyQuests())
  2848. {
  2849. if (q.obj == obj)
  2850. {
  2851. if (q.quest->checkQuest(h.h))
  2852. return true; //we completed the quest
  2853. else
  2854. return false; //we can't complete this quest
  2855. }
  2856. }
  2857. return true; //we don't have this quest yet
  2858. }
  2859. break;
  2860. case Obj::CREATURE_GENERATOR1:
  2861. {
  2862. if (obj->tempOwner != h->tempOwner)
  2863. return true; //flag just in case
  2864. bool canRecruitCreatures = false;
  2865. const CGDwelling * d = dynamic_cast<const CGDwelling *>(obj);
  2866. for(auto level : d->creatures)
  2867. {
  2868. for(auto c : level.second)
  2869. {
  2870. if (h->getSlotFor(CreatureID(c)) != SlotID())
  2871. canRecruitCreatures = true;
  2872. }
  2873. }
  2874. return canRecruitCreatures;
  2875. }
  2876. case Obj::HILL_FORT:
  2877. {
  2878. for (auto slot : h->Slots())
  2879. {
  2880. if (slot.second->type->upgrades.size())
  2881. return true; //TODO: check price?
  2882. }
  2883. return false;
  2884. }
  2885. case Obj::MONOLITH_ONE_WAY_ENTRANCE:
  2886. case Obj::MONOLITH_ONE_WAY_EXIT:
  2887. case Obj::MONOLITH_TWO_WAY:
  2888. case Obj::WHIRLPOOL:
  2889. return false;
  2890. case Obj::SCHOOL_OF_MAGIC:
  2891. case Obj::SCHOOL_OF_WAR:
  2892. {
  2893. TResources myRes = ai->myCb->getResourceAmount();
  2894. if (myRes[Res::GOLD] - GOLD_RESERVE < 1000)
  2895. return false;
  2896. }
  2897. break;
  2898. case Obj::LIBRARY_OF_ENLIGHTENMENT:
  2899. if (h->level < 12)
  2900. return false;
  2901. break;
  2902. case Obj::TREE_OF_KNOWLEDGE:
  2903. {
  2904. TResources myRes = ai->myCb->getResourceAmount();
  2905. if (myRes[Res::GOLD] - GOLD_RESERVE < 2000 || myRes[Res::GEMS] < 10)
  2906. return false;
  2907. }
  2908. break;
  2909. case Obj::MAGIC_WELL:
  2910. return h->mana < h->manaLimit();
  2911. case Obj::PRISON:
  2912. return ai->myCb->getHeroesInfo().size() < VLC->modh->settings.MAX_HEROES_ON_MAP_PER_PLAYER;
  2913. case Obj::TAVERN:
  2914. {//TODO: make AI actually recruit heroes
  2915. //TODO: only on request
  2916. if ((ai->myCb->getHeroesInfo().size() >= VLC->modh->settings.MAX_HEROES_ON_MAP_PER_PLAYER) ||
  2917. (ai->myCb->getResourceAmount()[Res::GOLD] - GOLD_RESERVE < GameConstants::HERO_GOLD_COST))
  2918. return false;
  2919. }
  2920. case Obj::BOAT:
  2921. return false;
  2922. //Boats are handled by pathfinder
  2923. case Obj::EYE_OF_MAGI:
  2924. return false; //this object is useless to visit, but could be visited indefinitely
  2925. }
  2926. if (obj->wasVisited(*h)) //it must pointer to hero instance, heroPtr calls function wasVisited(ui8 player);
  2927. return false;
  2928. return true;
  2929. }
  2930. int3 SectorMap::firstTileToGet(HeroPtr h, crint3 dst)
  2931. /*
  2932. this functions returns one target tile or invalid tile. We will use it to poll possible destinations
  2933. For ship construction etc, another function (goal?) is needed
  2934. */
  2935. {
  2936. int3 ret(-1,-1,-1);
  2937. int sourceSector = retreiveTile(h->visitablePos()),
  2938. destinationSector = retreiveTile(dst);
  2939. const Sector *src = &infoOnSectors[sourceSector],
  2940. *dest = &infoOnSectors[destinationSector];
  2941. if(sourceSector != destinationSector) //use ships, shipyards etc..
  2942. {
  2943. if (ai->isAccessibleForHero(dst, h)) //pathfinder can find a way using ships and gates if tile is not blocked by objects
  2944. return dst;
  2945. std::map<const Sector*, const Sector*> preds;
  2946. std::queue<const Sector *> sectorQueue;
  2947. sectorQueue.push(src);
  2948. while(!sectorQueue.empty())
  2949. {
  2950. const Sector *s = sectorQueue.front();
  2951. sectorQueue.pop();
  2952. for(int3 ep : s->embarkmentPoints)
  2953. {
  2954. Sector *neigh = &infoOnSectors[retreiveTile(ep)];
  2955. //preds[s].push_back(neigh);
  2956. if(!preds[neigh])
  2957. {
  2958. preds[neigh] = s;
  2959. sectorQueue.push(neigh);
  2960. }
  2961. }
  2962. }
  2963. if(!preds[dest])
  2964. {
  2965. //write("test.txt");
  2966. return ret;
  2967. //throw cannotFulfillGoalException(boost::str(boost::format("Cannot find connection between sectors %d and %d") % src->id % dst->id));
  2968. }
  2969. std::vector<const Sector*> toTraverse;
  2970. toTraverse.push_back(dest);
  2971. while(toTraverse.back() != src)
  2972. {
  2973. toTraverse.push_back(preds[toTraverse.back()]);
  2974. }
  2975. if(preds[dest])
  2976. {
  2977. //TODO: would be nice to find sectors in loop
  2978. const Sector *sectorToReach = toTraverse.at(toTraverse.size() - 2);
  2979. if(!src->water && sectorToReach->water) //embark
  2980. {
  2981. //embark on ship -> look for an EP with a boat
  2982. auto firstEP = boost::find_if(src->embarkmentPoints, [=](crint3 pos) -> bool
  2983. {
  2984. const TerrainTile *t = getTile(pos);
  2985. return t && t->visitableObjects.size() == 1 && t->topVisitableId() == Obj::BOAT
  2986. && retreiveTile(pos) == sectorToReach->id;
  2987. });
  2988. if(firstEP != src->embarkmentPoints.end())
  2989. {
  2990. return *firstEP;
  2991. }
  2992. else
  2993. {
  2994. //we need to find a shipyard with an access to the desired sector's EP
  2995. //TODO what about Summon Boat spell?
  2996. std::vector<const IShipyard *> shipyards;
  2997. for(const CGTownInstance *t : cb->getTownsInfo())
  2998. {
  2999. if(t->hasBuilt(BuildingID::SHIPYARD))
  3000. shipyards.push_back(t);
  3001. }
  3002. for(const CGObjectInstance *obj : ai->getFlaggedObjects())
  3003. {
  3004. if(obj->ID != Obj::TOWN) //towns were handled in the previous loop
  3005. if(const IShipyard *shipyard = IShipyard::castFrom(obj))
  3006. shipyards.push_back(shipyard);
  3007. }
  3008. shipyards.erase(boost::remove_if(shipyards, [=](const IShipyard *shipyard) -> bool
  3009. {
  3010. return shipyard->shipyardStatus() != 0 || retreiveTile(shipyard->bestLocation()) != sectorToReach->id;
  3011. }),shipyards.end());
  3012. if(!shipyards.size())
  3013. {
  3014. //TODO consider possibility of building shipyard in a town
  3015. return ret;
  3016. //throw cannotFulfillGoalException("There is no known shipyard!");
  3017. }
  3018. //we have only shipyards that possibly can build ships onto the appropriate EP
  3019. auto ownedGoodShipyard = boost::find_if(shipyards, [](const IShipyard *s) -> bool
  3020. {
  3021. return s->o->tempOwner == ai->playerID;
  3022. });
  3023. if(ownedGoodShipyard != shipyards.end())
  3024. {
  3025. const IShipyard *s = *ownedGoodShipyard;
  3026. TResources shipCost;
  3027. s->getBoatCost(shipCost);
  3028. if(cb->getResourceAmount().canAfford(shipCost))
  3029. {
  3030. int3 ret = s->bestLocation();
  3031. cb->buildBoat(s); //TODO: move actions elsewhere
  3032. return ret;
  3033. }
  3034. else
  3035. {
  3036. //TODO gather res
  3037. return ret;
  3038. //throw cannotFulfillGoalException("Not enough resources to build a boat");
  3039. }
  3040. }
  3041. else
  3042. {
  3043. //TODO pick best shipyard to take over
  3044. return shipyards.front()->o->visitablePos();
  3045. }
  3046. }
  3047. }
  3048. else if(src->water && !sectorToReach->water)
  3049. {
  3050. //TODO
  3051. //disembark
  3052. return ret;
  3053. }
  3054. else //use subterranean gates - not needed since gates are now handled via Pathfinder
  3055. {
  3056. return ret;
  3057. //throw cannotFulfillGoalException("Land-land and water-water inter-sector transitions are not implemented!");
  3058. }
  3059. }
  3060. else
  3061. {
  3062. return ret;
  3063. //throw cannotFulfillGoalException("Inter-sector route detection failed: not connected sectors?");
  3064. }
  3065. }
  3066. else
  3067. {
  3068. return findFirstVisitableTile(h, dst);
  3069. }
  3070. }
  3071. int3 SectorMap::findFirstVisitableTile (HeroPtr h, crint3 dst)
  3072. {
  3073. int3 ret(-1,-1,-1);
  3074. int3 curtile = dst;
  3075. while(curtile != h->visitablePos())
  3076. {
  3077. auto topObj = cb->getTopObj(curtile);
  3078. if(topObj && topObj->ID == Obj::HERO && topObj != h.h &&
  3079. cb->getPlayerRelations(h->tempOwner, topObj->tempOwner) != PlayerRelations::ENEMIES)
  3080. {
  3081. logAi->warn("Another allied hero stands in our way");
  3082. return ret;
  3083. }
  3084. if(ai->myCb->getPathsInfo(h.get())->getPathInfo(curtile)->reachable())
  3085. {
  3086. return curtile;
  3087. }
  3088. else
  3089. {
  3090. auto i = parent.find(curtile);
  3091. if(i != parent.end())
  3092. {
  3093. assert(curtile != i->second);
  3094. curtile = i->second;
  3095. }
  3096. else
  3097. {
  3098. return ret;
  3099. //throw cannotFulfillGoalException("Unreachable tile in sector? Should not happen!");
  3100. }
  3101. }
  3102. }
  3103. return ret;
  3104. }
  3105. void SectorMap::makeParentBFS(crint3 source)
  3106. {
  3107. parent.clear();
  3108. int mySector = retreiveTile(source);
  3109. std::queue<int3> toVisit;
  3110. toVisit.push(source);
  3111. while(!toVisit.empty())
  3112. {
  3113. int3 curPos = toVisit.front();
  3114. toVisit.pop();
  3115. TSectorID &sec = retreiveTile(curPos);
  3116. assert(sec == mySector); //consider only tiles from the same sector
  3117. UNUSED(sec);
  3118. foreach_neighbour(curPos, [&](crint3 neighPos)
  3119. {
  3120. if(retreiveTile(neighPos) == mySector && !vstd::contains(parent, neighPos))
  3121. {
  3122. if (cb->canMoveBetween(curPos, neighPos))
  3123. {
  3124. toVisit.push(neighPos);
  3125. parent[neighPos] = curPos;
  3126. }
  3127. }
  3128. });
  3129. }
  3130. }
  3131. SectorMap::TSectorID & SectorMap::retreiveTile(crint3 pos)
  3132. {
  3133. return retreiveTileN(sector, pos);
  3134. }
  3135. TerrainTile* SectorMap::getTile(crint3 pos) const
  3136. {
  3137. //out of bounds access should be handled by boost::multi_array
  3138. //still we cached this array to avoid any checks
  3139. return visibleTiles->operator[](pos.x)[pos.y][pos.z];
  3140. }
  3141. std::vector<const CGObjectInstance *> SectorMap::getNearbyObjs(HeroPtr h, bool sectorsAround)
  3142. {
  3143. const Sector *heroSector = &infoOnSectors[retreiveTile(h->visitablePos())];
  3144. if(sectorsAround)
  3145. {
  3146. std::vector<const CGObjectInstance *> ret;
  3147. for(auto embarkPoint : heroSector->embarkmentPoints)
  3148. {
  3149. const Sector *embarkSector = &infoOnSectors[retreiveTile(embarkPoint)];
  3150. range::copy(embarkSector->visitableObjs, std::back_inserter(ret));
  3151. }
  3152. return ret;
  3153. }
  3154. return heroSector->visitableObjs;
  3155. }