2019-03-13 15:21:24 +02:00
|
|
|
/*
|
|
|
|
* BuildingManager.cpp, part of VCMI engine
|
|
|
|
*
|
|
|
|
* Authors: listed in file AUTHORS in main folder
|
|
|
|
*
|
|
|
|
* License: GNU General Public License v2.0 or later
|
|
|
|
* Full text of license available in license.txt file, in main folder
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "StdInc.h"
|
|
|
|
#include "ArmyManager.h"
|
|
|
|
|
|
|
|
#include "../../CCallback.h"
|
|
|
|
#include "../../lib/mapObjects/MapObjects.h"
|
|
|
|
|
|
|
|
void ArmyManager::init(CPlayerSpecificInfoCallback * CB)
|
|
|
|
{
|
|
|
|
cb = CB;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ArmyManager::setAI(VCAI * AI)
|
|
|
|
{
|
|
|
|
ai = AI;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<SlotInfo> ArmyManager::getSortedSlots(const CCreatureSet * target, const CCreatureSet * source) const
|
|
|
|
{
|
|
|
|
const CCreatureSet * armies[] = { target, source };
|
|
|
|
|
|
|
|
//we calculate total strength for each creature type available in armies
|
|
|
|
std::map<const CCreature *, SlotInfo> creToPower;
|
|
|
|
std::vector<SlotInfo> resultingArmy;
|
|
|
|
|
|
|
|
for(auto armyPtr : armies)
|
|
|
|
{
|
|
|
|
for(auto & i : armyPtr->Slots())
|
|
|
|
{
|
2023-04-05 02:26:29 +02:00
|
|
|
auto cre = dynamic_cast<const CCreature*>(i.second->type);
|
|
|
|
auto & slotInfp = creToPower[cre];
|
2019-03-13 15:21:24 +02:00
|
|
|
|
2023-04-05 02:26:29 +02:00
|
|
|
slotInfp.creature = cre;
|
2019-03-13 15:21:24 +02:00
|
|
|
slotInfp.power += i.second->getPower();
|
|
|
|
slotInfp.count += i.second->count;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for(auto pair : creToPower)
|
|
|
|
resultingArmy.push_back(pair.second);
|
|
|
|
|
2019-03-23 14:11:57 +02:00
|
|
|
boost::sort(resultingArmy, [](const SlotInfo & left, const SlotInfo & right) -> bool
|
2019-03-13 15:21:24 +02:00
|
|
|
{
|
|
|
|
return left.power > right.power;
|
|
|
|
});
|
|
|
|
|
|
|
|
return resultingArmy;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<SlotInfo>::iterator ArmyManager::getWeakestCreature(std::vector<SlotInfo> & army) const
|
|
|
|
{
|
2019-03-23 14:11:57 +02:00
|
|
|
auto weakest = boost::min_element(army, [](const SlotInfo & left, const SlotInfo & right) -> bool
|
2019-03-13 15:21:24 +02:00
|
|
|
{
|
2023-04-05 02:26:29 +02:00
|
|
|
if(left.creature->getLevel() != right.creature->getLevel())
|
|
|
|
return left.creature->getLevel() < right.creature->getLevel();
|
2019-03-13 15:21:24 +02:00
|
|
|
|
2023-05-02 00:05:59 +02:00
|
|
|
return left.creature->speed() > right.creature->speed();
|
2019-03-13 15:21:24 +02:00
|
|
|
});
|
|
|
|
|
|
|
|
return weakest;
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<SlotInfo> ArmyManager::getBestArmy(const CCreatureSet * target, const CCreatureSet * source) const
|
|
|
|
{
|
|
|
|
auto resultingArmy = getSortedSlots(target, source);
|
|
|
|
|
|
|
|
if(resultingArmy.size() > GameConstants::ARMY_SIZE)
|
|
|
|
{
|
|
|
|
resultingArmy.resize(GameConstants::ARMY_SIZE);
|
|
|
|
}
|
|
|
|
else if(source->needsLastStack())
|
|
|
|
{
|
|
|
|
auto weakest = getWeakestCreature(resultingArmy);
|
|
|
|
|
|
|
|
if(weakest->count == 1)
|
|
|
|
{
|
|
|
|
resultingArmy.erase(weakest);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
weakest->power -= weakest->power / weakest->count;
|
|
|
|
weakest->count--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return resultingArmy;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ArmyManager::canGetArmy(const CArmedInstance * target, const CArmedInstance * source) const
|
|
|
|
{
|
|
|
|
//TODO: merge with pickBestCreatures
|
|
|
|
//if (ai->primaryHero().h == source)
|
|
|
|
if(target->tempOwner != source->tempOwner)
|
|
|
|
{
|
|
|
|
logAi->error("Why are we even considering exchange between heroes from different players?");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0 < howManyReinforcementsCanGet(target, source);
|
|
|
|
}
|
|
|
|
|
|
|
|
ui64 ArmyManager::howManyReinforcementsCanBuy(const CCreatureSet * h, const CGDwelling * t) const
|
|
|
|
{
|
|
|
|
ui64 aivalue = 0;
|
|
|
|
TResources availableRes = cb->getResourceAmount();
|
|
|
|
int freeHeroSlots = GameConstants::ARMY_SIZE - h->stacksCount();
|
|
|
|
|
2022-05-19 14:14:50 +02:00
|
|
|
for(auto const & dc : t->creatures)
|
2019-03-13 15:21:24 +02:00
|
|
|
{
|
|
|
|
creInfo ci = infoFromDC(dc);
|
|
|
|
|
|
|
|
if(!ci.count || ci.creID == -1)
|
|
|
|
continue;
|
|
|
|
|
2023-04-05 02:26:29 +02:00
|
|
|
vstd::amin(ci.count, availableRes / ci.cre->getFullRecruitCost()); //max count we can afford
|
2019-03-13 15:21:24 +02:00
|
|
|
|
|
|
|
if(ci.count && ci.creID != -1) //valid creature at this level
|
|
|
|
{
|
|
|
|
//can be merged with another stack?
|
|
|
|
SlotID dst = h->getSlotFor(ci.creID);
|
|
|
|
if(!h->hasStackAtSlot(dst)) //need another new slot for this stack
|
|
|
|
{
|
|
|
|
if(!freeHeroSlots) //no more place for stacks
|
|
|
|
continue;
|
|
|
|
else
|
|
|
|
freeHeroSlots--; //new slot will be occupied
|
|
|
|
}
|
|
|
|
|
|
|
|
//we found matching occupied or free slot
|
2023-04-05 02:26:29 +02:00
|
|
|
aivalue += ci.count * ci.cre->getAIValue();
|
|
|
|
availableRes -= ci.cre->getFullRecruitCost() * ci.count;
|
2019-03-13 15:21:24 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return aivalue;
|
|
|
|
}
|
|
|
|
|
|
|
|
ui64 ArmyManager::howManyReinforcementsCanGet(const CCreatureSet * target, const CCreatureSet * source) const
|
|
|
|
{
|
|
|
|
auto bestArmy = getBestArmy(target, source);
|
|
|
|
uint64_t newArmy = 0;
|
|
|
|
uint64_t oldArmy = target->getArmyStrength();
|
|
|
|
|
|
|
|
for(auto & slot : bestArmy)
|
|
|
|
{
|
|
|
|
newArmy += slot.power;
|
|
|
|
}
|
|
|
|
|
|
|
|
return newArmy > oldArmy ? newArmy - oldArmy : 0;
|
|
|
|
}
|