CGameState.cpp 91 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289
  1. #include "StdInc.h"
  2. #include "CGameState.h"
  3. #include <boost/random/linear_congruential.hpp>
  4. #include "Mapping/CCampaignHandler.h"
  5. #include "CDefObjInfoHandler.h"
  6. #include "CArtHandler.h"
  7. #include "CBuildingHandler.h"
  8. #include "CGeneralTextHandler.h"
  9. #include "CTownHandler.h"
  10. #include "CSpellHandler.h"
  11. #include "CHeroHandler.h"
  12. #include "CObjectHandler.h"
  13. #include "CCreatureHandler.h"
  14. #include "CModHandler.h"
  15. #include "VCMI_Lib.h"
  16. #include "Connection.h"
  17. #include "Mapping/CMap.h"
  18. #include "Mapping/CMapService.h"
  19. #include "StartInfo.h"
  20. #include "NetPacks.h"
  21. #include "RegisterTypes.h"
  22. #include "Mapping/CMapInfo.h"
  23. #include "BattleState.h"
  24. #include "JsonNode.h"
  25. #include "Filesystem/CResourceLoader.h"
  26. #include "GameConstants.h"
  27. #include "RMG/CMapGenOptions.h"
  28. #include "RMG/CMapGenerator.h"
  29. DLL_LINKAGE boost::rand48 ran;
  30. class CGObjectInstance;
  31. #ifdef min
  32. #undef min
  33. #endif
  34. #ifdef max
  35. #undef max
  36. #endif
  37. /*
  38. * CGameState.cpp, part of VCMI engine
  39. *
  40. * Authors: listed in file AUTHORS in main folder
  41. *
  42. * License: GNU General Public License v2.0 or later
  43. * Full text of license available in license.txt file, in main folder
  44. *
  45. */
  46. void foofoofoo()
  47. {
  48. //never called function to force instantation of templates
  49. int *ccc = NULL;
  50. registerTypes((CISer<CConnection>&)*ccc);
  51. registerTypes((COSer<CConnection>&)*ccc);
  52. registerTypes((CSaveFile&)*ccc);
  53. registerTypes((CLoadFile&)*ccc);
  54. registerTypes((CTypeList&)*ccc);
  55. }
  56. template <typename T> class CApplyOnGS;
  57. class CBaseForGSApply
  58. {
  59. public:
  60. virtual void applyOnGS(CGameState *gs, void *pack) const =0;
  61. virtual ~CBaseForGSApply(){};
  62. template<typename U> static CBaseForGSApply *getApplier(const U * t=NULL)
  63. {
  64. return new CApplyOnGS<U>;
  65. }
  66. };
  67. template <typename T> class CApplyOnGS : public CBaseForGSApply
  68. {
  69. public:
  70. void applyOnGS(CGameState *gs, void *pack) const
  71. {
  72. T *ptr = static_cast<T*>(pack);
  73. boost::unique_lock<boost::shared_mutex> lock(*gs->mx);
  74. ptr->applyGs(gs);
  75. }
  76. };
  77. static CApplier<CBaseForGSApply> *applierGs = NULL;
  78. class IObjectCaller
  79. {
  80. public:
  81. virtual ~IObjectCaller(){};
  82. virtual void preInit()=0;
  83. virtual void postInit()=0;
  84. };
  85. template <typename T>
  86. class CObjectCaller : public IObjectCaller
  87. {
  88. public:
  89. void preInit()
  90. {
  91. //T::preInit();
  92. }
  93. void postInit()
  94. {
  95. //T::postInit();
  96. }
  97. };
  98. class CObjectCallersHandler
  99. {
  100. public:
  101. std::vector<IObjectCaller*> apps;
  102. template<typename T> void registerType(const T * t=NULL)
  103. {
  104. apps.push_back(new CObjectCaller<T>);
  105. }
  106. CObjectCallersHandler()
  107. {
  108. registerTypes1(*this);
  109. }
  110. ~CObjectCallersHandler()
  111. {
  112. for (size_t i = 0; i < apps.size(); i++)
  113. delete apps[i];
  114. }
  115. void preInit()
  116. {
  117. // for (size_t i = 0; i < apps.size(); i++)
  118. // apps[i]->preInit();
  119. }
  120. void postInit()
  121. {
  122. //for (size_t i = 0; i < apps.size(); i++)
  123. //apps[i]->postInit();
  124. }
  125. } *objCaller = NULL;
  126. void MetaString::getLocalString(const std::pair<ui8,ui32> &txt, std::string &dst) const
  127. {
  128. int type = txt.first, ser = txt.second;
  129. if(type == ART_NAMES)
  130. {
  131. dst = VLC->arth->artifacts[ser]->Name();
  132. }
  133. else if(type == CRE_PL_NAMES)
  134. {
  135. dst = VLC->creh->creatures[ser]->namePl;
  136. }
  137. else if(type == MINE_NAMES)
  138. {
  139. dst = VLC->generaltexth->mines[ser].first;
  140. }
  141. else if(type == MINE_EVNTS)
  142. {
  143. dst = VLC->generaltexth->mines[ser].second;
  144. }
  145. else if(type == SPELL_NAME)
  146. {
  147. dst = VLC->spellh->spells[ser]->name;
  148. }
  149. else if(type == CRE_SING_NAMES)
  150. {
  151. dst = VLC->creh->creatures[ser]->nameSing;
  152. }
  153. else if(type == ART_DESCR)
  154. {
  155. dst = VLC->arth->artifacts[ser]->Description();
  156. }
  157. else if (type == ART_EVNTS)
  158. {
  159. dst = VLC->arth->artifacts[ser]->EventText();
  160. }
  161. else
  162. {
  163. std::vector<std::string> *vec;
  164. switch(type)
  165. {
  166. case GENERAL_TXT:
  167. vec = &VLC->generaltexth->allTexts;
  168. break;
  169. case XTRAINFO_TXT:
  170. vec = &VLC->generaltexth->xtrainfo;
  171. break;
  172. case OBJ_NAMES:
  173. vec = &VLC->generaltexth->names;
  174. break;
  175. case RES_NAMES:
  176. vec = &VLC->generaltexth->restypes;
  177. break;
  178. case ARRAY_TXT:
  179. vec = &VLC->generaltexth->arraytxt;
  180. break;
  181. case CREGENS:
  182. vec = &VLC->generaltexth->creGens;
  183. break;
  184. case CREGENS4:
  185. vec = &VLC->generaltexth->creGens4;
  186. break;
  187. case ADVOB_TXT:
  188. vec = &VLC->generaltexth->advobtxt;
  189. break;
  190. case SEC_SKILL_NAME:
  191. vec = &VLC->generaltexth->skillName;
  192. break;
  193. case COLOR:
  194. vec = &VLC->generaltexth->capColors;
  195. break;
  196. default:
  197. tlog1 << "Failed string substitution because type is " << type << std::endl;
  198. dst = "#@#";
  199. return;
  200. }
  201. if(vec->size() <= ser)
  202. {
  203. tlog1 << "Failed string substitution with type " << type << " because index " << ser << " is out of bounds!\n";
  204. dst = "#!#";
  205. }
  206. else
  207. dst = (*vec)[ser];
  208. }
  209. }
  210. DLL_LINKAGE void MetaString::toString(std::string &dst) const
  211. {
  212. size_t exSt = 0, loSt = 0, nums = 0;
  213. dst.clear();
  214. for(size_t i=0;i<message.size();++i)
  215. {//TEXACT_STRING, TLOCAL_STRING, TNUMBER, TREPLACE_ESTRING, TREPLACE_LSTRING, TREPLACE_NUMBER
  216. switch(message[i])
  217. {
  218. case TEXACT_STRING:
  219. dst += exactStrings[exSt++];
  220. break;
  221. case TLOCAL_STRING:
  222. {
  223. std::string hlp;
  224. getLocalString(localStrings[loSt++], hlp);
  225. dst += hlp;
  226. }
  227. break;
  228. case TNUMBER:
  229. dst += boost::lexical_cast<std::string>(numbers[nums++]);
  230. break;
  231. case TREPLACE_ESTRING:
  232. boost::replace_first(dst, "%s", exactStrings[exSt++]);
  233. break;
  234. case TREPLACE_LSTRING:
  235. {
  236. std::string hlp;
  237. getLocalString(localStrings[loSt++], hlp);
  238. boost::replace_first(dst, "%s", hlp);
  239. }
  240. break;
  241. case TREPLACE_NUMBER:
  242. boost::replace_first(dst, "%d", boost::lexical_cast<std::string>(numbers[nums++]));
  243. break;
  244. case TREPLACE_PLUSNUMBER:
  245. boost::replace_first(dst, "%+d", '+' + boost::lexical_cast<std::string>(numbers[nums++]));
  246. break;
  247. default:
  248. tlog1 << "MetaString processing error!\n";
  249. break;
  250. }
  251. }
  252. }
  253. DLL_LINKAGE std::string MetaString::toString() const
  254. {
  255. std::string ret;
  256. toString(ret);
  257. return ret;
  258. }
  259. DLL_LINKAGE std::string MetaString::buildList () const
  260. ///used to handle loot from creature bank
  261. {
  262. size_t exSt = 0, loSt = 0, nums = 0;
  263. std::string lista;
  264. for (int i = 0; i < message.size(); ++i)
  265. {
  266. if (i > 0 && (message[i] == TEXACT_STRING || message[i] == TLOCAL_STRING))
  267. {
  268. if (exSt == exactStrings.size() - 1)
  269. lista += VLC->generaltexth->allTexts[141]; //" and "
  270. else
  271. lista += ", ";
  272. }
  273. switch (message[i])
  274. {
  275. case TEXACT_STRING:
  276. lista += exactStrings[exSt++];
  277. break;
  278. case TLOCAL_STRING:
  279. {
  280. std::string hlp;
  281. getLocalString (localStrings[loSt++], hlp);
  282. lista += hlp;
  283. }
  284. break;
  285. case TNUMBER:
  286. lista += boost::lexical_cast<std::string>(numbers[nums++]);
  287. break;
  288. case TREPLACE_ESTRING:
  289. lista.replace (lista.find("%s"), 2, exactStrings[exSt++]);
  290. break;
  291. case TREPLACE_LSTRING:
  292. {
  293. std::string hlp;
  294. getLocalString (localStrings[loSt++], hlp);
  295. lista.replace (lista.find("%s"), 2, hlp);
  296. }
  297. break;
  298. case TREPLACE_NUMBER:
  299. lista.replace (lista.find("%d"), 2, boost::lexical_cast<std::string>(numbers[nums++]));
  300. break;
  301. default:
  302. tlog1 << "MetaString processing error!\n";
  303. }
  304. }
  305. return lista;
  306. }
  307. void MetaString::addCreReplacement(CreatureID id, TQuantity count) //adds sing or plural name;
  308. {
  309. if (!count)
  310. addReplacement (CRE_PL_NAMES, id); //no creatures - just empty name (eg. defeat Angels)
  311. else if (count == 1)
  312. addReplacement (CRE_SING_NAMES, id);
  313. else
  314. addReplacement (CRE_PL_NAMES, id);
  315. }
  316. void MetaString::addReplacement(const CStackBasicDescriptor &stack)
  317. {
  318. assert(stack.type); //valid type
  319. addCreReplacement(stack.type->idNumber, stack.count);
  320. }
  321. static CGObjectInstance * createObject(Obj id, int subid, int3 pos, int owner)
  322. {
  323. CGObjectInstance * nobj;
  324. switch(id)
  325. {
  326. case Obj::HERO:
  327. {
  328. CGHeroInstance * nobj = new CGHeroInstance();
  329. nobj->pos = pos;
  330. nobj->tempOwner = owner;
  331. nobj->subID = subid;
  332. //nobj->initHero(ran);
  333. return nobj;
  334. }
  335. case Obj::TOWN:
  336. nobj = new CGTownInstance;
  337. break;
  338. default: //rest of objects
  339. nobj = new CGObjectInstance;
  340. nobj->defInfo = id.toDefObjInfo()[subid];
  341. break;
  342. }
  343. nobj->ID = id;
  344. nobj->subID = subid;
  345. if(!nobj->defInfo)
  346. tlog3 <<"No def declaration for " <<id <<" "<<subid<<std::endl;
  347. nobj->pos = pos;
  348. //nobj->state = NULL;//new CLuaObjectScript();
  349. nobj->tempOwner = owner;
  350. nobj->defInfo->id = id;
  351. nobj->defInfo->subid = subid;
  352. //assigning defhandler
  353. if(nobj->ID==Obj::HERO || nobj->ID==Obj::TOWN)
  354. return nobj;
  355. nobj->defInfo = id.toDefObjInfo()[subid];
  356. return nobj;
  357. }
  358. CGHeroInstance * CGameState::HeroesPool::pickHeroFor(bool native, TPlayerColor player, const CTown *town, bmap<ui32, ConstTransitivePtr<CGHeroInstance> > &available, const CHeroClass *bannedClass /*= NULL*/) const
  359. {
  360. CGHeroInstance *ret = NULL;
  361. if(player>=GameConstants::PLAYER_LIMIT)
  362. {
  363. tlog1 << "Cannot pick hero for " << town->typeID << ". Wrong owner!\n";
  364. return NULL;
  365. }
  366. std::vector<CGHeroInstance *> pool;
  367. if(native)
  368. {
  369. for(auto i=available.begin(); i!=available.end(); i++)
  370. {
  371. if(pavailable.find(i->first)->second & 1<<player
  372. && i->second->type->heroClass->faction == town->typeID)
  373. {
  374. pool.push_back(i->second); //get all available heroes
  375. }
  376. }
  377. if(!pool.size())
  378. {
  379. tlog1 << "Cannot pick native hero for " << int(player) << ". Picking any...\n";
  380. return pickHeroFor(false, player, town, available);
  381. }
  382. else
  383. {
  384. ret = pool[rand()%pool.size()];
  385. }
  386. }
  387. else
  388. {
  389. int sum=0, r;
  390. for(auto i=available.begin(); i!=available.end(); i++)
  391. {
  392. if ((!bannedClass && (pavailable.find(i->first)->second & (1<<player))) ||
  393. i->second->type->heroClass != bannedClass)
  394. {
  395. pool.push_back(i->second);
  396. sum += i->second->type->heroClass->selectionProbability[town->typeID]; //total weight
  397. }
  398. }
  399. if(!pool.size() || sum == 0)
  400. {
  401. tlog1 << "There are no heroes available for player " << player<<"!\n";
  402. return nullptr;
  403. }
  404. r = rand()%sum;
  405. for (ui32 i=0; i<pool.size(); i++)
  406. {
  407. r -= pool[i]->type->heroClass->selectionProbability[town->typeID];
  408. if(r < 0)
  409. {
  410. ret = pool[i];
  411. break;
  412. }
  413. }
  414. if(!ret)
  415. ret = pool.back();
  416. }
  417. available.erase(ret->subID);
  418. return ret;
  419. }
  420. //void CGameState::apply(CPack * pack)
  421. //{
  422. // while(!mx->try_lock())
  423. // boost::this_thread::sleep(boost::posix_time::milliseconds(50)); //give other threads time to finish
  424. // //applyNL(pack);
  425. // mx->unlock();
  426. //}
  427. int CGameState::pickHero(int owner)
  428. {
  429. int h=-1;
  430. const PlayerSettings &ps = scenarioOps->getIthPlayersSettings(owner);
  431. if(!map->getHero(h = ps.hero) && h>=0) //we haven't used selected hero
  432. return h;
  433. if(scenarioOps->mode == StartInfo::CAMPAIGN)
  434. {
  435. auto bonus = scenarioOps->campState->getBonusForCurrentMap();
  436. if(bonus.is_initialized() && bonus->type == CScenarioTravel::STravelBonus::HERO && owner == bonus->info1)
  437. {
  438. if(bonus->info2 != 0xffff && !map->getHero(bonus->info2)) //not random and not taken
  439. {
  440. return bonus->info2;
  441. }
  442. }
  443. }
  444. //list of heroes for this faction
  445. std::vector<si32> factionHeroes;
  446. factionHeroes.reserve(GameConstants::HEROES_PER_TYPE*2);
  447. size_t firstHero = ps.castle*GameConstants::HEROES_PER_TYPE*2;
  448. size_t lastHero = std::min(firstHero + GameConstants::HEROES_PER_TYPE*2, VLC->heroh->heroes.size());
  449. //generate list of heroes
  450. for (si32 i=firstHero; i<lastHero; i++)
  451. factionHeroes.push_back(i);
  452. // we need random order to select hero
  453. std::random_shuffle(factionHeroes.begin(), factionHeroes.end(), [](size_t range)
  454. {
  455. return ran() % range;
  456. });
  457. for (size_t i=0; i<factionHeroes.size(); i++)
  458. {
  459. if (!map->getHero(factionHeroes[i]))
  460. return factionHeroes[i];
  461. }
  462. tlog3 << "Warning: cannot find free hero - trying to get first available..."<<std::endl;
  463. for(int j=0; j<VLC->heroh->heroes.size(); j++)
  464. if(!map->getHero(j))
  465. return j;
  466. assert(0); //currrent code can't handle this situation
  467. return -1; // no available heroes at all
  468. }
  469. std::pair<Obj,int> CGameState::pickObject (CGObjectInstance *obj)
  470. {
  471. switch(obj->ID)
  472. {
  473. case Obj::RANDOM_ART:
  474. return std::make_pair(Obj::ARTIFACT, VLC->arth->getRandomArt (CArtifact::ART_TREASURE | CArtifact::ART_MINOR | CArtifact::ART_MAJOR | CArtifact::ART_RELIC));
  475. case Obj::RANDOM_TREASURE_ART:
  476. return std::make_pair(Obj::ARTIFACT, VLC->arth->getRandomArt (CArtifact::ART_TREASURE));
  477. case Obj::RANDOM_MINOR_ART:
  478. return std::make_pair(Obj::ARTIFACT, VLC->arth->getRandomArt (CArtifact::ART_MINOR));
  479. case Obj::RANDOM_MAJOR_ART:
  480. return std::make_pair(Obj::ARTIFACT, VLC->arth->getRandomArt (CArtifact::ART_MAJOR));
  481. case Obj::RANDOM_RELIC_ART:
  482. return std::make_pair(Obj::ARTIFACT, VLC->arth->getRandomArt (CArtifact::ART_RELIC));
  483. case Obj::RANDOM_HERO:
  484. return std::make_pair(Obj::HERO, pickHero(obj->tempOwner));
  485. case Obj::RANDOM_MONSTER:
  486. return std::make_pair(Obj::MONSTER, VLC->creh->pickRandomMonster(boost::ref(ran)));
  487. case Obj::RANDOM_MONSTER_L1:
  488. return std::make_pair(Obj::MONSTER, VLC->creh->pickRandomMonster(boost::ref(ran), 1));
  489. case Obj::RANDOM_MONSTER_L2:
  490. return std::make_pair(Obj::MONSTER, VLC->creh->pickRandomMonster(boost::ref(ran), 2));
  491. case Obj::RANDOM_MONSTER_L3:
  492. return std::make_pair(Obj::MONSTER, VLC->creh->pickRandomMonster(boost::ref(ran), 3));
  493. case Obj::RANDOM_MONSTER_L4:
  494. return std::make_pair(Obj::MONSTER, VLC->creh->pickRandomMonster(boost::ref(ran), 4));
  495. case Obj::RANDOM_RESOURCE:
  496. return std::make_pair(Obj::RESOURCE,ran()%7); //now it's OH3 style, use %8 for mithril
  497. case Obj::RANDOM_TOWN:
  498. {
  499. int align = (static_cast<CGTownInstance*>(obj))->alignment,
  500. f;
  501. if(align>GameConstants::PLAYER_LIMIT-1)//same as owner / random
  502. {
  503. if(obj->tempOwner > GameConstants::PLAYER_LIMIT-1)
  504. f = -1; //random
  505. else
  506. f = scenarioOps->getIthPlayersSettings(obj->tempOwner).castle;
  507. }
  508. else
  509. {
  510. f = scenarioOps->getIthPlayersSettings(align).castle;
  511. }
  512. if(f<0)
  513. {
  514. auto iter = VLC->townh->towns.begin();
  515. std::advance(iter, ran()%VLC->townh->towns.size());
  516. f = iter->first;
  517. }
  518. return std::make_pair(Obj::TOWN,f);
  519. }
  520. case Obj::RANDOM_MONSTER_L5:
  521. return std::make_pair(Obj::MONSTER, VLC->creh->pickRandomMonster(boost::ref(ran), 5));
  522. case Obj::RANDOM_MONSTER_L6:
  523. return std::make_pair(Obj::MONSTER, VLC->creh->pickRandomMonster(boost::ref(ran), 6));
  524. case Obj::RANDOM_MONSTER_L7:
  525. return std::make_pair(Obj::MONSTER, VLC->creh->pickRandomMonster(boost::ref(ran), 7));
  526. case Obj::RANDOM_DWELLING:
  527. case Obj::RANDOM_DWELLING_LVL:
  528. case Obj::RANDOM_DWELLING_FACTION:
  529. {
  530. CGDwelling * dwl = static_cast<CGDwelling*>(obj);
  531. int faction;
  532. //if castle alignment available
  533. if (auto info = dynamic_cast<CCreGenAsCastleInfo*>(dwl->info))
  534. {
  535. faction = ran() % VLC->townh->factions.size();
  536. if (info->asCastle)
  537. {
  538. for(ui32 i=0;i<map->objects.size();i++)
  539. {
  540. if(!map->objects[i])
  541. continue;
  542. if(map->objects[i]->ID==Obj::RANDOM_TOWN
  543. && dynamic_cast<CGTownInstance*>(map->objects[i].get())->identifier == info->identifier)
  544. {
  545. randomizeObject(map->objects[i]); //we have to randomize the castle first
  546. faction = map->objects[i]->subID;
  547. break;
  548. }
  549. else if(map->objects[i]->ID==Obj::TOWN
  550. && dynamic_cast<CGTownInstance*>(map->objects[i].get())->identifier == info->identifier)
  551. {
  552. faction = map->objects[i]->subID;
  553. break;
  554. }
  555. }
  556. }
  557. else
  558. {
  559. while((!(info->castles[0]&(1<<faction))))
  560. {
  561. if((faction>7) && (info->castles[1]&(1<<(faction-8))))
  562. break;
  563. faction = ran()%GameConstants::F_NUMBER;
  564. }
  565. }
  566. }
  567. else // castle alignment fixed
  568. faction = obj->subID;
  569. int level;
  570. //if level set to range
  571. if (auto info = dynamic_cast<CCreGenLeveledInfo*>(dwl->info))
  572. level = ((info->maxLevel-info->minLevel) ? (ran()%(info->maxLevel-info->minLevel)+info->minLevel) : (info->minLevel));
  573. else // fixed level
  574. level = obj->subID;
  575. delete dwl->info;
  576. dwl->info = nullptr;
  577. std::pair<Obj,int> result(Obj::NO_OBJ, -1);
  578. int cid = VLC->townh->towns[faction].creatures[level][0];
  579. //golem factory is not in list of cregens but can be placed as random object
  580. static const int factoryCreatures[] = {32, 33, 116, 117};
  581. std::vector<int> factory(factoryCreatures, factoryCreatures + ARRAY_COUNT(factoryCreatures));
  582. if (vstd::contains(factory, cid))
  583. result = std::make_pair(Obj::CREATURE_GENERATOR4, 1);
  584. //NOTE: this will pick last dwelling with this creature (Mantis #900)
  585. //check for block map equality is better but more complex solution
  586. BOOST_FOREACH(auto &iter, VLC->objh->cregens)
  587. if (iter.second == cid)
  588. result = std::make_pair(Obj::CREATURE_GENERATOR1, iter.first);
  589. if (result.first == Obj::NO_OBJ)
  590. {
  591. tlog0 << "Error: failed to find creature for dwelling of "<< int(faction) << " of level " << int(level) << "\n";
  592. auto iter = VLC->objh->cregens.begin();
  593. std::advance(iter, ran() % VLC->objh->cregens.size() );
  594. result = std::make_pair(Obj::CREATURE_GENERATOR1, iter->first);
  595. }
  596. return result;
  597. }
  598. }
  599. return std::make_pair(Obj::NO_OBJ,-1);
  600. }
  601. void CGameState::randomizeObject(CGObjectInstance *cur)
  602. {
  603. std::pair<Obj,int> ran = pickObject(cur);
  604. if(ran.first == Obj::NO_OBJ || ran.second<0) //this is not a random object, or we couldn't find anything
  605. {
  606. if(cur->ID==Obj::TOWN) //town - set def
  607. {
  608. CGTownInstance *t = dynamic_cast<CGTownInstance*>(cur);
  609. t->town = &VLC->townh->towns[t->subID];
  610. if(t->hasCapitol())
  611. t->defInfo = VLC->dobjinfo->capitols[t->subID];
  612. else if(t->hasFort())
  613. t->defInfo = VLC->dobjinfo->gobjs[Obj::TOWN][t->subID];
  614. else
  615. t->defInfo = VLC->dobjinfo->villages[t->subID];
  616. }
  617. return;
  618. }
  619. else if(ran.first==Obj::HERO)//special code for hero
  620. {
  621. CGHeroInstance *h = dynamic_cast<CGHeroInstance *>(cur);
  622. if(!h) {tlog2<<"Wrong random hero at "<<cur->pos<<std::endl; return;}
  623. cur->ID = ran.first;
  624. h->portrait = cur->subID = ran.second;
  625. h->type = VLC->heroh->heroes[ran.second];
  626. h->randomizeArmy(h->type->heroClass->faction);
  627. map->heroes.push_back(h);
  628. return; //TODO: maybe we should do something with definfo?
  629. }
  630. else if(ran.first==Obj::TOWN)//special code for town
  631. {
  632. CGTownInstance *t = dynamic_cast<CGTownInstance*>(cur);
  633. if(!t) {tlog2<<"Wrong random town at "<<cur->pos<<std::endl; return;}
  634. cur->ID = ran.first;
  635. cur->subID = ran.second;
  636. //FIXME: copy-pasted from above
  637. t->town = &VLC->townh->towns[t->subID];
  638. if(t->hasCapitol())
  639. t->defInfo = VLC->dobjinfo->capitols[t->subID];
  640. else if(t->hasFort())
  641. t->defInfo = VLC->dobjinfo->gobjs[Obj::TOWN][t->subID];
  642. else
  643. t->defInfo = VLC->dobjinfo->villages[t->subID];
  644. t->randomizeArmy(t->subID);
  645. map->towns.push_back(t);
  646. return;
  647. }
  648. //we have to replace normal random object
  649. cur->ID = ran.first;
  650. cur->subID = ran.second;
  651. map->removeBlockVisTiles(cur); //recalculate blockvis tiles - picked object might have different than random placeholder
  652. map->customDefs.push_back(cur->defInfo = ran.first.toDefObjInfo()[ran.second]);
  653. if(!cur->defInfo)
  654. {
  655. tlog1<<"*BIG* WARNING: Missing def declaration for "<<cur->ID<<" "<<cur->subID<<std::endl;
  656. return;
  657. }
  658. map->addBlockVisTiles(cur);
  659. }
  660. int CGameState::getDate(Date::EDateType mode) const
  661. {
  662. int temp;
  663. switch (mode)
  664. {
  665. case Date::DAY:
  666. return day;
  667. break;
  668. case Date::DAY_OF_WEEK: //day of week
  669. temp = (day)%7; // 1 - Monday, 7 - Sunday
  670. if (temp)
  671. return temp;
  672. else return 7;
  673. break;
  674. case Date::WEEK: //current week
  675. temp = ((day-1)/7)+1;
  676. if (!(temp%4))
  677. return 4;
  678. else
  679. return (temp%4);
  680. break;
  681. case Date::MONTH: //current month
  682. return ((day-1)/28)+1;
  683. break;
  684. case Date::DAY_OF_MONTH: //day of month
  685. temp = (day)%28;
  686. if (temp)
  687. return temp;
  688. else return 28;
  689. break;
  690. }
  691. return 0;
  692. }
  693. CGameState::CGameState()
  694. {
  695. gs = this;
  696. mx = new boost::shared_mutex();
  697. applierGs = new CApplier<CBaseForGSApply>;
  698. registerTypes2(*applierGs);
  699. objCaller = new CObjectCallersHandler;
  700. globalEffects.setDescription("Global effects");
  701. }
  702. CGameState::~CGameState()
  703. {
  704. //delete mx;//TODO: crash on Linux (mutex must be unlocked before destruction)
  705. map.dellNull();
  706. curB.dellNull();
  707. //delete scenarioOps; //TODO: fix for loading ind delete
  708. //delete initialOpts;
  709. delete applierGs;
  710. delete objCaller;
  711. }
  712. BattleInfo * CGameState::setupBattle(int3 tile, const CArmedInstance *armies[2], const CGHeroInstance * heroes[2], bool creatureBank, const CGTownInstance *town)
  713. {
  714. const TerrainTile &t = map->getTile(tile);
  715. ETerrainType::ETerrainType terrain = t.terType;
  716. if(t.isCoastal() && !t.isWater())
  717. terrain = ETerrainType::SAND;
  718. BFieldType::BFieldType terType = battleGetBattlefieldType(tile);
  719. return BattleInfo::setupBattle(tile, terrain, terType, armies, heroes, creatureBank, town);
  720. }
  721. void CGameState::init(StartInfo * si)
  722. {
  723. auto giveCampaignBonusToHero = [&](CGHeroInstance * hero)
  724. {
  725. const boost::optional<CScenarioTravel::STravelBonus> & curBonus = scenarioOps->campState->getBonusForCurrentMap();
  726. if(!curBonus)
  727. return;
  728. if(curBonus->isBonusForHero())
  729. {
  730. //apply bonus
  731. switch (curBonus->type)
  732. {
  733. case CScenarioTravel::STravelBonus::SPELL:
  734. hero->spells.insert(SpellID(curBonus->info2));
  735. break;
  736. case CScenarioTravel::STravelBonus::MONSTER:
  737. {
  738. for(int i=0; i<GameConstants::ARMY_SIZE; i++)
  739. {
  740. if(hero->slotEmpty(i))
  741. {
  742. hero->addToSlot(i, CreatureID(curBonus->info2), curBonus->info3);
  743. break;
  744. }
  745. }
  746. }
  747. break;
  748. case CScenarioTravel::STravelBonus::ARTIFACT:
  749. gs->giveHeroArtifact(hero, curBonus->info2);
  750. break;
  751. case CScenarioTravel::STravelBonus::SPELL_SCROLL:
  752. {
  753. CArtifactInstance * scroll = CArtifactInstance::createScroll(VLC->spellh->spells[curBonus->info2]);
  754. scroll->putAt(ArtifactLocation(hero, scroll->firstAvailableSlot(hero)));
  755. }
  756. break;
  757. case CScenarioTravel::STravelBonus::PRIMARY_SKILL:
  758. {
  759. const ui8* ptr = reinterpret_cast<const ui8*>(&curBonus->info2);
  760. for (int g=0; g<GameConstants::PRIMARY_SKILLS; ++g)
  761. {
  762. int val = ptr[g];
  763. if (val == 0)
  764. {
  765. continue;
  766. }
  767. Bonus *bb = new Bonus(Bonus::PERMANENT, Bonus::PRIMARY_SKILL, Bonus::CAMPAIGN_BONUS, val, scenarioOps->campState->currentMap, g);
  768. hero->addNewBonus(bb);
  769. }
  770. }
  771. break;
  772. case CScenarioTravel::STravelBonus::SECONDARY_SKILL:
  773. hero->setSecSkillLevel(static_cast<SecondarySkill::SecondarySkill>(curBonus->info2), curBonus->info3, true);
  774. break;
  775. }
  776. }
  777. };
  778. auto getHumanPlayerInfo = [&]() -> std::vector<const PlayerSettings *>
  779. {
  780. std::vector<const PlayerSettings *> ret;
  781. for(auto it = scenarioOps->playerInfos.cbegin();
  782. it != scenarioOps->playerInfos.cend(); ++it)
  783. {
  784. if(it->second.playerID != PlayerSettings::PLAYER_AI)
  785. ret.push_back(&it->second);
  786. }
  787. return ret;
  788. };
  789. tlog0 << "\tUsing random seed: "<< si->seedToBeUsed << std::endl;
  790. ran.seed((boost::int32_t)si->seedToBeUsed);
  791. scenarioOps = new StartInfo(*si);
  792. initialOpts = new StartInfo(*si);
  793. si = NULL;
  794. switch(scenarioOps->mode)
  795. {
  796. case StartInfo::NEW_GAME:
  797. {
  798. if(scenarioOps->createRandomMap)
  799. {
  800. tlog0 << "Create random map." << std::endl;
  801. // Create player settings for RMG
  802. std::map<TPlayerColor, CMapGenerator::CPlayerSettings> players;
  803. BOOST_FOREACH(auto pInfo, scenarioOps->playerInfos)
  804. {
  805. const PlayerSettings & startSettings = pInfo.second;
  806. CMapGenerator::CPlayerSettings player;
  807. player.setColor(startSettings.color);
  808. player.setStartingTown(startSettings.castle);
  809. if(startSettings.playerID > 0)
  810. {
  811. player.setPlayerType(CMapGenerator::CPlayerSettings::HUMAN);
  812. }
  813. else if(startSettings.compOnly)
  814. {
  815. player.setPlayerType(CMapGenerator::CPlayerSettings::COMP_ONLY);
  816. }
  817. players[player.getColor()] = player;
  818. }
  819. // Gen map
  820. CMapGenerator mapGen(*scenarioOps->mapGenOptions, players, scenarioOps->seedToBeUsed);
  821. map = mapGen.generate().release();
  822. // Update starting options
  823. for(int i = 0; i < map->players.size(); ++i)
  824. {
  825. const PlayerInfo & pInfo = map->players[i];
  826. if(pInfo.canComputerPlay || pInfo.canHumanPlay)
  827. {
  828. PlayerSettings & pSettings = scenarioOps->playerInfos[i];
  829. pSettings.compOnly = !pInfo.canHumanPlay;
  830. pSettings.team = pInfo.team;
  831. pSettings.castle = pInfo.defaultCastle();
  832. if(pSettings.playerID == PlayerSettings::PLAYER_AI && pSettings.name.empty())
  833. {
  834. pSettings.name = VLC->generaltexth->allTexts[468];
  835. }
  836. pSettings.color = i;
  837. }
  838. else
  839. {
  840. scenarioOps->playerInfos.erase(i);
  841. }
  842. }
  843. }
  844. else
  845. {
  846. tlog0 << "Open map file: " << scenarioOps->mapname << std::endl;
  847. map = CMapService::loadMap(scenarioOps->mapname).release();
  848. }
  849. }
  850. break;
  851. case StartInfo::CAMPAIGN:
  852. {
  853. tlog0 << "Open campaign map file: " << scenarioOps->campState->currentMap << std::endl;
  854. auto campaign = scenarioOps->campState;
  855. assert(vstd::contains(campaign->camp->mapPieces, scenarioOps->campState->currentMap));
  856. std::string & mapContent = campaign->camp->mapPieces[scenarioOps->campState->currentMap];
  857. auto buffer = reinterpret_cast<const ui8 *>(mapContent.data());
  858. map = CMapService::loadMap(buffer, mapContent.size()).release();
  859. }
  860. break;
  861. case StartInfo::DUEL:
  862. initDuel();
  863. return;
  864. default:
  865. tlog1 << "Wrong mode: " << (int)scenarioOps->mode << std::endl;
  866. return;
  867. }
  868. VLC->arth->initAllowedArtifactsList(map->allowedArtifact);
  869. tlog0 << "Map loaded!" << std::endl;
  870. //tlog0 <<"Reading and detecting map file (together): "<<tmh.getDif()<<std::endl;
  871. tlog0 << "\tOur checksum for the map: "<< map->checksum << std::endl;
  872. if(scenarioOps->mapfileChecksum)
  873. {
  874. tlog0 << "\tServer checksum for " << scenarioOps->mapname <<": "<< scenarioOps->mapfileChecksum << std::endl;
  875. if(map->checksum != scenarioOps->mapfileChecksum)
  876. {
  877. tlog1 << "Wrong map checksum!!!" << std::endl;
  878. throw std::runtime_error("Wrong checksum");
  879. }
  880. }
  881. else
  882. scenarioOps->mapfileChecksum = map->checksum;
  883. day = 0;
  884. tlog4 << "Initialization:";
  885. tlog4 << "\tPicking grail position";
  886. //pick grail location
  887. if(map->grailPos.x < 0 || map->grailRadious) //grail not set or set within a radius around some place
  888. {
  889. if(!map->grailRadious) //radius not given -> anywhere on map
  890. map->grailRadious = map->width * 2;
  891. std::vector<int3> allowedPos;
  892. // add all not blocked tiles in range
  893. for (int i = 0; i < map->width ; i++)
  894. {
  895. for (int j = 0; j < map->height ; j++)
  896. {
  897. for (int k = 0; k < (map->twoLevel ? 2 : 1); k++)
  898. {
  899. const TerrainTile &t = map->terrain[i][j][k];
  900. if(!t.blocked
  901. && !t.visitable
  902. && t.terType != ETerrainType::WATER
  903. && t.terType != ETerrainType::ROCK
  904. && map->grailPos.dist2d(int3(i,j,k)) <= map->grailRadious)
  905. allowedPos.push_back(int3(i,j,k));
  906. }
  907. }
  908. }
  909. //remove tiles with holes
  910. for(ui32 no=0; no<map->objects.size(); ++no)
  911. if(map->objects[no] && map->objects[no]->ID == Obj::HOLE)
  912. allowedPos -= map->objects[no]->pos;
  913. if(allowedPos.size())
  914. map->grailPos = allowedPos[ran() % allowedPos.size()];
  915. else
  916. tlog2 << "Warning: Grail cannot be placed, no appropriate tile found!\n";
  917. }
  918. //picking random factions for players
  919. tlog4 << "\tPicking random factions for players";
  920. for(auto it = scenarioOps->playerInfos.begin();
  921. it != scenarioOps->playerInfos.end(); ++it)
  922. {
  923. if(it->second.castle==-1)
  924. {
  925. int randomID = ran() % map->players[it->first].allowedFactions.size();
  926. auto iter = map->players[it->first].allowedFactions.begin();
  927. std::advance(iter, randomID);
  928. it->second.castle = *iter;
  929. }
  930. }
  931. //randomizing objects
  932. tlog4 << "\tRandomizing objects";
  933. BOOST_FOREACH(CGObjectInstance *obj, map->objects)
  934. {
  935. if(!obj)
  936. continue;
  937. randomizeObject(obj);
  938. obj->hoverName = VLC->generaltexth->names[obj->ID];
  939. //handle Favouring Winds - mark tiles under it
  940. if(obj->ID == Obj::FAVORABLE_WINDS)
  941. for (int i = 0; i < obj->getWidth() ; i++)
  942. for (int j = 0; j < obj->getHeight() ; j++)
  943. {
  944. int3 pos = obj->pos - int3(i,j,0);
  945. if(map->isInTheMap(pos))
  946. map->getTile(pos).extTileFlags |= 128;
  947. }
  948. }
  949. //std::cout<<"\tRandomizing objects: "<<th.getDif()<<std::endl;
  950. /*********creating players entries in gs****************************************/
  951. tlog4 << "\tCreating player entries in gs";
  952. for(auto it = scenarioOps->playerInfos.begin();
  953. it != scenarioOps->playerInfos.end(); ++it)
  954. {
  955. std::pair<TPlayerColor,PlayerState> ins(it->first,PlayerState());
  956. ins.second.color=ins.first;
  957. ins.second.human = it->second.playerID;
  958. ins.second.team = map->players[ins.first].team;
  959. teams[ins.second.team].id = ins.second.team;//init team
  960. teams[ins.second.team].players.insert(ins.first);//add player to team
  961. players.insert(ins);
  962. }
  963. /*********give starting hero****************************************/
  964. tlog4 << "\tGiving starting hero";
  965. {
  966. bool campaignGiveHero = false;
  967. if(scenarioOps->campState)
  968. {
  969. auto bonus = scenarioOps->campState->getBonusForCurrentMap();
  970. if(bonus.is_initialized())
  971. {
  972. campaignGiveHero = scenarioOps->mode == StartInfo::CAMPAIGN &&
  973. bonus.get().type == CScenarioTravel::STravelBonus::HERO;
  974. }
  975. }
  976. for(auto it = scenarioOps->playerInfos.begin(); it != scenarioOps->playerInfos.end(); ++it)
  977. {
  978. const PlayerInfo &p = map->players[it->first];
  979. bool generateHero = (p.generateHeroAtMainTown ||
  980. (it->second.playerID != PlayerSettings::PLAYER_AI && campaignGiveHero)) && p.hasMainTown;
  981. if(generateHero && vstd::contains(scenarioOps->playerInfos, it->first))
  982. {
  983. int3 hpos = p.posOfMainTown;
  984. hpos.x+=1;
  985. int h = pickHero(it->first);
  986. if(it->second.hero == -1)
  987. it->second.hero = h;
  988. CGHeroInstance * nnn = static_cast<CGHeroInstance*>(createObject(Obj::HERO,h,hpos,it->first));
  989. nnn->id = map->objects.size();
  990. nnn->initHero();
  991. map->heroes.push_back(nnn);
  992. map->objects.push_back(nnn);
  993. map->addBlockVisTiles(nnn);
  994. }
  995. }
  996. }
  997. /*************************replace hero placeholders*****************************/
  998. tlog4 << "\tReplacing hero placeholders";
  999. std::vector<std::pair<CGHeroInstance*, int> > campHeroReplacements; //instance, id in vector
  1000. if (scenarioOps->campState)
  1001. {
  1002. auto replaceHero = [&](int objId, CGHeroInstance * ghi)
  1003. {
  1004. campHeroReplacements.push_back(std::make_pair(ghi, objId));
  1005. // ghi->tempOwner = getHumanPlayerInfo()[0]->color;
  1006. // ghi->id = objId;
  1007. // gs->map->objects[objId] = ghi;
  1008. // gs->map->heroes.push_back(ghi);
  1009. };
  1010. auto campaign = scenarioOps->campState;
  1011. auto bonus = campaign->getBonusForCurrentMap();
  1012. if(bonus.is_initialized())
  1013. {
  1014. std::vector<CGHeroInstance*> Xheroes;
  1015. if (bonus->type == CScenarioTravel::STravelBonus::PLAYER_PREV_SCENARIO)
  1016. {
  1017. Xheroes = campaign->camp->scenarios[bonus->info2].crossoverHeroes;
  1018. }
  1019. //selecting heroes by type
  1020. for(int g=0; g<map->objects.size(); ++g)
  1021. {
  1022. CGObjectInstance * obj = map->objects[g];
  1023. if (obj->ID != Obj::HERO_PLACEHOLDER)
  1024. {
  1025. continue;
  1026. }
  1027. CGHeroPlaceholder * hp = static_cast<CGHeroPlaceholder*>(obj);
  1028. if(hp->subID != 0xFF) //select by type
  1029. {
  1030. bool found = false;
  1031. BOOST_FOREACH(auto ghi, Xheroes)
  1032. {
  1033. if (ghi->subID == hp->subID)
  1034. {
  1035. found = true;
  1036. replaceHero(g, ghi);
  1037. Xheroes -= ghi;
  1038. break;
  1039. }
  1040. }
  1041. if (!found)
  1042. {
  1043. CGHeroInstance * nh = new CGHeroInstance();
  1044. nh->initHero(hp->subID);
  1045. replaceHero(g, nh);
  1046. }
  1047. }
  1048. }
  1049. //selecting heroes by power
  1050. std::sort(Xheroes.begin(), Xheroes.end(), [](const CGHeroInstance * a, const CGHeroInstance * b)
  1051. {
  1052. return a->getHeroStrength() > b->getHeroStrength();
  1053. }); //sort, descending strength
  1054. for(int g=0; g<map->objects.size(); ++g)
  1055. {
  1056. CGObjectInstance * obj = map->objects[g];
  1057. if (obj->ID != Obj::HERO_PLACEHOLDER)
  1058. {
  1059. continue;
  1060. }
  1061. CGHeroPlaceholder * hp = static_cast<CGHeroPlaceholder*>(obj);
  1062. if (hp->subID == 0xFF) //select by power
  1063. {
  1064. if(Xheroes.size() > hp->power - 1)
  1065. replaceHero(g, Xheroes[hp->power - 1]);
  1066. else
  1067. {
  1068. tlog3 << "Warning, no hero to replace!\n";
  1069. map->removeBlockVisTiles(hp, true);
  1070. delete hp;
  1071. map->objects[g] = NULL;
  1072. }
  1073. //we don't have to remove hero from Xheroes because it would destroy the order and duplicates shouldn't happen
  1074. }
  1075. }
  1076. }
  1077. }
  1078. /******************RESOURCES****************************************************/
  1079. tlog4 << "\tSetting up resources";
  1080. const JsonNode config(ResourceID("config/startres.json"));
  1081. const JsonVector &vector = config["difficulty"].Vector();
  1082. const JsonNode &level = vector[scenarioOps->difficulty];
  1083. TResources startresAI(level["ai"]);
  1084. TResources startresHuman(level["human"]);
  1085. for (auto i = players.begin(); i!=players.end(); i++)
  1086. {
  1087. PlayerState &p = i->second;
  1088. if (p.human)
  1089. p.resources = startresHuman;
  1090. else
  1091. p.resources = startresAI;
  1092. }
  1093. //give start resource bonus in case of campaign
  1094. if (scenarioOps->mode == StartInfo::CAMPAIGN)
  1095. {
  1096. auto chosenBonus = scenarioOps->campState->getBonusForCurrentMap();
  1097. if(chosenBonus.is_initialized() && chosenBonus->type == CScenarioTravel::STravelBonus::RESOURCE)
  1098. {
  1099. std::vector<const PlayerSettings *> people = getHumanPlayerInfo(); //players we will give resource bonus
  1100. BOOST_FOREACH(const PlayerSettings *ps, people)
  1101. {
  1102. std::vector<int> res; //resources we will give
  1103. switch (chosenBonus->info1)
  1104. {
  1105. case 0: case 1: case 2: case 3: case 4: case 5: case 6:
  1106. res.push_back(chosenBonus->info1);
  1107. break;
  1108. case 0xFD: //wood+ore
  1109. res.push_back(Res::WOOD); res.push_back(Res::ORE);
  1110. break;
  1111. case 0xFE: //rare
  1112. res.push_back(Res::MERCURY); res.push_back(Res::SULFUR); res.push_back(Res::CRYSTAL); res.push_back(Res::GEMS);
  1113. break;
  1114. default:
  1115. assert(0);
  1116. break;
  1117. }
  1118. //increasing resource quantity
  1119. for (int n=0; n<res.size(); ++n)
  1120. {
  1121. players[ps->color].resources[res[n]] += chosenBonus->info2;
  1122. }
  1123. }
  1124. }
  1125. }
  1126. /*************************HEROES************************************************/
  1127. tlog4 << "\tSetting up heroes";
  1128. //Replace placeholders with heroes from previous missions
  1129. BOOST_FOREACH(auto obj, campHeroReplacements)
  1130. {
  1131. CGHeroPlaceholder *placeholder = dynamic_cast<CGHeroPlaceholder*>(&*map->objects[obj.second]);
  1132. CGHeroInstance *heroToPlace = obj.first;
  1133. heroToPlace->id = obj.second;
  1134. heroToPlace->tempOwner = placeholder->tempOwner;
  1135. heroToPlace->pos = placeholder->pos;
  1136. heroToPlace->type = VLC->heroh->heroes[heroToPlace->type->ID];
  1137. BOOST_FOREACH(auto &&i, heroToPlace->stacks)
  1138. i.second->type = VLC->creh->creatures[i.second->getCreatureID()];
  1139. auto fixArtifact = [&](CArtifactInstance * art)
  1140. {
  1141. art->artType = VLC->arth->artifacts[art->artType->id];
  1142. gs->map->artInstances.push_back(art);
  1143. art->id = gs->map->artInstances.size() - 1;
  1144. };
  1145. BOOST_FOREACH(auto &&i, heroToPlace->artifactsWorn)
  1146. fixArtifact(i.second.artifact);
  1147. BOOST_FOREACH(auto &&i, heroToPlace->artifactsInBackpack)
  1148. fixArtifact(i.artifact);
  1149. map->heroes.push_back(heroToPlace);
  1150. map->objects[heroToPlace->id] = heroToPlace;
  1151. map->addBlockVisTiles(heroToPlace);
  1152. //const auto & travelOptions = scenarioOps->campState->getCurrentScenario().travelOptions;
  1153. }
  1154. std::set<int> hids; //hero ids to create pool
  1155. for(ui32 i=0; i<map->allowedHeroes.size(); i++) //add to hids all allowed heroes
  1156. if(map->allowedHeroes[i])
  1157. hids.insert(i);
  1158. for (ui32 i=0; i<map->heroes.size();i++) //heroes instances initialization
  1159. {
  1160. if (map->heroes[i]->getOwner()<0)
  1161. {
  1162. tlog2 << "Warning - hero with uninitialized owner!\n";
  1163. continue;
  1164. }
  1165. CGHeroInstance * vhi = map->heroes[i];
  1166. vhi->initHero();
  1167. players.find(vhi->getOwner())->second.heroes.push_back(vhi);
  1168. hids.erase(vhi->subID);
  1169. }
  1170. BOOST_FOREACH(auto obj, map->objects) //prisons
  1171. {
  1172. if(obj && obj->ID == Obj::PRISON)
  1173. hids.erase(obj->subID);
  1174. }
  1175. BOOST_FOREACH(auto ph, map->predefinedHeroes)
  1176. {
  1177. if(!vstd::contains(hids, ph->subID))
  1178. continue;
  1179. ph->initHero();
  1180. hpool.heroesPool[ph->subID] = ph;
  1181. hpool.pavailable[ph->subID] = 0xff;
  1182. hids.erase(ph->subID);
  1183. }
  1184. BOOST_FOREACH(int hid, hids) //all not used allowed heroes go with default state into the pool
  1185. {
  1186. CGHeroInstance * vhi = new CGHeroInstance();
  1187. vhi->initHero(hid);
  1188. hpool.heroesPool[hid] = vhi;
  1189. hpool.pavailable[hid] = 0xff;
  1190. }
  1191. for(ui32 i=0; i<map->disposedHeroes.size(); i++)
  1192. {
  1193. hpool.pavailable[map->disposedHeroes[i].heroId] = map->disposedHeroes[i].players;
  1194. }
  1195. if (scenarioOps->mode == StartInfo::CAMPAIGN) //give campaign bonuses for specific / best hero
  1196. {
  1197. auto chosenBonus = scenarioOps->campState->getBonusForCurrentMap();
  1198. if (chosenBonus.is_initialized() && chosenBonus->isBonusForHero() && chosenBonus->info1 != 0xFFFE) //exclude generated heroes
  1199. {
  1200. //find human player
  1201. int humanPlayer=GameConstants::NEUTRAL_PLAYER;
  1202. for (auto it=players.begin(); it != players.end(); ++it)
  1203. {
  1204. if(it->second.human)
  1205. {
  1206. humanPlayer = it->first;
  1207. break;
  1208. }
  1209. }
  1210. assert(humanPlayer != GameConstants::NEUTRAL_PLAYER);
  1211. std::vector<ConstTransitivePtr<CGHeroInstance> > & heroes = players[humanPlayer].heroes;
  1212. if (chosenBonus->info1 == 0xFFFD) //most powerful
  1213. {
  1214. int maxB = -1;
  1215. for (int b=0; b<heroes.size(); ++b)
  1216. {
  1217. if (maxB == -1 || heroes[b]->getTotalStrength() > heroes[maxB]->getTotalStrength())
  1218. {
  1219. maxB = b;
  1220. }
  1221. }
  1222. if(maxB < 0)
  1223. tlog2 << "Warning - cannot give bonus to hero cause there are no heroes!\n";
  1224. else
  1225. giveCampaignBonusToHero(heroes[maxB]);
  1226. }
  1227. else //specific hero
  1228. {
  1229. for (int b=0; b<heroes.size(); ++b)
  1230. {
  1231. if (heroes[b]->subID == chosenBonus->info1)
  1232. {
  1233. giveCampaignBonusToHero(heroes[b]);
  1234. break;
  1235. }
  1236. }
  1237. }
  1238. }
  1239. }
  1240. /*************************FOG**OF**WAR******************************************/
  1241. tlog4 << "\tFog of war"; //FIXME: should be initialized after all bonuses are set
  1242. for(auto k=teams.begin(); k!=teams.end(); ++k)
  1243. {
  1244. k->second.fogOfWarMap.resize(map->width);
  1245. for(int g=0; g<map->width; ++g)
  1246. k->second.fogOfWarMap[g].resize(map->height);
  1247. for(int g=-0; g<map->width; ++g)
  1248. for(int h=0; h<map->height; ++h)
  1249. k->second.fogOfWarMap[g][h].resize(map->twoLevel ? 2 : 1, 0);
  1250. for(int g=0; g<map->width; ++g)
  1251. for(int h=0; h<map->height; ++h)
  1252. for(int v = 0; v < (map->twoLevel ? 2 : 1); ++v)
  1253. k->second.fogOfWarMap[g][h][v] = 0;
  1254. BOOST_FOREACH(CGObjectInstance *obj, map->objects)
  1255. {
  1256. if(!obj || !vstd::contains(k->second.players, obj->tempOwner)) continue; //not a flagged object
  1257. boost::unordered_set<int3, ShashInt3> tiles;
  1258. obj->getSightTiles(tiles);
  1259. BOOST_FOREACH(int3 tile, tiles)
  1260. {
  1261. k->second.fogOfWarMap[tile.x][tile.y][tile.z] = 1;
  1262. }
  1263. }
  1264. }
  1265. tlog4 << "\tStarting bonuses";
  1266. for(auto k=players.begin(); k!=players.end(); ++k)
  1267. {
  1268. //starting bonus
  1269. if(scenarioOps->playerInfos[k->first].bonus==PlayerSettings::RANDOM)
  1270. scenarioOps->playerInfos[k->first].bonus = static_cast<PlayerSettings::Ebonus>(ran()%3);
  1271. switch(scenarioOps->playerInfos[k->first].bonus)
  1272. {
  1273. case PlayerSettings::GOLD:
  1274. k->second.resources[Res::GOLD] += 500 + (ran()%6)*100;
  1275. break;
  1276. case PlayerSettings::RESOURCE:
  1277. {
  1278. int res = VLC->townh->towns[scenarioOps->playerInfos[k->first].castle].primaryRes;
  1279. if(res == 127)
  1280. {
  1281. k->second.resources[Res::WOOD] += 5 + ran()%6;
  1282. k->second.resources[Res::ORE] += 5 + ran()%6;
  1283. }
  1284. else
  1285. {
  1286. k->second.resources[res] += 3 + ran()%4;
  1287. }
  1288. break;
  1289. }
  1290. case PlayerSettings::ARTIFACT:
  1291. {
  1292. if(!k->second.heroes.size())
  1293. {
  1294. tlog5 << "Cannot give starting artifact - no heroes!" << std::endl;
  1295. break;
  1296. }
  1297. CArtifact *toGive;
  1298. toGive = VLC->arth->artifacts[VLC->arth->getRandomArt (CArtifact::ART_TREASURE)];
  1299. CGHeroInstance *hero = k->second.heroes[0];
  1300. giveHeroArtifact(hero, toGive->id);
  1301. }
  1302. break;
  1303. }
  1304. }
  1305. /****************************TOWNS************************************************/
  1306. tlog4 << "\tTowns";
  1307. CGTownInstance::universitySkills.clear();
  1308. for ( int i=0; i<4; i++)
  1309. CGTownInstance::universitySkills.push_back(14+i);//skills for university
  1310. for (ui32 i=0;i<map->towns.size();i++)
  1311. {
  1312. CGTownInstance * vti =(map->towns[i]);
  1313. if(!vti->town)
  1314. vti->town = &VLC->townh->towns[vti->subID];
  1315. if (vti->name.length()==0) // if town hasn't name we draw it
  1316. vti->name = vti->town->names[ran()%vti->town->names.size()];
  1317. //init buildings
  1318. if(vti->builtBuildings.find(-50)!=vti->builtBuildings.end()) //give standard set of buildings
  1319. {
  1320. vti->builtBuildings.erase(-50);
  1321. vti->builtBuildings.insert(BuildingID::VILLAGE_HALL);
  1322. vti->builtBuildings.insert(BuildingID::TAVERN);
  1323. vti->builtBuildings.insert(BuildingID::DWELL_FIRST);
  1324. if(ran()%2)
  1325. vti->builtBuildings.insert(BuildingID::DWELL_FIRST+1);
  1326. }
  1327. if (vstd::contains(vti->builtBuildings, BuildingID::SHIPYARD) && vti->state()==IBoatGenerator::TILE_BLOCKED)
  1328. vti->builtBuildings.erase(BuildingID::SHIPYARD);//if we have harbor without water - erase it (this is H3 behaviour)
  1329. //init hordes
  1330. for (int i = 0; i<GameConstants::CREATURES_PER_TOWN; i++)
  1331. if (vstd::contains(vti->builtBuildings,(-31-i))) //if we have horde for this level
  1332. {
  1333. vti->builtBuildings.erase(-31-i);//remove old ID
  1334. if (vti->town->hordeLvl[0] == i)//if town first horde is this one
  1335. {
  1336. vti->builtBuildings.insert(BuildingID::HORDE_1);//add it
  1337. if (vstd::contains(vti->builtBuildings,(BuildingID::DWELL_UP_FIRST+i)))//if we have upgraded dwelling as well
  1338. vti->builtBuildings.insert(BuildingID::HORDE_1_UPGR);//add it as well
  1339. }
  1340. if (vti->town->hordeLvl[1] == i)//if town second horde is this one
  1341. {
  1342. vti->builtBuildings.insert(BuildingID::HORDE_2);
  1343. if (vstd::contains(vti->builtBuildings,(BuildingID::DWELL_UP_FIRST+i)))
  1344. vti->builtBuildings.insert(BuildingID::HORDE_2_UPGR);
  1345. }
  1346. }
  1347. //town events
  1348. BOOST_FOREACH(CCastleEvent *ev, vti->events)
  1349. {
  1350. for (int i = 0; i<GameConstants::CREATURES_PER_TOWN; i++)
  1351. if (vstd::contains(ev->buildings,(-31-i))) //if we have horde for this level
  1352. {
  1353. ev->buildings.erase(-31-i);
  1354. if (vti->town->hordeLvl[0] == i)
  1355. ev->buildings.insert(BuildingID::HORDE_1);
  1356. if (vti->town->hordeLvl[1] == i)
  1357. ev->buildings.insert(BuildingID::HORDE_2);
  1358. }
  1359. }
  1360. //init spells
  1361. vti->spells.resize(GameConstants::SPELL_LEVELS);
  1362. CSpell *s;
  1363. for(ui32 z=0; z<vti->obligatorySpells.size();z++)
  1364. {
  1365. s = VLC->spellh->spells[vti->obligatorySpells[z]];
  1366. vti->spells[s->level-1].push_back(s->id);
  1367. vti->possibleSpells -= s->id;
  1368. }
  1369. while(vti->possibleSpells.size())
  1370. {
  1371. ui32 total=0;
  1372. int sel = -1;
  1373. for(ui32 ps=0;ps<vti->possibleSpells.size();ps++)
  1374. total += VLC->spellh->spells[vti->possibleSpells[ps]]->probabilities[vti->subID];
  1375. if (total == 0) // remaining spells have 0 probability
  1376. break;
  1377. int r = ran()%total;
  1378. for(ui32 ps=0; ps<vti->possibleSpells.size();ps++)
  1379. {
  1380. r -= VLC->spellh->spells[vti->possibleSpells[ps]]->probabilities[vti->subID];
  1381. if(r<0)
  1382. {
  1383. sel = ps;
  1384. break;
  1385. }
  1386. }
  1387. if(sel<0)
  1388. sel=0;
  1389. CSpell *s = VLC->spellh->spells[vti->possibleSpells[sel]];
  1390. vti->spells[s->level-1].push_back(s->id);
  1391. vti->possibleSpells -= s->id;
  1392. }
  1393. vti->possibleSpells.clear();
  1394. if(vti->getOwner() != 255)
  1395. getPlayer(vti->getOwner())->towns.push_back(vti);
  1396. }
  1397. //campaign bonuses for towns
  1398. if (scenarioOps->mode == StartInfo::CAMPAIGN)
  1399. {
  1400. auto chosenBonus = scenarioOps->campState->getBonusForCurrentMap();
  1401. if (chosenBonus.is_initialized() && chosenBonus->type == CScenarioTravel::STravelBonus::BUILDING)
  1402. {
  1403. for (int g=0; g<map->towns.size(); ++g)
  1404. {
  1405. PlayerState * owner = getPlayer(map->towns[g]->getOwner());
  1406. if (owner)
  1407. {
  1408. PlayerInfo & pi = map->players[owner->color];
  1409. if (owner->human && //human-owned
  1410. map->towns[g]->pos == pi.posOfMainTown + int3(2, 0, 0))
  1411. {
  1412. map->towns[g]->builtBuildings.insert(
  1413. CBuildingHandler::campToERMU(chosenBonus->info1, map->towns[g]->town->typeID, map->towns[g]->builtBuildings));
  1414. break;
  1415. }
  1416. }
  1417. }
  1418. }
  1419. }
  1420. tlog4 << "\tObject initialization";
  1421. objCaller->preInit();
  1422. BOOST_FOREACH(CGObjectInstance *obj, map->objects)
  1423. {
  1424. if(obj)
  1425. obj->initObj();
  1426. }
  1427. BOOST_FOREACH(CGObjectInstance *obj, map->objects)
  1428. {
  1429. if(!obj)
  1430. continue;
  1431. switch (obj->ID)
  1432. {
  1433. case Obj::QUEST_GUARD:
  1434. case Obj::SEER_HUT:
  1435. {
  1436. auto q = static_cast<CGSeerHut*>(obj);
  1437. assert (q);
  1438. q->setObjToKill();
  1439. }
  1440. }
  1441. }
  1442. CGTeleport::postInit(); //pairing subterranean gates
  1443. buildBonusSystemTree();
  1444. for(auto k=players.begin(); k!=players.end(); ++k)
  1445. {
  1446. if(k->first==GameConstants::NEUTRAL_PLAYER)
  1447. continue;
  1448. //init visiting and garrisoned heroes
  1449. BOOST_FOREACH(CGHeroInstance *h, k->second.heroes)
  1450. {
  1451. BOOST_FOREACH(CGTownInstance *t, k->second.towns)
  1452. {
  1453. int3 vistile = t->pos; vistile.x--; //tile next to the entrance
  1454. if(vistile == h->pos || h->pos==t->pos)
  1455. {
  1456. t->setVisitingHero(h);
  1457. if(h->pos == t->pos) //visiting hero placed in the editor has same pos as the town - we need to correct it
  1458. {
  1459. map->removeBlockVisTiles(h);
  1460. h->pos.x -= 1;
  1461. map->addBlockVisTiles(h);
  1462. }
  1463. break;
  1464. }
  1465. }
  1466. }
  1467. }
  1468. tlog4 << "\tChecking objectives";
  1469. map->checkForObjectives(); //needs to be run when all objects are properly placed
  1470. int seedAfterInit = ran();
  1471. tlog0 << "Seed after init is " << seedAfterInit << " (before was " << scenarioOps->seedToBeUsed << ")" << std::endl;
  1472. if(scenarioOps->seedPostInit > 0)
  1473. {
  1474. //RNG must be in the same state on all machines when initialization is done (otherwise we have desync)
  1475. assert(scenarioOps->seedPostInit == seedAfterInit);
  1476. }
  1477. else
  1478. {
  1479. scenarioOps->seedPostInit = seedAfterInit; //store the post init "seed"
  1480. }
  1481. }
  1482. void CGameState::initDuel()
  1483. {
  1484. DuelParameters dp;
  1485. try //CLoadFile likes throwing
  1486. {
  1487. if(boost::algorithm::ends_with(scenarioOps->mapname, ".json"))
  1488. {
  1489. tlog0 << "Loading duel settings from JSON file: " << scenarioOps->mapname << std::endl;
  1490. dp = DuelParameters::fromJSON(scenarioOps->mapname);
  1491. tlog0 << "JSON file has been successfully read!\n";
  1492. }
  1493. else
  1494. {
  1495. CLoadFile lf(scenarioOps->mapname);
  1496. lf >> dp;
  1497. }
  1498. }
  1499. catch(...)
  1500. {
  1501. tlog1 << "Cannot load duel settings from " << scenarioOps->mapname << std::endl;
  1502. throw;
  1503. }
  1504. const CArmedInstance *armies[2] = {0};
  1505. const CGHeroInstance *heroes[2] = {0};
  1506. CGTownInstance *town = NULL;
  1507. for(int i = 0; i < 2; i++)
  1508. {
  1509. CArmedInstance *obj = NULL;
  1510. if(dp.sides[i].heroId >= 0)
  1511. {
  1512. const DuelParameters::SideSettings &ss = dp.sides[i];
  1513. CGHeroInstance *h = new CGHeroInstance();
  1514. armies[i] = heroes[i] = h;
  1515. obj = h;
  1516. h->subID = ss.heroId;
  1517. for(int i = 0; i < ss.heroPrimSkills.size(); i++)
  1518. h->pushPrimSkill(static_cast<PrimarySkill::PrimarySkill>(i), ss.heroPrimSkills[i]);
  1519. if(ss.spells.size())
  1520. {
  1521. h->putArtifact(ArtifactPosition::SPELLBOOK, CArtifactInstance::createNewArtifactInstance(0));
  1522. boost::copy(ss.spells, std::inserter(h->spells, h->spells.begin()));
  1523. }
  1524. BOOST_FOREACH(auto &parka, ss.artifacts)
  1525. {
  1526. h->putArtifact(static_cast<ArtifactPosition::ArtifactPosition>(parka.first), parka.second);
  1527. }
  1528. typedef const std::pair<si32, si8> &TSecSKill;
  1529. BOOST_FOREACH(TSecSKill secSkill, ss.heroSecSkills)
  1530. h->setSecSkillLevel(static_cast<SecondarySkill::SecondarySkill>(secSkill.first), secSkill.second, 1);
  1531. h->initHero(h->subID);
  1532. obj->initObj();
  1533. }
  1534. else
  1535. {
  1536. CGCreature *c = new CGCreature();
  1537. armies[i] = obj = c;
  1538. //c->subID = 34;
  1539. }
  1540. obj->setOwner(i);
  1541. for(int j = 0; j < ARRAY_COUNT(dp.sides[i].stacks); j++)
  1542. {
  1543. CreatureID cre = dp.sides[i].stacks[j].type;
  1544. TQuantity count = dp.sides[i].stacks[j].count;
  1545. if(count || obj->hasStackAtSlot(j))
  1546. obj->setCreature(j, cre, count);
  1547. }
  1548. BOOST_FOREACH(const DuelParameters::CusomCreature &cc, dp.creatures)
  1549. {
  1550. CCreature *c = VLC->creh->creatures[cc.id];
  1551. if(cc.attack >= 0)
  1552. c->getBonusLocalFirst(Selector::typeSubtype(Bonus::PRIMARY_SKILL, PrimarySkill::ATTACK))->val = cc.attack;
  1553. if(cc.defense >= 0)
  1554. c->getBonusLocalFirst(Selector::typeSubtype(Bonus::PRIMARY_SKILL, PrimarySkill::DEFENSE))->val = cc.defense;
  1555. if(cc.speed >= 0)
  1556. c->getBonusLocalFirst(Selector::type(Bonus::STACKS_SPEED))->val = cc.speed;
  1557. if(cc.HP >= 0)
  1558. c->getBonusLocalFirst(Selector::type(Bonus::STACK_HEALTH))->val = cc.HP;
  1559. if(cc.dmg >= 0)
  1560. {
  1561. c->getBonusLocalFirst(Selector::typeSubtype(Bonus::CREATURE_DAMAGE, 1))->val = cc.dmg;
  1562. c->getBonusLocalFirst(Selector::typeSubtype(Bonus::CREATURE_DAMAGE, 2))->val = cc.dmg;
  1563. }
  1564. if(cc.shoots >= 0)
  1565. c->getBonusLocalFirst(Selector::type(Bonus::SHOTS))->val = cc.shoots;
  1566. }
  1567. }
  1568. curB = BattleInfo::setupBattle(int3(), dp.terType, dp.bfieldType, armies, heroes, false, town);
  1569. curB->obstacles = dp.obstacles;
  1570. curB->localInit();
  1571. return;
  1572. }
  1573. BFieldType::BFieldType CGameState::battleGetBattlefieldType(int3 tile) const
  1574. {
  1575. if(tile==int3() && curB)
  1576. tile = curB->tile;
  1577. else if(tile==int3() && !curB)
  1578. return BFieldType::NONE;
  1579. const TerrainTile &t = map->getTile(tile);
  1580. //fight in mine -> subterranean
  1581. if(dynamic_cast<const CGMine *>(t.visitableObjects.front()))
  1582. return BFieldType::SUBTERRANEAN;
  1583. BOOST_FOREACH(auto &obj, map->objects)
  1584. {
  1585. //look only for objects covering given tile
  1586. if( !obj || obj->pos.z != tile.z
  1587. || !obj->coveringAt(tile.x - obj->pos.x, tile.y - obj->pos.y))
  1588. continue;
  1589. switch(obj->ID)
  1590. {
  1591. case Obj::CLOVER_FIELD:
  1592. return BFieldType::CLOVER_FIELD;
  1593. case Obj::CURSED_GROUND1: case Obj::CURSED_GROUND2:
  1594. return BFieldType::CURSED_GROUND;
  1595. case Obj::EVIL_FOG:
  1596. return BFieldType::EVIL_FOG;
  1597. case Obj::FAVORABLE_WINDS:
  1598. return BFieldType::FAVOURABLE_WINDS;
  1599. case Obj::FIERY_FIELDS:
  1600. return BFieldType::FIERY_FIELDS;
  1601. case Obj::HOLY_GROUNDS:
  1602. return BFieldType::HOLY_GROUND;
  1603. case Obj::LUCID_POOLS:
  1604. return BFieldType::LUCID_POOLS;
  1605. case Obj::MAGIC_CLOUDS:
  1606. return BFieldType::MAGIC_CLOUDS;
  1607. case Obj::MAGIC_PLAINS1: case Obj::MAGIC_PLAINS2:
  1608. return BFieldType::MAGIC_PLAINS;
  1609. case Obj::ROCKLANDS:
  1610. return BFieldType::ROCKLANDS;
  1611. }
  1612. }
  1613. if(!t.isWater() && t.isCoastal())
  1614. return BFieldType::SAND_SHORE;
  1615. switch(t.terType)
  1616. {
  1617. case ETerrainType::DIRT:
  1618. return static_cast<BFieldType::BFieldType>(rand()%3+3);
  1619. case ETerrainType::SAND:
  1620. return BFieldType::SAND_MESAS; //TODO: coast support
  1621. case ETerrainType::GRASS:
  1622. return static_cast<BFieldType::BFieldType>(rand()%2+6);
  1623. case ETerrainType::SNOW:
  1624. return static_cast<BFieldType::BFieldType>(rand()%2+10);
  1625. case ETerrainType::SWAMP:
  1626. return BFieldType::SWAMP_TREES;
  1627. case ETerrainType::ROUGH:
  1628. return BFieldType::ROUGH;
  1629. case ETerrainType::SUBTERRANEAN:
  1630. return BFieldType::SUBTERRANEAN;
  1631. case ETerrainType::LAVA:
  1632. return BFieldType::LAVA;
  1633. case ETerrainType::WATER:
  1634. return BFieldType::SHIP;
  1635. case ETerrainType::ROCK:
  1636. return BFieldType::ROCKLANDS;
  1637. default:
  1638. return BFieldType::NONE;
  1639. }
  1640. }
  1641. UpgradeInfo CGameState::getUpgradeInfo(const CStackInstance &stack)
  1642. {
  1643. UpgradeInfo ret;
  1644. const CCreature *base = stack.type;
  1645. const CGHeroInstance *h = stack.armyObj->ID == Obj::HERO ? static_cast<const CGHeroInstance*>(stack.armyObj) : NULL;
  1646. const CGTownInstance *t = NULL;
  1647. if(stack.armyObj->ID == Obj::TOWN)
  1648. t = static_cast<const CGTownInstance *>(stack.armyObj);
  1649. else if(h)
  1650. { //hero specialty
  1651. TBonusListPtr lista = h->getBonuses(Selector::typeSubtype(Bonus::SPECIAL_UPGRADE, base->idNumber));
  1652. BOOST_FOREACH(const Bonus *it, *lista)
  1653. {
  1654. auto nid = CreatureID(it->additionalInfo);
  1655. if (nid != base->idNumber) //in very specific case the upgrade is available by default (?)
  1656. {
  1657. ret.newID.push_back(nid);
  1658. ret.cost.push_back(VLC->creh->creatures[nid]->cost - base->cost);
  1659. }
  1660. }
  1661. t = h->visitedTown;
  1662. }
  1663. if(t)
  1664. {
  1665. BOOST_FOREACH(const CGTownInstance::TCreaturesSet::value_type & dwelling, t->creatures)
  1666. {
  1667. if (vstd::contains(dwelling.second, base->idNumber)) //Dwelling with our creature
  1668. {
  1669. BOOST_FOREACH(auto upgrID, dwelling.second)
  1670. {
  1671. if(vstd::contains(base->upgrades, upgrID)) //possible upgrade
  1672. {
  1673. ret.newID.push_back(upgrID);
  1674. ret.cost.push_back(VLC->creh->creatures[upgrID]->cost - base->cost);
  1675. }
  1676. }
  1677. }
  1678. }
  1679. }
  1680. //hero is visiting Hill Fort
  1681. if(h && map->getTile(h->visitablePos()).visitableObjects.front()->ID == Obj::HILL_FORT)
  1682. {
  1683. static const int costModifiers[] = {0, 25, 50, 75, 100}; //we get cheaper upgrades depending on level
  1684. const int costModifier = costModifiers[std::min<int>(std::max((int)base->level - 1, 0), ARRAY_COUNT(costModifiers) - 1)];
  1685. BOOST_FOREACH(auto nid, base->upgrades)
  1686. {
  1687. ret.newID.push_back(nid);
  1688. ret.cost.push_back((VLC->creh->creatures[nid]->cost - base->cost) * costModifier / 100);
  1689. }
  1690. }
  1691. if(ret.newID.size())
  1692. ret.oldID = base->idNumber;
  1693. return ret;
  1694. }
  1695. PlayerRelations::PlayerRelations CGameState::getPlayerRelations( TPlayerColor color1, TPlayerColor color2 )
  1696. {
  1697. if ( color1 == color2 )
  1698. return PlayerRelations::SAME_PLAYER;
  1699. if(color1 == GameConstants::NEUTRAL_PLAYER || color2 == GameConstants::NEUTRAL_PLAYER) //neutral player has no friends
  1700. return PlayerRelations::ENEMIES;
  1701. const TeamState * ts = getPlayerTeam(color1);
  1702. if (ts && vstd::contains(ts->players, color2))
  1703. return PlayerRelations::ALLIES;
  1704. return PlayerRelations::ENEMIES;
  1705. }
  1706. void CGameState::getNeighbours(const TerrainTile &srct, int3 tile, std::vector<int3> &vec, const boost::logic::tribool &onLand, bool limitCoastSailing)
  1707. {
  1708. static const int3 dirs[] = { int3(0,1,0),int3(0,-1,0),int3(-1,0,0),int3(+1,0,0),
  1709. int3(1,1,0),int3(-1,1,0),int3(1,-1,0),int3(-1,-1,0) };
  1710. for (size_t i = 0; i < ARRAY_COUNT(dirs); i++)
  1711. {
  1712. const int3 hlp = tile + dirs[i];
  1713. if(!map->isInTheMap(hlp))
  1714. continue;
  1715. const TerrainTile &hlpt = map->getTile(hlp);
  1716. // //we cannot visit things from blocked tiles
  1717. // if(srct.blocked && !srct.visitable && hlpt.visitable && srct.blockingObjects.front()->ID != HEROI_TYPE)
  1718. // {
  1719. // continue;
  1720. // }
  1721. if(srct.terType == ETerrainType::WATER && limitCoastSailing && hlpt.terType == ETerrainType::WATER && dirs[i].x && dirs[i].y) //diagonal move through water
  1722. {
  1723. int3 hlp1 = tile,
  1724. hlp2 = tile;
  1725. hlp1.x += dirs[i].x;
  1726. hlp2.y += dirs[i].y;
  1727. if(map->getTile(hlp1).terType != ETerrainType::WATER || map->getTile(hlp2).terType != ETerrainType::WATER)
  1728. continue;
  1729. }
  1730. if((indeterminate(onLand) || onLand == (hlpt.terType!=ETerrainType::WATER) )
  1731. && hlpt.terType != ETerrainType::ROCK)
  1732. {
  1733. vec.push_back(hlp);
  1734. }
  1735. }
  1736. }
  1737. int CGameState::getMovementCost(const CGHeroInstance *h, const int3 &src, const int3 &dest, int remainingMovePoints, bool checkLast)
  1738. {
  1739. if(src == dest) //same tile
  1740. return 0;
  1741. TerrainTile &s = map->terrain[src.x][src.y][src.z],
  1742. &d = map->terrain[dest.x][dest.y][dest.z];
  1743. //get basic cost
  1744. int ret = h->getTileCost(d,s);
  1745. if(d.blocked && h->hasBonusOfType(Bonus::FLYING_MOVEMENT))
  1746. {
  1747. bool freeFlying = h->getBonusesCount(Selector::typeSubtype(Bonus::FLYING_MOVEMENT, 1)) > 0;
  1748. if(!freeFlying)
  1749. {
  1750. ret *= 1.4; //40% penalty for movement over blocked tile
  1751. }
  1752. }
  1753. else if (d.terType == ETerrainType::WATER)
  1754. {
  1755. if(h->boat && s.hasFavourableWinds() && d.hasFavourableWinds()) //Favourable Winds
  1756. ret *= 0.666;
  1757. else if (!h->boat && h->getBonusesCount(Selector::typeSubtype(Bonus::WATER_WALKING, 1)) > 0)
  1758. ret *= 1.4; //40% penalty for water walking
  1759. }
  1760. if(src.x != dest.x && src.y != dest.y) //it's diagonal move
  1761. {
  1762. int old = ret;
  1763. ret *= 1.414213;
  1764. //diagonal move costs too much but normal move is possible - allow diagonal move for remaining move points
  1765. if(ret > remainingMovePoints && remainingMovePoints >= old)
  1766. {
  1767. return remainingMovePoints;
  1768. }
  1769. }
  1770. int left = remainingMovePoints-ret;
  1771. if(checkLast && left > 0 && remainingMovePoints-ret < 250) //it might be the last tile - if no further move possible we take all move points
  1772. {
  1773. std::vector<int3> vec;
  1774. getNeighbours(d, dest, vec, s.terType != ETerrainType::WATER, true);
  1775. for(size_t i=0; i < vec.size(); i++)
  1776. {
  1777. int fcost = getMovementCost(h,dest,vec[i],left,false);
  1778. if(fcost <= left)
  1779. {
  1780. return ret;
  1781. }
  1782. }
  1783. ret = remainingMovePoints;
  1784. }
  1785. return ret;
  1786. }
  1787. void CGameState::apply(CPack *pack)
  1788. {
  1789. ui16 typ = typeList.getTypeID(pack);
  1790. applierGs->apps[typ]->applyOnGS(this,pack);
  1791. }
  1792. void CGameState::calculatePaths(const CGHeroInstance *hero, CPathsInfo &out, int3 src, int movement)
  1793. {
  1794. CPathfinder pathfinder(out, this, hero);
  1795. pathfinder.calculatePaths(src, movement);
  1796. }
  1797. /**
  1798. * Tells if the tile is guarded by a monster as well as the position
  1799. * of the monster that will attack on it.
  1800. *
  1801. * @return int3(-1, -1, -1) if the tile is unguarded, or the position of
  1802. * the monster guarding the tile.
  1803. */
  1804. std::vector<CGObjectInstance*> CGameState::guardingCreatures (int3 pos) const
  1805. {
  1806. std::vector<CGObjectInstance*> guards;
  1807. const int3 originalPos = pos;
  1808. if (!map->isInTheMap(pos))
  1809. return guards;
  1810. const TerrainTile &posTile = map->terrain[pos.x][pos.y][pos.z];
  1811. if (posTile.visitable)
  1812. {
  1813. BOOST_FOREACH (CGObjectInstance* obj, posTile.visitableObjects)
  1814. {
  1815. if(obj->blockVisit)
  1816. {
  1817. if (obj->ID == Obj::MONSTER) // Monster
  1818. guards.push_back(obj);
  1819. }
  1820. }
  1821. }
  1822. pos -= int3(1, 1, 0); // Start with top left.
  1823. for (int dx = 0; dx < 3; dx++)
  1824. {
  1825. for (int dy = 0; dy < 3; dy++)
  1826. {
  1827. if (map->isInTheMap(pos))
  1828. {
  1829. TerrainTile &tile = map->terrain[pos.x][pos.y][pos.z];
  1830. if (tile.visitable && (tile.isWater() == posTile.isWater()))
  1831. {
  1832. BOOST_FOREACH (CGObjectInstance* obj, tile.visitableObjects)
  1833. {
  1834. if (obj->ID == Obj::MONSTER && checkForVisitableDir(pos, &map->getTile(originalPos), originalPos)) // Monster being able to attack investigated tile
  1835. {
  1836. guards.push_back(obj);
  1837. }
  1838. }
  1839. }
  1840. }
  1841. pos.y++;
  1842. }
  1843. pos.y -= 3;
  1844. pos.x++;
  1845. }
  1846. return guards;
  1847. }
  1848. int3 CGameState::guardingCreaturePosition (int3 pos) const
  1849. {
  1850. const int3 originalPos = pos;
  1851. // Give monster at position priority.
  1852. if (!map->isInTheMap(pos))
  1853. return int3(-1, -1, -1);
  1854. const TerrainTile &posTile = map->terrain[pos.x][pos.y][pos.z];
  1855. if (posTile.visitable)
  1856. {
  1857. BOOST_FOREACH (CGObjectInstance* obj, posTile.visitableObjects)
  1858. {
  1859. if(obj->blockVisit)
  1860. {
  1861. if (obj->ID == Obj::MONSTER) // Monster
  1862. return pos;
  1863. else
  1864. return int3(-1, -1, -1); //blockvis objects are not guarded by neighbouring creatures
  1865. }
  1866. }
  1867. }
  1868. // See if there are any monsters adjacent.
  1869. pos -= int3(1, 1, 0); // Start with top left.
  1870. for (int dx = 0; dx < 3; dx++)
  1871. {
  1872. for (int dy = 0; dy < 3; dy++)
  1873. {
  1874. if (map->isInTheMap(pos))
  1875. {
  1876. TerrainTile &tile = map->terrain[pos.x][pos.y][pos.z];
  1877. if (tile.visitable && (tile.isWater() == posTile.isWater()))
  1878. {
  1879. BOOST_FOREACH (CGObjectInstance* obj, tile.visitableObjects)
  1880. {
  1881. if (obj->ID == Obj::MONSTER && checkForVisitableDir(pos, &map->getTile(originalPos), originalPos)) // Monster being able to attack investigated tile
  1882. {
  1883. return pos;
  1884. }
  1885. }
  1886. }
  1887. }
  1888. pos.y++;
  1889. }
  1890. pos.y -= 3;
  1891. pos.x++;
  1892. }
  1893. return int3(-1, -1, -1);
  1894. }
  1895. bool CGameState::isVisible(int3 pos, TPlayerColor player)
  1896. {
  1897. if(player == GameConstants::NEUTRAL_PLAYER)
  1898. return false;
  1899. return getPlayerTeam(player)->fogOfWarMap[pos.x][pos.y][pos.z];
  1900. }
  1901. bool CGameState::isVisible( const CGObjectInstance *obj, boost::optional<TPlayerColor> player )
  1902. {
  1903. if(!player)
  1904. return true;
  1905. if(*player == GameConstants::NEUTRAL_PLAYER) //-> TODO ??? needed?
  1906. return false;
  1907. //object is visible when at least one blocked tile is visible
  1908. for(int fx=0; fx<8; ++fx)
  1909. {
  1910. for(int fy=0; fy<6; ++fy)
  1911. {
  1912. int3 pos = obj->pos + int3(fx-7,fy-5,0);
  1913. if(map->isInTheMap(pos)
  1914. && !((obj->defInfo->blockMap[fy] >> (7 - fx)) & 1)
  1915. && isVisible(pos, *player) )
  1916. return true;
  1917. }
  1918. }
  1919. return false;
  1920. }
  1921. bool CGameState::checkForVisitableDir(const int3 & src, const int3 & dst) const
  1922. {
  1923. const TerrainTile * pom = &map->getTile(dst);
  1924. return checkForVisitableDir(src, pom, dst);
  1925. }
  1926. bool CGameState::checkForVisitableDir( const int3 & src, const TerrainTile *pom, const int3 & dst ) const
  1927. {
  1928. for(ui32 b=0; b<pom->visitableObjects.size(); ++b) //checking destination tile
  1929. {
  1930. if(!vstd::contains(pom->blockingObjects, pom->visitableObjects[b])) //this visitable object is not blocking, ignore
  1931. continue;
  1932. CGDefInfo * di = pom->visitableObjects[b]->defInfo;
  1933. if( (dst.x == src.x-1 && dst.y == src.y-1) && !(di->visitDir & (1<<4)) )
  1934. {
  1935. return false;
  1936. }
  1937. if( (dst.x == src.x && dst.y == src.y-1) && !(di->visitDir & (1<<5)) )
  1938. {
  1939. return false;
  1940. }
  1941. if( (dst.x == src.x+1 && dst.y == src.y-1) && !(di->visitDir & (1<<6)) )
  1942. {
  1943. return false;
  1944. }
  1945. if( (dst.x == src.x+1 && dst.y == src.y) && !(di->visitDir & (1<<7)) )
  1946. {
  1947. return false;
  1948. }
  1949. if( (dst.x == src.x+1 && dst.y == src.y+1) && !(di->visitDir & (1<<0)) )
  1950. {
  1951. return false;
  1952. }
  1953. if( (dst.x == src.x && dst.y == src.y+1) && !(di->visitDir & (1<<1)) )
  1954. {
  1955. return false;
  1956. }
  1957. if( (dst.x == src.x-1 && dst.y == src.y+1) && !(di->visitDir & (1<<2)) )
  1958. {
  1959. return false;
  1960. }
  1961. if( (dst.x == src.x-1 && dst.y == src.y) && !(di->visitDir & (1<<3)) )
  1962. {
  1963. return false;
  1964. }
  1965. }
  1966. return true;
  1967. }
  1968. int CGameState::victoryCheck( ui8 player ) const
  1969. {
  1970. const PlayerState *p = CGameInfoCallback::getPlayer(player);
  1971. if(map->victoryCondition.condition == EVictoryConditionType::WINSTANDARD || map->victoryCondition.allowNormalVictory
  1972. || (!p->human && !map->victoryCondition.appliesToAI)) //if the special victory condition applies only to human, AI has the standard)
  1973. {
  1974. if(player == checkForStandardWin())
  1975. return -1;
  1976. }
  1977. if (p->enteredWinningCheatCode)
  1978. { //cheater or tester, but has entered the code...
  1979. if(map->victoryCondition.condition == EVictoryConditionType::WINSTANDARD)
  1980. return -1;
  1981. else
  1982. return 1;
  1983. }
  1984. if(p->human || map->victoryCondition.appliesToAI)
  1985. {
  1986. switch(map->victoryCondition.condition)
  1987. {
  1988. case EVictoryConditionType::ARTIFACT:
  1989. //check if any hero has winning artifact
  1990. for(size_t i = 0; i < p->heroes.size(); i++)
  1991. if(p->heroes[i]->hasArt(map->victoryCondition.objectId))
  1992. return 1;
  1993. break;
  1994. case EVictoryConditionType::GATHERTROOP:
  1995. {
  1996. //check if in players armies there is enough creatures
  1997. int total = 0; //creature counter
  1998. for(size_t i = 0; i < map->objects.size(); i++)
  1999. {
  2000. const CArmedInstance *ai = NULL;
  2001. if(map->objects[i]
  2002. && map->objects[i]->tempOwner == player //object controlled by player
  2003. && (ai = dynamic_cast<const CArmedInstance*>(map->objects[i].get()))) //contains army
  2004. {
  2005. for(TSlots::const_iterator i=ai->Slots().begin(); i!=ai->Slots().end(); ++i) //iterate through army
  2006. if(i->second->type->idNumber == map->victoryCondition.objectId) //it's searched creature
  2007. total += i->second->count;
  2008. }
  2009. }
  2010. if(total >= map->victoryCondition.count)
  2011. return 1;
  2012. }
  2013. break;
  2014. case EVictoryConditionType::GATHERRESOURCE:
  2015. if(p->resources[map->victoryCondition.objectId] >= map->victoryCondition.count)
  2016. return 1;
  2017. break;
  2018. case EVictoryConditionType::BUILDCITY:
  2019. {
  2020. const CGTownInstance *t = static_cast<const CGTownInstance *>(map->victoryCondition.obj);
  2021. if(t->tempOwner == player && t->fortLevel()-1 >= map->victoryCondition.objectId && t->hallLevel()-1 >= map->victoryCondition.count)
  2022. return 1;
  2023. }
  2024. break;
  2025. case EVictoryConditionType::BUILDGRAIL:
  2026. BOOST_FOREACH(const CGTownInstance *t, map->towns)
  2027. if((t == map->victoryCondition.obj || !map->victoryCondition.obj)
  2028. && t->tempOwner == player
  2029. && t->hasBuilt(BuildingID::GRAIL))
  2030. return 1;
  2031. break;
  2032. case EVictoryConditionType::BEATHERO:
  2033. if(map->victoryCondition.obj->tempOwner >= GameConstants::PLAYER_LIMIT) //target hero not present on map
  2034. return 1;
  2035. break;
  2036. case EVictoryConditionType::CAPTURECITY:
  2037. {
  2038. if(map->victoryCondition.obj->tempOwner == player)
  2039. return 1;
  2040. }
  2041. break;
  2042. case EVictoryConditionType::BEATMONSTER:
  2043. if(!map->objects[map->victoryCondition.obj->id]) //target monster not present on map
  2044. return 1;
  2045. break;
  2046. case EVictoryConditionType::TAKEDWELLINGS:
  2047. for(size_t i = 0; i < map->objects.size(); i++)
  2048. {
  2049. if(map->objects[i] && map->objects[i]->tempOwner != player) //check not flagged objs
  2050. {
  2051. switch(map->objects[i]->ID)
  2052. {
  2053. case Obj::CREATURE_GENERATOR1: case Obj::CREATURE_GENERATOR2:
  2054. case Obj::CREATURE_GENERATOR3: case Obj::CREATURE_GENERATOR4:
  2055. case Obj::RANDOM_DWELLING: case Obj::RANDOM_DWELLING_LVL: case Obj::RANDOM_DWELLING_FACTION:
  2056. return 0; //found not flagged dwelling - player not won
  2057. }
  2058. }
  2059. }
  2060. return 1;
  2061. break;
  2062. case EVictoryConditionType::TAKEMINES:
  2063. for(size_t i = 0; i < map->objects.size(); i++)
  2064. {
  2065. if(map->objects[i] && map->objects[i]->tempOwner != player) //check not flagged objs
  2066. {
  2067. switch(map->objects[i]->ID)
  2068. {
  2069. case Obj::MINE: case Obj::ABANDONED_MINE:
  2070. return 0; //found not flagged mine - player not won
  2071. }
  2072. }
  2073. }
  2074. return 1;
  2075. break;
  2076. case EVictoryConditionType::TRANSPORTITEM:
  2077. {
  2078. const CGTownInstance *t = static_cast<const CGTownInstance *>(map->victoryCondition.obj);
  2079. if((t->visitingHero && t->visitingHero->hasArt(map->victoryCondition.objectId))
  2080. || (t->garrisonHero && t->garrisonHero->hasArt(map->victoryCondition.objectId)))
  2081. {
  2082. return 1;
  2083. }
  2084. }
  2085. break;
  2086. }
  2087. }
  2088. return 0;
  2089. }
  2090. ui8 CGameState::checkForStandardWin() const
  2091. {
  2092. //std victory condition is:
  2093. //all enemies lost
  2094. TPlayerColor supposedWinner = 255, winnerTeam = 255;
  2095. for(auto i = players.begin(); i != players.end(); i++)
  2096. {
  2097. if(i->second.status == EPlayerStatus::INGAME && i->first < GameConstants::PLAYER_LIMIT)
  2098. {
  2099. if(supposedWinner == 255)
  2100. {
  2101. //first player remaining ingame - candidate for victory
  2102. supposedWinner = i->second.color;
  2103. winnerTeam = i->second.team;
  2104. }
  2105. else if(winnerTeam != i->second.team)
  2106. {
  2107. //current candidate has enemy remaining in game -> no vicotry
  2108. return 255;
  2109. }
  2110. }
  2111. }
  2112. return supposedWinner;
  2113. }
  2114. bool CGameState::checkForStandardLoss( TPlayerColor player ) const
  2115. {
  2116. //std loss condition is: player lost all towns and heroes
  2117. const PlayerState &p = *CGameInfoCallback::getPlayer(player);
  2118. return !p.heroes.size() && !p.towns.size();
  2119. }
  2120. struct statsHLP
  2121. {
  2122. typedef std::pair< TPlayerColor, si64 > TStat;
  2123. //converts [<player's color, value>] to vec[place] -> platers
  2124. static std::vector< std::vector< TPlayerColor > > getRank( std::vector<TStat> stats )
  2125. {
  2126. std::sort(stats.begin(), stats.end(), statsHLP());
  2127. //put first element
  2128. std::vector< std::vector<TPlayerColor> > ret;
  2129. std::vector<TPlayerColor> tmp;
  2130. tmp.push_back( stats[0].first );
  2131. ret.push_back( tmp );
  2132. //the rest of elements
  2133. for(int g=1; g<stats.size(); ++g)
  2134. {
  2135. if(stats[g].second == stats[g-1].second)
  2136. {
  2137. (ret.end()-1)->push_back( stats[g].first );
  2138. }
  2139. else
  2140. {
  2141. //create next occupied rank
  2142. std::vector<TPlayerColor> tmp;
  2143. tmp.push_back(stats[g].first);
  2144. ret.push_back(tmp);
  2145. }
  2146. }
  2147. return ret;
  2148. }
  2149. bool operator()(const TStat & a, const TStat & b) const
  2150. {
  2151. return a.second > b.second;
  2152. }
  2153. static const CGHeroInstance * findBestHero(CGameState * gs, int color)
  2154. {
  2155. std::vector<ConstTransitivePtr<CGHeroInstance> > &h = gs->players[color].heroes;
  2156. if(!h.size())
  2157. return NULL;
  2158. //best hero will be that with highest exp
  2159. int best = 0;
  2160. for(int b=1; b<h.size(); ++b)
  2161. {
  2162. if(h[b]->exp > h[best]->exp)
  2163. {
  2164. best = b;
  2165. }
  2166. }
  2167. return h[best];
  2168. }
  2169. //calculates total number of artifacts that belong to given player
  2170. static int getNumberOfArts(const PlayerState * ps)
  2171. {
  2172. int ret = 0;
  2173. BOOST_FOREACH(auto h, ps->heroes)
  2174. {
  2175. ret += h->artifactsInBackpack.size() + h->artifactsWorn.size();
  2176. }
  2177. return ret;
  2178. }
  2179. // get total strength of player army
  2180. static si64 getArmyStrength(const PlayerState * ps)
  2181. {
  2182. si64 str = 0;
  2183. BOOST_FOREACH(auto h, ps->heroes)
  2184. {
  2185. if(!h->inTownGarrison) //original h3 behavior
  2186. str += h->getArmyStrength();
  2187. }
  2188. return str;
  2189. }
  2190. };
  2191. void CGameState::obtainPlayersStats(SThievesGuildInfo & tgi, int level)
  2192. {
  2193. #define FILL_FIELD(FIELD, VAL_GETTER) \
  2194. { \
  2195. std::vector< std::pair< TPlayerColor, si64 > > stats; \
  2196. for(auto g = players.begin(); g != players.end(); ++g) \
  2197. { \
  2198. if(g->second.color == 255) \
  2199. continue; \
  2200. std::pair< ui8, si64 > stat; \
  2201. stat.first = g->second.color; \
  2202. stat.second = VAL_GETTER; \
  2203. stats.push_back(stat); \
  2204. } \
  2205. tgi.FIELD = statsHLP::getRank(stats); \
  2206. }
  2207. for(auto g = players.begin(); g != players.end(); ++g)
  2208. {
  2209. if(g->second.color != 255)
  2210. tgi.playerColors.push_back(g->second.color);
  2211. }
  2212. if(level >= 1) //num of towns & num of heroes
  2213. {
  2214. //num of towns
  2215. FILL_FIELD(numOfTowns, g->second.towns.size())
  2216. //num of heroes
  2217. FILL_FIELD(numOfHeroes, g->second.heroes.size())
  2218. //best hero's portrait
  2219. for(auto g = players.cbegin(); g != players.cend(); ++g)
  2220. {
  2221. if(g->second.color == 255)
  2222. continue;
  2223. const CGHeroInstance * best = statsHLP::findBestHero(this, g->second.color);
  2224. InfoAboutHero iah;
  2225. iah.initFromHero(best, level >= 8);
  2226. iah.army.clear();
  2227. tgi.colorToBestHero[g->second.color] = iah;
  2228. }
  2229. }
  2230. if(level >= 2) //gold
  2231. {
  2232. FILL_FIELD(gold, g->second.resources[Res::GOLD])
  2233. }
  2234. if(level >= 2) //wood & ore
  2235. {
  2236. FILL_FIELD(woodOre, g->second.resources[Res::WOOD] + g->second.resources[Res::ORE])
  2237. }
  2238. if(level >= 3) //mercury, sulfur, crystal, gems
  2239. {
  2240. FILL_FIELD(mercSulfCrystGems, g->second.resources[Res::MERCURY] + g->second.resources[Res::SULFUR] + g->second.resources[Res::CRYSTAL] + g->second.resources[Res::GEMS])
  2241. }
  2242. if(level >= 4) //obelisks found
  2243. {
  2244. //TODO: obtainPlayersStats - obelisks found
  2245. }
  2246. if(level >= 5) //artifacts
  2247. {
  2248. FILL_FIELD(artifacts, statsHLP::getNumberOfArts(&g->second))
  2249. }
  2250. if(level >= 6) //army strength
  2251. {
  2252. FILL_FIELD(army, statsHLP::getArmyStrength(&g->second))
  2253. }
  2254. if(level >= 7) //income
  2255. {
  2256. //TODO:obtainPlayersStats - income
  2257. }
  2258. if(level >= 8) //best hero's stats
  2259. {
  2260. //already set in lvl 1 handling
  2261. }
  2262. if(level >= 9) //personality
  2263. {
  2264. for(auto g = players.cbegin(); g != players.cend(); ++g)
  2265. {
  2266. if(g->second.color == 255) //do nothing for neutral player
  2267. continue;
  2268. if(g->second.human)
  2269. {
  2270. tgi.personality[g->second.color] = EAiTactic::NONE;
  2271. }
  2272. else //AI
  2273. {
  2274. tgi.personality[g->second.color] = map->players[g->second.color].aiTactic;
  2275. }
  2276. }
  2277. }
  2278. if(level >= 10) //best creature
  2279. {
  2280. //best creatures belonging to player (highest AI value)
  2281. for(auto g = players.cbegin(); g != players.cend(); ++g)
  2282. {
  2283. if(g->second.color == 255) //do nothing for neutral player
  2284. continue;
  2285. int bestCre = -1; //best creature's ID
  2286. for(int b=0; b<g->second.heroes.size(); ++b)
  2287. {
  2288. for(TSlots::const_iterator it = g->second.heroes[b]->Slots().begin(); it != g->second.heroes[b]->Slots().end(); ++it)
  2289. {
  2290. int toCmp = it->second->type->idNumber; //ID of creature we should compare with the best one
  2291. if(bestCre == -1 || VLC->creh->creatures[bestCre]->AIValue < VLC->creh->creatures[toCmp]->AIValue)
  2292. {
  2293. bestCre = toCmp;
  2294. }
  2295. }
  2296. }
  2297. tgi.bestCreature[g->second.color] = bestCre;
  2298. }
  2299. }
  2300. #undef FILL_FIELD
  2301. }
  2302. int CGameState::lossCheck( TPlayerColor player ) const
  2303. {
  2304. const PlayerState *p = CGameInfoCallback::getPlayer(player);
  2305. //if(map->lossCondition.typeOfLossCon == lossStandard)
  2306. if(checkForStandardLoss(player))
  2307. return -1;
  2308. if (p->enteredLosingCheatCode)
  2309. {
  2310. return 1;
  2311. }
  2312. if(p->human) //special loss condition applies only to human player
  2313. {
  2314. switch(map->lossCondition.typeOfLossCon)
  2315. {
  2316. case ELossConditionType::LOSSCASTLE:
  2317. case ELossConditionType::LOSSHERO:
  2318. {
  2319. const CGObjectInstance *obj = map->lossCondition.obj;
  2320. assert(obj);
  2321. if(obj->tempOwner != player)
  2322. return 1;
  2323. }
  2324. break;
  2325. case ELossConditionType::TIMEEXPIRES:
  2326. if(map->lossCondition.timeLimit < day)
  2327. return 1;
  2328. break;
  2329. }
  2330. }
  2331. if(!p->towns.size() && p->daysWithoutCastle >= 7)
  2332. return 2;
  2333. return false;
  2334. }
  2335. bmap<ui32, ConstTransitivePtr<CGHeroInstance> > CGameState::unusedHeroesFromPool()
  2336. {
  2337. bmap<ui32, ConstTransitivePtr<CGHeroInstance> > pool = hpool.heroesPool;
  2338. for ( auto i = players.cbegin() ; i != players.cend();i++)
  2339. for(auto j = i->second.availableHeroes.cbegin(); j != i->second.availableHeroes.cend(); j++)
  2340. if(*j)
  2341. pool.erase((**j).subID);
  2342. return pool;
  2343. }
  2344. void CGameState::buildBonusSystemTree()
  2345. {
  2346. buildGlobalTeamPlayerTree();
  2347. attachArmedObjects();
  2348. BOOST_FOREACH(CGTownInstance *t, map->towns)
  2349. {
  2350. t->deserializationFix();
  2351. }
  2352. // CStackInstance <-> CCreature, CStackInstance <-> CArmedInstance, CArtifactInstance <-> CArtifact
  2353. // are provided on initializing / deserializing
  2354. }
  2355. void CGameState::deserializationFix()
  2356. {
  2357. buildGlobalTeamPlayerTree();
  2358. attachArmedObjects();
  2359. }
  2360. void CGameState::buildGlobalTeamPlayerTree()
  2361. {
  2362. for(auto k=teams.begin(); k!=teams.end(); ++k)
  2363. {
  2364. TeamState *t = &k->second;
  2365. t->attachTo(&globalEffects);
  2366. BOOST_FOREACH(ui8 teamMember, k->second.players)
  2367. {
  2368. PlayerState *p = getPlayer(teamMember);
  2369. assert(p);
  2370. p->attachTo(t);
  2371. }
  2372. }
  2373. }
  2374. void CGameState::attachArmedObjects()
  2375. {
  2376. BOOST_FOREACH(CGObjectInstance *obj, map->objects)
  2377. {
  2378. if(CArmedInstance *armed = dynamic_cast<CArmedInstance*>(obj))
  2379. armed->whatShouldBeAttached()->attachTo(armed->whereShouldBeAttached(this));
  2380. }
  2381. }
  2382. void CGameState::giveHeroArtifact(CGHeroInstance *h, int aid)
  2383. {
  2384. CArtifact * const artifact = VLC->arth->artifacts[aid]; //pointer to constant object
  2385. CArtifactInstance *ai = CArtifactInstance::createNewArtifactInstance(artifact);
  2386. map->addNewArtifactInstance(ai);
  2387. ai->putAt(ArtifactLocation(h, ai->firstAvailableSlot(h)));
  2388. }
  2389. CGPathNode::CGPathNode()
  2390. :coord(-1,-1,-1)
  2391. {
  2392. accessible = NOT_SET;
  2393. land = 0;
  2394. moveRemains = 0;
  2395. turns = 255;
  2396. theNodeBefore = NULL;
  2397. }
  2398. bool CGPathNode::reachable() const
  2399. {
  2400. return turns < 255;
  2401. }
  2402. bool CPathsInfo::getPath( const int3 &dst, CGPath &out )
  2403. {
  2404. assert(isValid);
  2405. out.nodes.clear();
  2406. const CGPathNode *curnode = &nodes[dst.x][dst.y][dst.z];
  2407. if(!curnode->theNodeBefore)
  2408. return false;
  2409. while(curnode)
  2410. {
  2411. CGPathNode cpn = *curnode;
  2412. curnode = curnode->theNodeBefore;
  2413. out.nodes.push_back(cpn);
  2414. }
  2415. return true;
  2416. }
  2417. CPathsInfo::CPathsInfo( const int3 &Sizes )
  2418. :sizes(Sizes)
  2419. {
  2420. hero = NULL;
  2421. nodes = new CGPathNode**[sizes.x];
  2422. for(int i = 0; i < sizes.x; i++)
  2423. {
  2424. nodes[i] = new CGPathNode*[sizes.y];
  2425. for (int j = 0; j < sizes.y; j++)
  2426. {
  2427. nodes[i][j] = new CGPathNode[sizes.z];
  2428. }
  2429. }
  2430. }
  2431. CPathsInfo::~CPathsInfo()
  2432. {
  2433. for(int i = 0; i < sizes.x; i++)
  2434. {
  2435. for (int j = 0; j < sizes.y; j++)
  2436. {
  2437. delete [] nodes[i][j];
  2438. }
  2439. delete [] nodes[i];
  2440. }
  2441. delete [] nodes;
  2442. }
  2443. int3 CGPath::startPos() const
  2444. {
  2445. return nodes[nodes.size()-1].coord;
  2446. }
  2447. int3 CGPath::endPos() const
  2448. {
  2449. return nodes[0].coord;
  2450. }
  2451. void CGPath::convert( ui8 mode )
  2452. {
  2453. if(mode==0)
  2454. {
  2455. for(ui32 i=0;i<nodes.size();i++)
  2456. {
  2457. nodes[i].coord = CGHeroInstance::convertPosition(nodes[i].coord,true);
  2458. }
  2459. }
  2460. }
  2461. PlayerState::PlayerState()
  2462. : color(-1), currentSelection(0xffffffff), enteredWinningCheatCode(0),
  2463. enteredLosingCheatCode(0), status(EPlayerStatus::INGAME), daysWithoutCastle(0)
  2464. {
  2465. setNodeType(PLAYER);
  2466. }
  2467. std::string PlayerState::nodeName() const
  2468. {
  2469. return "Player " + (color < VLC->generaltexth->capColors.size() ? VLC->generaltexth->capColors[color] : boost::lexical_cast<std::string>(color));
  2470. }
  2471. // void PlayerState::getParents(TCNodes &out, const CBonusSystemNode *root /*= NULL*/) const
  2472. // {
  2473. // return; //no loops possible
  2474. // }
  2475. //
  2476. // void PlayerState::getBonuses(BonusList &out, const CSelector &selector, const CBonusSystemNode *root /*= NULL*/) const
  2477. // {
  2478. // for (std::vector<CGHeroInstance *>::const_iterator it = heroes.begin(); it != heroes.end(); it++)
  2479. // {
  2480. // if (*it != root)
  2481. // (*it)->getBonuses(out, selector, this);
  2482. // }
  2483. // }
  2484. InfoAboutArmy::InfoAboutArmy():
  2485. owner(GameConstants::NEUTRAL_PLAYER)
  2486. {}
  2487. InfoAboutArmy::InfoAboutArmy(const CArmedInstance *Army, bool detailed)
  2488. {
  2489. initFromArmy(Army, detailed);
  2490. }
  2491. void InfoAboutArmy::initFromArmy(const CArmedInstance *Army, bool detailed)
  2492. {
  2493. army = ArmyDescriptor(Army, detailed);
  2494. owner = Army->tempOwner;
  2495. name = Army->getHoverText();
  2496. }
  2497. void InfoAboutHero::assign(const InfoAboutHero & iah)
  2498. {
  2499. InfoAboutArmy::operator = (iah);
  2500. details = (iah.details ? new Details(*iah.details) : NULL);
  2501. hclass = iah.hclass;
  2502. portrait = iah.portrait;
  2503. }
  2504. InfoAboutHero::InfoAboutHero():
  2505. details(nullptr),
  2506. hclass(nullptr),
  2507. portrait(-1)
  2508. {}
  2509. InfoAboutHero::InfoAboutHero(const InfoAboutHero & iah):
  2510. InfoAboutArmy()
  2511. {
  2512. assign(iah);
  2513. }
  2514. InfoAboutHero::InfoAboutHero(const CGHeroInstance *h, bool detailed)
  2515. : details(nullptr),
  2516. hclass(nullptr),
  2517. portrait(-1)
  2518. {
  2519. initFromHero(h, detailed);
  2520. }
  2521. InfoAboutHero::~InfoAboutHero()
  2522. {
  2523. delete details;
  2524. }
  2525. InfoAboutHero & InfoAboutHero::operator=(const InfoAboutHero & iah)
  2526. {
  2527. assign(iah);
  2528. return *this;
  2529. }
  2530. void InfoAboutHero::initFromHero(const CGHeroInstance *h, bool detailed)
  2531. {
  2532. if(!h)
  2533. return;
  2534. initFromArmy(h, detailed);
  2535. hclass = h->type->heroClass;
  2536. name = h->name;
  2537. portrait = h->portrait;
  2538. if(detailed)
  2539. {
  2540. //include details about hero
  2541. details = new Details;
  2542. details->luck = h->LuckVal();
  2543. details->morale = h->MoraleVal();
  2544. details->mana = h->mana;
  2545. details->primskills.resize(GameConstants::PRIMARY_SKILLS);
  2546. for (int i = 0; i < GameConstants::PRIMARY_SKILLS ; i++)
  2547. {
  2548. details->primskills[i] = h->getPrimSkillLevel(static_cast<PrimarySkill::PrimarySkill>(i));
  2549. }
  2550. }
  2551. }
  2552. InfoAboutTown::InfoAboutTown():
  2553. details(nullptr),
  2554. tType(nullptr),
  2555. built(0),
  2556. fortLevel(0)
  2557. {
  2558. }
  2559. InfoAboutTown::InfoAboutTown(const CGTownInstance *t, bool detailed)
  2560. {
  2561. initFromTown(t, detailed);
  2562. }
  2563. InfoAboutTown::~InfoAboutTown()
  2564. {
  2565. delete details;
  2566. }
  2567. void InfoAboutTown::initFromTown(const CGTownInstance *t, bool detailed)
  2568. {
  2569. initFromArmy(t, detailed);
  2570. army = ArmyDescriptor(t->getUpperArmy(), detailed);
  2571. built = t->builded;
  2572. fortLevel = t->fortLevel();
  2573. name = t->name;
  2574. tType = t->town;
  2575. if(detailed)
  2576. {
  2577. //include details about hero
  2578. details = new Details;
  2579. details->goldIncome = t->dailyIncome();
  2580. details->customRes = t->hasBuilt(BuildingID::RESOURCE_SILO);
  2581. details->hallLevel = t->hallLevel();
  2582. details->garrisonedHero = t->garrisonHero;
  2583. }
  2584. }
  2585. ArmyDescriptor::ArmyDescriptor(const CArmedInstance *army, bool detailed)
  2586. : isDetailed(detailed)
  2587. {
  2588. for(TSlots::const_iterator i = army->Slots().begin(); i != army->Slots().end(); i++)
  2589. {
  2590. if(detailed)
  2591. (*this)[i->first] = *i->second;
  2592. else
  2593. (*this)[i->first] = CStackBasicDescriptor(i->second->type, i->second->getQuantityID());
  2594. }
  2595. }
  2596. ArmyDescriptor::ArmyDescriptor()
  2597. : isDetailed(false)
  2598. {
  2599. }
  2600. int ArmyDescriptor::getStrength() const
  2601. {
  2602. ui64 ret = 0;
  2603. if(isDetailed)
  2604. {
  2605. for(const_iterator i = begin(); i != end(); i++)
  2606. ret += i->second.type->AIValue * i->second.count;
  2607. }
  2608. else
  2609. {
  2610. for(const_iterator i = begin(); i != end(); i++)
  2611. ret += i->second.type->AIValue * CCreature::estimateCreatureCount(i->second.count);
  2612. }
  2613. return ret;
  2614. }
  2615. DuelParameters::SideSettings::StackSettings::StackSettings()
  2616. : type(CreatureID::NONE), count(0)
  2617. {
  2618. }
  2619. DuelParameters::SideSettings::StackSettings::StackSettings(CreatureID Type, si32 Count)
  2620. : type(Type), count(Count)
  2621. {
  2622. }
  2623. DuelParameters::SideSettings::SideSettings()
  2624. {
  2625. heroId = -1;
  2626. }
  2627. DuelParameters::DuelParameters()
  2628. {
  2629. terType = ETerrainType::DIRT;
  2630. bfieldType = BFieldType::ROCKLANDS;
  2631. }
  2632. DuelParameters DuelParameters::fromJSON(const std::string &fname)
  2633. {
  2634. DuelParameters ret;
  2635. const JsonNode duelData(ResourceID("DATA/" + fname, EResType::TEXT));
  2636. ret.terType = static_cast<ETerrainType::ETerrainType>((int)duelData["terType"].Float());
  2637. ret.bfieldType = static_cast<BFieldType::BFieldType>((int)duelData["bfieldType"].Float());
  2638. BOOST_FOREACH(const JsonNode &n, duelData["sides"].Vector())
  2639. {
  2640. SideSettings &ss = ret.sides[(int)n["side"].Float()];
  2641. int i = 0;
  2642. BOOST_FOREACH(const JsonNode &stackNode, n["army"].Vector())
  2643. {
  2644. ss.stacks[i].type = CreatureID((si32)stackNode.Vector()[0].Float());
  2645. ss.stacks[i].count = stackNode.Vector()[1].Float();
  2646. i++;
  2647. }
  2648. if(n["heroid"].getType() == JsonNode::DATA_FLOAT)
  2649. ss.heroId = n["heroid"].Float();
  2650. else
  2651. ss.heroId = -1;
  2652. BOOST_FOREACH(const JsonNode &n, n["heroPrimSkills"].Vector())
  2653. ss.heroPrimSkills.push_back(n.Float());
  2654. BOOST_FOREACH(const JsonNode &skillNode, n["heroSecSkills"].Vector())
  2655. {
  2656. std::pair<si32, si8> secSkill;
  2657. secSkill.first = skillNode.Vector()[0].Float();
  2658. secSkill.second = skillNode.Vector()[1].Float();
  2659. ss.heroSecSkills.push_back(secSkill);
  2660. }
  2661. assert(ss.heroPrimSkills.empty() || ss.heroPrimSkills.size() == GameConstants::PRIMARY_SKILLS);
  2662. if(ss.heroId != -1)
  2663. {
  2664. const JsonNode & spells = n["spells"];
  2665. if(spells.getType() == JsonNode::DATA_STRING && spells.String() == "all")
  2666. {
  2667. BOOST_FOREACH(auto spell, VLC->spellh->spells)
  2668. if(spell->id <= SpellID::SUMMON_AIR_ELEMENTAL)
  2669. ss.spells.insert(spell->id);
  2670. }
  2671. else
  2672. BOOST_FOREACH(const JsonNode &spell, n["spells"].Vector())
  2673. ss.spells.insert(SpellID(spell.Float()));
  2674. }
  2675. }
  2676. BOOST_FOREACH(const JsonNode &n, duelData["obstacles"].Vector())
  2677. {
  2678. auto oi = make_shared<CObstacleInstance>();
  2679. if(n.getType() == JsonNode::DATA_VECTOR)
  2680. {
  2681. oi->ID = n.Vector()[0].Float();
  2682. oi->pos = n.Vector()[1].Float();
  2683. }
  2684. else
  2685. {
  2686. assert(n.getType() == JsonNode::DATA_FLOAT);
  2687. oi->ID = 21;
  2688. oi->pos = n.Float();
  2689. }
  2690. oi->uniqueID = ret.obstacles.size();
  2691. ret.obstacles.push_back(oi);
  2692. }
  2693. BOOST_FOREACH(const JsonNode &n, duelData["creatures"].Vector())
  2694. {
  2695. CusomCreature cc;
  2696. cc.id = n["id"].Float();
  2697. #define retreive(name) \
  2698. if(n[ #name ].getType() == JsonNode::DATA_FLOAT)\
  2699. cc.name = n[ #name ].Float(); \
  2700. else \
  2701. cc.name = -1;
  2702. retreive(attack);
  2703. retreive(defense);
  2704. retreive(HP);
  2705. retreive(dmg);
  2706. retreive(shoots);
  2707. retreive(speed);
  2708. ret.creatures.push_back(cc);
  2709. }
  2710. return ret;
  2711. }
  2712. TeamState::TeamState()
  2713. {
  2714. setNodeType(TEAM);
  2715. }
  2716. void CPathfinder::initializeGraph()
  2717. {
  2718. CGPathNode ***graph = out.nodes;
  2719. for(size_t i=0; i < out.sizes.x; ++i)
  2720. {
  2721. for(size_t j=0; j < out.sizes.y; ++j)
  2722. {
  2723. for(size_t k=0; k < out.sizes.z; ++k)
  2724. {
  2725. curPos = int3(i,j,k);
  2726. const TerrainTile *tinfo = &gs->map->terrain[i][j][k];
  2727. CGPathNode &node = graph[i][j][k];
  2728. node.accessible = evaluateAccessibility(tinfo);
  2729. node.turns = 0xff;
  2730. node.moveRemains = 0;
  2731. node.coord.x = i;
  2732. node.coord.y = j;
  2733. node.coord.z = k;
  2734. node.land = tinfo->terType != ETerrainType::WATER;
  2735. node.theNodeBefore = NULL;
  2736. }
  2737. }
  2738. }
  2739. }
  2740. void CPathfinder::calculatePaths(int3 src /*= int3(-1,-1,-1)*/, int movement /*= -1*/)
  2741. {
  2742. assert(hero);
  2743. assert(hero == getHero(hero->id));
  2744. if(src.x < 0)
  2745. src = hero->getPosition(false);
  2746. if(movement < 0)
  2747. movement = hero->movement;
  2748. out.hero = hero;
  2749. out.hpos = src;
  2750. if(!gs->map->isInTheMap(src)/* || !gs->map->isInTheMap(dest)*/) //check input
  2751. {
  2752. tlog1 << "CGameState::calculatePaths: Hero outside the gs->map? How dare you...\n";
  2753. return;
  2754. }
  2755. initializeGraph();
  2756. //initial tile - set cost on 0 and add to the queue
  2757. CGPathNode &initialNode = *getNode(src);
  2758. initialNode.turns = 0;
  2759. initialNode.moveRemains = movement;
  2760. mq.push_back(&initialNode);
  2761. std::vector<int3> neighbours;
  2762. neighbours.reserve(16);
  2763. while(!mq.empty())
  2764. {
  2765. cp = mq.front();
  2766. mq.pop_front();
  2767. const int3 sourceGuardPosition = guardingCreaturePosition(cp->coord);
  2768. bool guardedSource = (sourceGuardPosition != int3(-1, -1, -1) && cp->coord != src);
  2769. ct = &gs->map->getTile(cp->coord);
  2770. int movement = cp->moveRemains, turn = cp->turns;
  2771. if(!movement)
  2772. {
  2773. movement = hero->maxMovePoints(cp->land);
  2774. turn++;
  2775. }
  2776. //add accessible neighbouring nodes to the queue
  2777. neighbours.clear();
  2778. //handling subterranean gate => it's exit is the only neighbour
  2779. bool subterraneanEntry = (ct->topVisitableId() == Obj::SUBTERRANEAN_GATE && useSubterraneanGates);
  2780. if(subterraneanEntry)
  2781. {
  2782. //try finding the exit gate
  2783. if(const CGObjectInstance *outGate = getObj(CGTeleport::getMatchingGate(ct->visitableObjects.back()->id), false))
  2784. {
  2785. const int3 outPos = outGate->visitablePos();
  2786. //gs->getNeighbours(*getTile(outPos), outPos, neighbours, boost::logic::indeterminate, !cp->land);
  2787. neighbours.push_back(outPos);
  2788. }
  2789. else
  2790. {
  2791. //gate with no exit (blocked) -> do nothing with this node
  2792. continue;
  2793. }
  2794. }
  2795. gs->getNeighbours(*ct, cp->coord, neighbours, boost::logic::indeterminate, !cp->land);
  2796. for(ui32 i=0; i < neighbours.size(); i++)
  2797. {
  2798. const int3 &n = neighbours[i]; //current neighbor
  2799. dp = getNode(n);
  2800. dt = &gs->map->getTile(n);
  2801. destTopVisObjID = dt->topVisitableId();
  2802. useEmbarkCost = 0; //0 - usual movement; 1 - embark; 2 - disembark
  2803. int turnAtNextTile = turn;
  2804. const bool destIsGuardian = sourceGuardPosition == n;
  2805. if(!goodForLandSeaTransition())
  2806. continue;
  2807. if(!canMoveBetween(cp->coord, dp->coord) || dp->accessible == CGPathNode::BLOCKED )
  2808. continue;
  2809. //special case -> hero embarked a boat standing on a guarded tile -> we must allow to move away from that tile
  2810. if(cp->accessible == CGPathNode::VISITABLE && guardedSource && cp->theNodeBefore->land && ct->topVisitableId() == Obj::BOAT)
  2811. guardedSource = false;
  2812. int cost = gs->getMovementCost(hero, cp->coord, dp->coord, movement);
  2813. //special case -> moving from src Subterranean gate to dest gate -> it's free
  2814. if(subterraneanEntry && destTopVisObjID == Obj::SUBTERRANEAN_GATE && cp->coord.z != dp->coord.z)
  2815. cost = 0;
  2816. int remains = movement - cost;
  2817. if(useEmbarkCost)
  2818. {
  2819. remains = hero->movementPointsAfterEmbark(movement, cost, useEmbarkCost - 1);
  2820. cost = movement - remains;
  2821. }
  2822. if(remains < 0)
  2823. {
  2824. //occurs rarely, when hero with low movepoints tries to leave the road
  2825. turnAtNextTile++;
  2826. int moveAtNextTile = hero->maxMovePoints(cp->land);
  2827. cost = gs->getMovementCost(hero, cp->coord, dp->coord, moveAtNextTile); //cost must be updated, movement points changed :(
  2828. remains = moveAtNextTile - cost;
  2829. }
  2830. if((dp->turns==0xff //we haven't been here before
  2831. || dp->turns > turnAtNextTile
  2832. || (dp->turns >= turnAtNextTile && dp->moveRemains < remains)) //this route is faster
  2833. && (!guardedSource || destIsGuardian)) // Can step into tile of guard
  2834. {
  2835. assert(dp != cp->theNodeBefore); //two tiles can't point to each other
  2836. dp->moveRemains = remains;
  2837. dp->turns = turnAtNextTile;
  2838. dp->theNodeBefore = cp;
  2839. const bool guardedDst = guardingCreaturePosition(dp->coord) != int3(-1, -1, -1)
  2840. && dp->accessible == CGPathNode::BLOCKVIS;
  2841. if (dp->accessible == CGPathNode::ACCESSIBLE
  2842. || (useEmbarkCost && allowEmbarkAndDisembark)
  2843. || destTopVisObjID == Obj::SUBTERRANEAN_GATE
  2844. || (guardedDst && !guardedSource)) // Can step into a hostile tile once.
  2845. {
  2846. mq.push_back(dp);
  2847. }
  2848. }
  2849. } //neighbours loop
  2850. } //queue loop
  2851. out.isValid = true;
  2852. }
  2853. CGPathNode *CPathfinder::getNode(const int3 &coord)
  2854. {
  2855. return &out.nodes[coord.x][coord.y][coord.z];
  2856. }
  2857. bool CPathfinder::canMoveBetween(const int3 &a, const int3 &b) const
  2858. {
  2859. return gs->checkForVisitableDir(a, b) && gs->checkForVisitableDir(b, a);
  2860. }
  2861. CGPathNode::EAccessibility CPathfinder::evaluateAccessibility(const TerrainTile *tinfo) const
  2862. {
  2863. CGPathNode::EAccessibility ret = (tinfo->blocked ? CGPathNode::BLOCKED : CGPathNode::ACCESSIBLE);
  2864. if(tinfo->terType == ETerrainType::ROCK || !FoW[curPos.x][curPos.y][curPos.z])
  2865. return CGPathNode::BLOCKED;
  2866. if(tinfo->visitable)
  2867. {
  2868. if(tinfo->visitableObjects.front()->ID == Obj::SANCTUARY && tinfo->visitableObjects.back()->ID == Obj::HERO && tinfo->visitableObjects.back()->tempOwner != hero->tempOwner) //non-owned hero stands on Sanctuary
  2869. {
  2870. return CGPathNode::BLOCKED;
  2871. }
  2872. else
  2873. {
  2874. BOOST_FOREACH(const CGObjectInstance *obj, tinfo->visitableObjects)
  2875. {
  2876. if(obj->getPassableness() & 1<<hero->tempOwner) //special object instance specific passableness flag - overwrites other accessibility flags
  2877. {
  2878. ret = CGPathNode::ACCESSIBLE;
  2879. }
  2880. else if(obj->blockVisit)
  2881. {
  2882. return CGPathNode::BLOCKVIS;
  2883. }
  2884. else if(obj->ID != Obj::EVENT) //pathfinder should ignore placed events
  2885. {
  2886. ret = CGPathNode::VISITABLE;
  2887. }
  2888. }
  2889. }
  2890. }
  2891. else if (gs->map->isInTheMap(guardingCreaturePosition(curPos))
  2892. && !tinfo->blocked)
  2893. {
  2894. // Monster close by; blocked visit for battle.
  2895. return CGPathNode::BLOCKVIS;
  2896. }
  2897. return ret;
  2898. }
  2899. bool CPathfinder::goodForLandSeaTransition()
  2900. {
  2901. if(cp->land != dp->land) //hero can traverse land<->sea only in special circumstances
  2902. {
  2903. if(cp->land) //from land to sea -> embark or assault hero on boat
  2904. {
  2905. if(dp->accessible == CGPathNode::ACCESSIBLE || destTopVisObjID < 0) //cannot enter empty water tile from land -> it has to be visitable
  2906. return false;
  2907. if(destTopVisObjID != Obj::HERO && destTopVisObjID != Obj::BOAT) //only boat or hero can be accessed from land
  2908. return false;
  2909. if(destTopVisObjID == Obj::BOAT)
  2910. useEmbarkCost = 1;
  2911. }
  2912. else //disembark
  2913. {
  2914. //can disembark only on coastal tiles
  2915. if(!dt->isCoastal())
  2916. return false;
  2917. //tile must be accessible -> exception: unblocked blockvis tiles -> clear but guarded by nearby monster coast
  2918. if( (dp->accessible != CGPathNode::ACCESSIBLE && (dp->accessible != CGPathNode::BLOCKVIS || dt->blocked))
  2919. || dt->visitable) //TODO: passableness problem -> town says it's passable (thus accessible) but we obviously can't disembark onto town gate
  2920. return false;;
  2921. useEmbarkCost = 2;
  2922. }
  2923. }
  2924. return true;
  2925. }
  2926. CPathfinder::CPathfinder(CPathsInfo &_out, CGameState *_gs, const CGHeroInstance *_hero) : CGameInfoCallback(_gs, boost::optional<TPlayerColor>()), out(_out), hero(_hero), FoW(getPlayerTeam(hero->tempOwner)->fogOfWarMap)
  2927. {
  2928. useSubterraneanGates = true;
  2929. allowEmbarkAndDisembark = true;
  2930. }