/// Value of this site for a settler
int CvSiteEvaluatorForSettler::PlotFoundValue(CvPlot* pPlot, CvPlayer* pPlayer, YieldTypes eYield, bool bCoastOnly)
{
CvAssert(pPlot);
if(!pPlot) return 0;
if(!CanFound(pPlot, pPlayer, true))
{
return 0;
}
// Is there any reason this site doesn't work for a settler?
//
// First must be on coast if settling a new continent
bool bIsCoastal = pPlot->isCoastalLand(GC.getMIN_WATER_SIZE_FOR_OCEAN());
CvArea* pArea = pPlot->area();
CvAssert(pArea);
if(!pArea) return 0;
int iNumAreaCities = pArea->getCitiesPerPlayer(pPlayer->GetID());
if(bCoastOnly && !bIsCoastal && iNumAreaCities == 0)
{
return 0;
}
// Seems okay for a settler, use base class to determine exact value
else
{
return CvCitySiteEvaluator::PlotFoundValue(pPlot, pPlayer, eYield);
}
}
//------------------------------------------------------------------------------
//bool isWater();
int CvLuaArea::lIsWater(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const bool bResult = pkArea->isWater();
lua_pushboolean(L, bResult);
return 1;
}
void CvMap::calculateAreas()
{
PROFILE_FUNC();
CvPlot* pLoopPlot;
CvArea* pArea;
int iArea;
int iI;
for (iI = 0; iI < numPlotsINLINE(); iI++)
{
pLoopPlot = plotByIndexINLINE(iI);
gDLL->callUpdater();
FAssertMsg(pLoopPlot != NULL, "LoopPlot is not assigned a valid value");
if (pLoopPlot->getArea() == FFreeList::INVALID_INDEX)
{
pArea = addArea();
pArea->init(pArea->getID(), pLoopPlot->isWater());
iArea = pArea->getID();
pLoopPlot->setArea(iArea);
gDLL->getFAStarIFace()->GeneratePath(&GC.getAreaFinder(), pLoopPlot->getX_INLINE(), pLoopPlot->getY_INLINE(), -1, -1, pLoopPlot->isWater(), iArea);
}
}
}
//------------------------------------------------------------------------------
//int getNumTotalResources();
int CvLuaArea::lGetNumTotalResources(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const int iResult = pkArea->getNumTotalResources();
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//int getTotalPopulation();
int CvLuaArea::lGetTotalPopulation(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const int iResult = pkArea->getTotalPopulation();
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//int getID();
int CvLuaArea::lGetID(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const int iResult = pkArea->GetID();
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//int countCoastalLand();
int CvLuaArea::lCountCoastalLand(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const int iResult = pkArea->countCoastalLand();
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//int countNumUniqueResourceTypes();
int CvLuaArea::lCountNumUniqueResourceTypes(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const int iResult = pkArea->countNumUniqueResourceTypes();
lua_pushinteger(L, iResult);
return 1;
}
//int calculateTotalBestNatureYield();
int CvLuaArea::lCalculateTotalBestNatureYield(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const int iResult = pkArea->calculateTotalBestNatureYield();
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//int getNumImprovements(ImprovementTypes eImprovement);
int CvLuaArea::lGetNumImprovements(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const ImprovementTypes eImprovement = (ImprovementTypes)lua_tointeger(L, 2);
const int iResult = pkArea->getNumImprovements(eImprovement);
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//CyCity* getTargetCity(PlayerTypes eIndex);
int CvLuaArea::lGetTargetCity(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const PlayerTypes eIndex = (PlayerTypes)lua_tointeger(L, 2);
CvCity* pkCity = pkArea->getTargetCity(eIndex);
CvLuaCity::Push(L, pkCity);
return 1;
}
//------------------------------------------------------------------------------
//int getNumUnrevealedTiles(TeamTypes eIndex);
int CvLuaArea::lGetNumUnrevealedTiles(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const TeamTypes eIndex = (TeamTypes)lua_tointeger(L, 2);
const int iResult = pkArea->getNumUnrevealedTiles(eIndex);
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//int getFreeSpecialist(PlayerTypes eIndex);
int CvLuaArea::lGetFreeSpecialist(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const PlayerTypes eIndex = (PlayerTypes)lua_tointeger(L, 2);
const int iResult = pkArea->getFreeSpecialist(eIndex);
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//int getPopulationPerPlayer(PlayerTypes eIndex);
int CvLuaArea::lGetPopulationPerPlayer(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const PlayerTypes eIndex = (PlayerTypes)lua_tointeger(L, 2);
const int iResult = pkArea->getPopulationPerPlayer(eIndex);
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//int getNumResources(ResourceTypes eResource);
int CvLuaArea::lGetNumResources(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const ResourceTypes eResource = (ResourceTypes)lua_tointeger(L, 2);
const int iResult = pkArea->getNumResources(eResource);
lua_pushinteger(L, iResult);
return 1;
}
//------------------------------------------------------------------------------
//int getYieldRateModifier(PlayerTypes eIndex1, YieldTypes eIndex2);
int CvLuaArea::lGetYieldRateModifier(lua_State* L)
{
CvArea* pkArea = GetInstance(L);
const PlayerTypes eIndex1 = (PlayerTypes)lua_tointeger(L, 2);
const YieldTypes eIndex2 = (YieldTypes)lua_tointeger(L, 3);
const int iResult = pkArea->getYieldRateModifier(eIndex1, eIndex2);
lua_pushinteger(L, iResult);
return 1;
}
void CvMapGenerator::addGoodies()
{
PROFILE("CvMapGenerator::addGoodies");
if (gDLL->getPythonIFace()->callFunction(gDLL->getPythonIFace()->getMapScriptModule(), "addGoodies"))
{
if (!gDLL->getPythonIFace()->pythonUsingDefaultImpl())
{
return; // Python override
}
}
gDLL->NiTextOut("Adding Goodies...");
if (GC.getEraInfo(GC.getGameINLINE().getStartEra()).isNoGoodies())
{
return;
}
int iNumPlots = GC.getMapINLINE().numPlotsINLINE();
int* piShuffle = shuffle(iNumPlots, GC.getGameINLINE().getMapRand());
for (int iI = 0; iI < GC.getNumImprovementInfos(); iI++)
{
if (GC.getImprovementInfo((ImprovementTypes)iI).isGoody() && GC.getImprovementInfo((ImprovementTypes)iI).getTilesPerGoody() > 0)
{
for (int iJ = 0; iJ < iNumPlots; iJ++)
{
gDLL->callUpdater();
CvPlot *pPlot = GC.getMapINLINE().plotByIndexINLINE(piShuffle[iJ]);
FAssertMsg(pPlot, "pPlot is expected not to be NULL");
if (!(pPlot->isWater()))
{
CvArea *pArea = GC.getMapINLINE().getArea(pPlot->getArea());
FAssertMsg(pArea, "pArea is expected not to be NULL");
if (pArea->getNumImprovements((ImprovementTypes)iI) < ((pArea->getNumTiles() + (GC.getImprovementInfo((ImprovementTypes)iI).getTilesPerGoody() / 2)) / GC.getImprovementInfo((ImprovementTypes) iI).getTilesPerGoody()))
{
if (canPlaceGoodyAt(((ImprovementTypes)iI), pPlot->getX_INLINE(), pPlot->getY_INLINE()))
{
pPlot->setImprovementType((ImprovementTypes)iI);
}
}
}
}
}
}
SAFE_DELETE_ARRAY(piShuffle);
}
void CvMapGenerator::addGoodies()
{
PROFILE_FUNC();
if (gDLL->getPythonIFace()->pythonAddGoodies() && !gDLL->getPythonIFace()->pythonUsingDefaultImpl())
{
return; // Python override
}
gDLL->NiTextOut("Adding Goodies...");
if (GC.getEraInfo(GC.getGameINLINE().getStartEra()).isNoGoodies())
{
return;
}
int iNumPlots = GC.getMapINLINE().numPlotsINLINE();
std::vector<int> aiShuffle(iNumPlots);
GC.getGameINLINE().getMapRand().shuffleSequence(aiShuffle, "addNonUniqueBonusType shuffle");
for (int iI = 0; iI < GC.getNumImprovementInfos(); iI++)
{
if (GC.getImprovementInfo((ImprovementTypes)iI).isGoody() && GC.getImprovementInfo((ImprovementTypes)iI).getTilesPerGoody() > 0)
{
for (int iJ = 0; iJ < iNumPlots; iJ++)
{
gDLL->callUpdater();
CvPlot *pPlot = GC.getMapINLINE().plotByIndexINLINE(aiShuffle[iJ]);
FAssertMsg(pPlot, "pPlot is expected not to be NULL");
if (!(pPlot->isWater()))
{
CvArea *pArea = GC.getMapINLINE().getArea(pPlot->getArea());
FAssertMsg(pArea, "pArea is expected not to be NULL");
if (pArea->getNumImprovements((ImprovementTypes)iI) < ((pArea->getNumTiles() + (GC.getImprovementInfo((ImprovementTypes)iI).getTilesPerGoody() / 2)) / GC.getImprovementInfo((ImprovementTypes) iI).getTilesPerGoody()))
{
if (canPlaceGoodyAt(((ImprovementTypes)iI), pPlot->getX_INLINE(), pPlot->getY_INLINE()))
{
pPlot->setImprovementType((ImprovementTypes)iI);
}
}
}
}
}
}
}
int CvMap::getNumLandAreas()
{
CvArea* pLoopArea;
int iNumLandAreas;
int iLoop;
iNumLandAreas = 0;
for(pLoopArea = GC.getMap().firstArea(&iLoop); pLoopArea != NULL; pLoopArea = GC.getMap().nextArea(&iLoop))
{
if (!(pLoopArea->isWater()))
{
iNumLandAreas++;
}
}
return iNumLandAreas;
}
/// Value of this site for a settler
int CvSiteEvaluatorForSettler::PlotFoundValue(CvPlot* pPlot, CvPlayer* pPlayer, YieldTypes eYield, bool bCoastOnly)
{
CvAssert(pPlot);
if(!pPlot) return 0;
if(!CanFound(pPlot, pPlayer, true))
{
return 0;
}
// Is there any reason this site doesn't work for a settler?
//
// First must be on coast if settling a new continent
bool bIsCoastal = pPlot->isCoastalLand(GC.getMIN_WATER_SIZE_FOR_OCEAN());
CvArea* pArea = pPlot->area();
CvAssert(pArea);
if(!pArea) return 0;
int iNumAreaCities = pArea->getCitiesPerPlayer(pPlayer->GetID());
if(bCoastOnly && !bIsCoastal && iNumAreaCities == 0)
{
return 0;
}
// Seems okay for a settler, use base class to determine exact value
else
{
// if the civ gets a benefit from settling on a new continent (ie: Indonesia)
// double the fertility of that plot
int iLuxuryModifier = 0;
if (pPlayer->GetPlayerTraits()->WillGetUniqueLuxury(pArea))
{
iLuxuryModifier = CvCitySiteEvaluator::PlotFoundValue(pPlot, pPlayer, eYield) * 2;
return iLuxuryModifier;
}
else
{
return CvCitySiteEvaluator::PlotFoundValue(pPlot, pPlayer, eYield);
}
}
}
CvArea* CvMap::findBiggestArea(bool bWater)
{
int iBestValue = 0;
CvArea* pBestArea = NULL;
int iLoop;
for (CvArea* pLoopArea = firstArea(&iLoop); pLoopArea != NULL; pLoopArea = nextArea(&iLoop))
{
if (pLoopArea->isWater() == bWater)
{
int iValue = pLoopArea->getNumTiles();
if (iValue > iBestValue)
{
iBestValue = iValue;
pBestArea = pLoopArea;
}
}
}
return pBestArea;
}
void CvPlayerAI::AI_updateFoundValues(bool bStartingLoc)
{
int iGoodEnoughToBeWorthOurTime = GC.getAI_STRATEGY_MINIMUM_SETTLE_FERTILITY();
int iLoop;
const int iNumPlots = GC.getMap().numPlots();
for(CvArea* pLoopArea = GC.getMap().firstArea(&iLoop); pLoopArea != NULL; pLoopArea = GC.getMap().nextArea(&iLoop))
{
pLoopArea->setTotalFoundValue(0);
}
const PlayerTypes eID = GetID();
if(bStartingLoc)
{
for(int iI = 0; iI < iNumPlots; iI++)
{
GC.getMap().plotByIndexUnchecked(iI)->setFoundValue(eID, -1);
}
}
else
{
const TeamTypes eTeam = getTeam();
GC.getGame().GetSettlerSiteEvaluator()->ComputeFlavorMultipliers(this);
for (int iI = 0; iI < iNumPlots; iI++)
{
CvPlot* pLoopPlot = GC.getMap().plotByIndexUnchecked(iI);
if (pLoopPlot->isRevealed(eTeam))
{
const int iValue = GC.getGame().GetSettlerSiteEvaluator()->PlotFoundValue(pLoopPlot, this, NO_YIELD, false);
pLoopPlot->setFoundValue(eID, iValue);
if (iValue >= iGoodEnoughToBeWorthOurTime)
{
CvArea* pLoopArea = GC.getMap().getArea(pLoopPlot->getArea());
if(pLoopArea && !pLoopArea->isWater())
{
pLoopArea->setTotalFoundValue(pLoopArea->getTotalFoundValue() + iValue);
}
}
}
else
{
pLoopPlot->setFoundValue(eID, -1);
}
}
}
}
void CvPlayerAI::AI_updateFoundValues(bool bStartingLoc)
{
int iLoop;
const int iNumPlots = GC.getMap().numPlots();
for(CvArea *pLoopArea = GC.getMap().firstArea(&iLoop); pLoopArea != NULL; pLoopArea = GC.getMap().nextArea(&iLoop))
{
pLoopArea->setTotalFoundValue(0);
}
const PlayerTypes eID = GetID();
if (bStartingLoc)
{
for (int iI = 0; iI < iNumPlots; iI++)
{
GC.getMap().plotByIndexUnchecked(iI)->setFoundValue(eID, -1);
}
}
else
{
const TeamTypes eTeam = getTeam();
for (int iI = 0; iI < iNumPlots; iI++)
{
CvPlot* pLoopPlot = GC.getMap().plotByIndexUnchecked(iI);
if (pLoopPlot->isRevealed(eTeam))
{
const int iValue = AI_foundValue(pLoopPlot->getX(), pLoopPlot->getY());
pLoopPlot->setFoundValue(eID, iValue);
CvArea *pLoopArea = GC.getMap().getArea(pLoopPlot->getArea());
if (pLoopArea && !pLoopArea->isWater())
{
pLoopArea->setTotalFoundValue(pLoopArea->getTotalFoundValue() + iValue);
}
}
else
{
pLoopPlot->setFoundValue(eID, -1);
}
}
}
}
void CvMapGenerator::addUniqueBonusType(BonusTypes eBonusType)
{
int* piAreaTried = new int[GC.getMapINLINE().getNumAreas()];
for (int iI = 0; iI < GC.getMapINLINE().getNumAreas(); iI++)
{
piAreaTried[iI] = FFreeList::INVALID_INDEX;
}
CvBonusInfo& pBonusInfo = GC.getBonusInfo(eBonusType);
int iBonusCount = calculateNumBonusesToAdd(eBonusType);
bool bIgnoreLatitude = false;
gDLL->getPythonIFace()->pythonIsBonusIgnoreLatitudes(&bIgnoreLatitude);
FAssertMsg(pBonusInfo.isOneArea(), "addUniqueBonusType called with non-unique bonus type");
while (true)
{
int iBestValue = 0;
int iLoop = 0;
CvArea *pBestArea = NULL;
CvArea *pLoopArea = NULL;
for(pLoopArea = GC.getMapINLINE().firstArea(&iLoop); pLoopArea != NULL; pLoopArea = GC.getMapINLINE().nextArea(&iLoop))
{
bool bTried = false;
for (int iI = 0; iI < GC.getMapINLINE().getNumAreas(); iI++)
{
if (pLoopArea->getID() == piAreaTried[iI])
{
bTried = true;
break;
}
}
if (!bTried)
{
int iNumUniqueBonusesOnArea = pLoopArea->countNumUniqueBonusTypes() + 1; // number of unique bonuses starting on the area, plus this one
int iNumTiles = pLoopArea->getNumTiles();
int iValue = iNumTiles / iNumUniqueBonusesOnArea;
if (iValue > iBestValue)
{
iBestValue = iValue;
pBestArea = pLoopArea;
}
}
}
if (pBestArea == NULL)
{
break; // can't place bonus on any area
}
for (int iI = 0; iI < GC.getMapINLINE().getNumAreas(); iI++)
{
if (piAreaTried[iI] == FFreeList::INVALID_INDEX)
{
piAreaTried[iI] = pBestArea->getID();
break;
}
}
// Place the bonuses:
std::vector<int> aiShuffle(GC.getMapINLINE().numPlotsINLINE());
GC.getGameINLINE().getMapRand().shuffleSequence(aiShuffle, "addUniqueBonusType shuffle");
for (int iI = 0; iI < GC.getMapINLINE().numPlotsINLINE(); iI++)
{
CvPlot* pPlot = GC.getMapINLINE().plotByIndexINLINE(aiShuffle[iI]);
FAssertMsg(pPlot != NULL, "addUniqueBonusType(): pPlot is null");
if (GC.getMapINLINE().getNumBonuses(eBonusType) >= iBonusCount)
{
break; // We already have enough
}
if (pBestArea == pPlot->area())
{
if (canPlaceBonusAt(eBonusType, pPlot->getX_INLINE(), pPlot->getY_INLINE(), bIgnoreLatitude))
{
pPlot->setBonusType(eBonusType);
for (int iDX = -(pBonusInfo.getGroupRange()); iDX <= pBonusInfo.getGroupRange(); iDX++)
{
for (int iDY = -(pBonusInfo.getGroupRange()); iDY <= pBonusInfo.getGroupRange(); iDY++)
{
if (GC.getMapINLINE().getNumBonuses(eBonusType) < iBonusCount)
{
CvPlot* pLoopPlot = plotXY(pPlot->getX_INLINE(), pPlot->getY_INLINE(), iDX, iDY);
if (pLoopPlot != NULL && (pLoopPlot->area() == pBestArea))
{
if (canPlaceBonusAt(eBonusType, pLoopPlot->getX_INLINE(), pLoopPlot->getY_INLINE(), bIgnoreLatitude))
{
if (GC.getGameINLINE().getMapRandNum(100, "addUniqueBonusType") < pBonusInfo.getGroupRand())
{
pLoopPlot->setBonusType(eBonusType);
}
}
}
}
}
}
}
}
}
}
SAFE_DELETE_ARRAY(piAreaTried);
}
bool CvSelectionGroupAI::AI_tradeRoutes()
{
PROFILE_FUNC();
const IDInfo kEurope(getOwnerINLINE(), CvTradeRoute::EUROPE_CITY_ID);
CvCity* pPlotCity = plot()->getPlotCity();
CvPlayerAI& kOwner = GET_PLAYER(getOwnerINLINE());
std::set<int>::iterator it;
std::map<IDInfo, int> cityValues;
std::vector<CvTradeRoute*> routes;
std::vector<int> routeValues;
std::vector<bool> yieldsDelivered(NUM_YIELD_TYPES, false);
std::vector<bool> yieldsToUnload(NUM_YIELD_TYPES, false);
std::vector<int> yieldsOnBoard(NUM_YIELD_TYPES, false);
if (!isHuman() || (getAutomateType() == AUTOMATE_TRANSPORT_FULL))
{
std::vector<CvTradeRoute*> aiRoutes;
kOwner.getTradeRoutes(aiRoutes);
for (uint i = 0; i < aiRoutes.size(); ++i)
{
CvTradeRoute* pRoute = aiRoutes[i];
// transport feeder - start - Nightinggale
CvCity* pDestinationCity = ::getCity(pRoute->getDestinationCity());
if (pDestinationCity != NULL && pDestinationCity->isAutoImportStopped(pRoute->getYield()))
{
// ignore trade routes where destination is using feeder service and is full
continue;
}
// transport feeder - end - Nightinggale
// traderoute fix - start - Nightinggale
if (isHuman() && pRoute->getDestinationCity().eOwner != getOwnerINLINE())
{
// humans can't transport to allied cities with fully automated transports
continue;
}
// traderoute fix - end - Nightinggale
CvCity* pSourceCity = ::getCity(pRoute->getSourceCity());
CvArea* pSourceWaterArea = pSourceCity->waterArea();
if ((pSourceCity != NULL) && ((getDomainType() != DOMAIN_SEA) || (pSourceWaterArea != NULL)))
{
int iSourceArea = (getDomainType() == DOMAIN_SEA) ? pSourceWaterArea->getID() : pSourceCity->getArea();
if (getDomainType() == DOMAIN_SEA ? plot()->isAdjacentToArea(iSourceArea) : (iSourceArea == getArea()))
{
if ((getDomainType() == DOMAIN_SEA) || (pRoute->getDestinationCity() != kEurope))
{
routes.push_back(pRoute);
routeValues.push_back(0);
yieldsDelivered[pRoute->getYield()] = true;
if (pPlotCity != NULL && ::getCity(pRoute->getDestinationCity()) == pPlotCity)
{
yieldsToUnload[pRoute->getYield()] = true;
}
cityValues[pRoute->getSourceCity()] = 0;
cityValues[pRoute->getDestinationCity()] = 0;
}
}
}
}
}
else
{
for (it = m_aTradeRoutes.begin(); it != m_aTradeRoutes.end(); ++it)
{
CvTradeRoute* pRoute = kOwner.getTradeRoute(*it);
CvCity* pSourceCity = ::getCity(pRoute->getSourceCity());
if (pSourceCity != NULL)
{
CvArea* pSourceWaterArea = pSourceCity->waterArea();
if (getDomainType() != DOMAIN_SEA || pSourceWaterArea != NULL)
{
int iSourceArea = (getDomainType() == DOMAIN_SEA) ? pSourceWaterArea->getID() : pSourceCity->getArea();
if (getDomainType() == DOMAIN_SEA ? plot()->isAdjacentToArea(iSourceArea) : (iSourceArea == getArea()))
{
if ((getDomainType() == DOMAIN_SEA) || (pRoute->getDestinationCity() != kEurope))
{
routes.push_back(pRoute);
routeValues.push_back(0);
yieldsDelivered[pRoute->getYield()] = true;
if (pPlotCity != NULL && ::getCity(pRoute->getDestinationCity()) == pPlotCity)
{
yieldsToUnload[pRoute->getYield()] = true;
}
cityValues[pRoute->getSourceCity()] = 0;
cityValues[pRoute->getDestinationCity()] = 0;
}
}
else
{
FAssertMsg(false, "Unexpected : Unit can't run trade route it's assigned to");
}
}
}
}
}
if ((pPlotCity != NULL) && hasCargo())
{
std::vector<CvUnit*> units;
//Unload everything which we should unload here, or can't unload anywhere...
CLLNode<IDInfo>* pUnitNode = plot()->headUnitNode();
while (pUnitNode != NULL)
{
CvUnit* pLoopUnit = ::getUnit(pUnitNode->m_data);
pUnitNode = plot()->nextUnitNode(pUnitNode);
if (pLoopUnit != NULL)
{
YieldTypes eYield = pLoopUnit->getYield();
CvUnit* pTransport = pLoopUnit->getTransportUnit();
if ((eYield != NO_YIELD) && pTransport != NULL && (yieldsToUnload[eYield] || !(yieldsDelivered[eYield])))
{
if (pTransport->getGroup() == this && pLoopUnit->canUnload())
{
units.push_back(pLoopUnit);
}
}
}
}
for (uint i = 0; i < units.size(); ++i)
{
units[i]->unload();
}
}
short aiYieldsLoaded[NUM_YIELD_TYPES];
AI_getYieldsLoaded(aiYieldsLoaded);
bool bNoCargo = true;
for (int i = 0; i < NUM_YIELD_TYPES; ++i)
{
if (aiYieldsLoaded[i] > 0)
{
bNoCargo = false;
break;
}
}
if (!bNoCargo)
{
//We need to iterate over every destination city and see if we can unload.
for (uint i = 0; i < routes.size(); ++i)
{
CvCity* pDestinationCity = ::getCity(routes[i]->getDestinationCity());
if ((pDestinationCity == NULL) || (pDestinationCity != pPlotCity))
{
int iRouteValue = kOwner.AI_transferYieldValue(routes[i]->getDestinationCity(), routes[i]->getYield(), aiYieldsLoaded[routes[i]->getYield()]);
if (iRouteValue > 0)
{
cityValues[routes[i]->getDestinationCity()] += iRouteValue;
routeValues[i] += iRouteValue;
}
}
}
}
//We need to iterate over every source city, and see if there's anything which needs moving to the respective destination city.
//We apply some bias to the city we are presently at, but not too much - sometimes empty runs need to be made...
//Basically this looks at the entire NEXT trade run (source-city to dest-city), with some bias given towards
//starting it from pPlotCity as sourceCity.
//If we are carrying cargo, only count cities where we can unload.
for (uint i = 0; i < routes.size(); ++i)
{
CvCity* pSourceCity = ::getCity(routes[i]->getSourceCity());
if ((pSourceCity != NULL) && (bNoCargo || (cityValues[routes[i]->getSourceCity()] > 0)))
{
CvCity* pDestinationCity = ::getCity(routes[i]->getDestinationCity());
YieldTypes eYield = routes[i]->getYield();
// transport feeder - start - Nightinggale
//int iAmount = pSourceCity->getYieldStored(eYield) - pSourceCity->getMaintainLevel(eYield);
int iAmount = pSourceCity->getYieldStored(eYield) - pSourceCity->getAutoMaintainThreshold(eYield);
// transport feeder - end - Nightinggale
if (iAmount > 0)
{
int iExportValue = kOwner.AI_transferYieldValue(routes[i]->getSourceCity(), routes[i]->getYield(), -iAmount);
int iImportValue = kOwner.AI_transferYieldValue(routes[i]->getDestinationCity(), routes[i]->getYield(), iAmount);
int iRouteValue = (iExportValue + iImportValue + 2 * std::min(iExportValue, iImportValue)) / 4;
if (pSourceCity == pPlotCity)
{
cityValues[routes[i]->getDestinationCity()] += 2 * iRouteValue;
}
else
{
cityValues[routes[i]->getSourceCity()] += iRouteValue;
}
routeValues[i] = iRouteValue;
}
}
}
IDInfo kBestDestination(NO_PLAYER, -1);
int iBestDestinationValue = 0;
for (std::map<IDInfo, int>::iterator it = cityValues.begin(); it != cityValues.end(); ++it)
{
int iValue = it->second;
if (iValue > 0)
{
CvCity* pCity = ::getCity(it->first);
if (pCity != NULL)
{
FAssert(!atPlot(pCity->plot()));
if (generatePath(plot(), pCity->plot(), MOVE_NO_ENEMY_TERRITORY, true))
{
iValue /= 1 + kOwner.AI_plotTargetMissionAIs(pCity->plot(), MISSIONAI_TRANSPORT, this, 0);
}
else
{
iValue = 0;
}
}
if (iValue > iBestDestinationValue)
{
iBestDestinationValue = iValue;
kBestDestination = it->first;
}
}
}
if ((pPlotCity != NULL) && (kBestDestination.eOwner != NO_PLAYER))
{
//We need to keep looping and recalculating
//For example a city might have "101" of an item, we want to move the first 100 but not the 1.
//But it could also have 200, in which case we might want 2 loads of 100...
//But it could also have 200 of two resources, and we'd want to move 100 of each...
///TKs MEd
int iTestCount = 0;
while (!isFull())
{
iTestCount++;
if (iTestCount == 1000)
{
FAssert(iTestCount == 0);
int iID = pPlotCity->getID();
int iIDplayer = GET_PLAYER(kBestDestination.eOwner).getID();
// break;
}
if (iTestCount == 1001)
{
break;
}
///TKe
int iBestRoute = -1;
int iBestRouteValue = 0;
//Now, for any trade routes which this group is assigned to, try to pick up cargo here.
for (uint i = 0; i < routes.size(); ++i)
{
CvCity* pSourceCity = ::getCity(routes[i]->getSourceCity());
if ((pSourceCity != NULL) && (routes[i]->getDestinationCity() == kBestDestination))
{
CvCity* pDestinationCity = ::getCity(routes[i]->getDestinationCity());
YieldTypes eYield = routes[i]->getYield();
if ((pPlotCity == pSourceCity))
{
// transport feeder - start - Nightinggale
//int iAmount = pSourceCity->getYieldStored(eYield) - pSourceCity->getMaintainLevel(eYield);
int iAmount = pSourceCity->getYieldStored(eYield) - pSourceCity->getAutoMaintainThreshold(eYield);
// transport feeder - end - Nightinggale
if (iAmount > 0)
{
int iExportValue = kOwner.AI_transferYieldValue(routes[i]->getSourceCity(), routes[i]->getYield(), -iAmount);
int iImportValue = kOwner.AI_transferYieldValue(routes[i]->getDestinationCity(), routes[i]->getYield(), iAmount);
int iRouteValue = (iExportValue + iImportValue + 2 * std::min(iExportValue, iImportValue)) / 4;
if (iRouteValue > iBestRouteValue)
{
iBestRouteValue = iRouteValue;
iBestRoute = i;
}
}
}
}
}
if (iBestRouteValue > 0)
{
CLLNode<IDInfo>* pUnitNode = headUnitNode();
while (pUnitNode != NULL)
{
CvUnit* pLoopUnit = ::getUnit(pUnitNode->m_data);
pUnitNode = nextUnitNode(pUnitNode);
if (pLoopUnit != NULL)
{
if (pLoopUnit->canLoadYield(plot(), routes[iBestRoute]->getYield(), false))
{
pLoopUnit->loadYield(routes[iBestRoute]->getYield(), false);
break;
}
}
}
}
else
{
break;
}
}
//XXX fill hold.
}
if ((kBestDestination.eOwner == NO_PLAYER) && hasCargo())
{
// Transport group is full and can't find any destination
CvCity* pCity = kOwner.AI_findBestPort();
if (pCity != NULL && !atPlot(pCity->plot()))
{
kBestDestination = pCity->getIDInfo();
}
}
//As a final step, we could consider loading yields which would be useful as parts of delivery runs...
if (kBestDestination != kEurope)
{
CvCity* pBestDestinationCity = ::getCity(kBestDestination);
if (pBestDestinationCity != NULL)
{
FAssert(!atPlot(pBestDestinationCity->plot()));
pushMission(MISSION_MOVE_TO, pBestDestinationCity->getX_INLINE(), pBestDestinationCity->getY_INLINE(), MOVE_NO_ENEMY_TERRITORY, false, false, MISSIONAI_TRANSPORT, pBestDestinationCity->plot());
if (atPlot(pBestDestinationCity->plot()))
{
//Unload any goods if required (we can always pick them back up if this is an i+e city).
std::vector<CvUnit*> units;
CLLNode<IDInfo>* pUnitNode = plot()->headUnitNode();
CvUnit* pLoopUnit;
while (pUnitNode != NULL)
{
pLoopUnit = ::getUnit(pUnitNode->m_data);
pUnitNode = plot()->nextUnitNode(pUnitNode);
YieldTypes eYield = pLoopUnit->getYield();
if ((eYield != NO_YIELD) && pLoopUnit->isCargo())
{
if (pLoopUnit->getTransportUnit()->getGroup() == this && pLoopUnit->canUnload())
{
units.push_back(pLoopUnit);
}
}
}
for (uint i = 0; i < units.size(); ++i)
{
units[i]->unload();
}
}
return true;
}
}
else
{
if (isHuman())
{
getHeadUnit()->AI_setUnitAIState(UNITAI_STATE_SAIL);
}
}
return false;
}
/// Retrieve the relative value of this plot (including plots that would be in city radius)
int CvCitySiteEvaluator::PlotFoundValue(CvPlot* pPlot, const CvPlayer* pPlayer, YieldTypes eYield, bool /*bCoastOnly*/, CvString* pDebug)
{
CvAssert(pPlot);
if(!pPlot)
return -1;
// Make sure this player can even build a city here
if(!CanFound(pPlot, pPlayer, false))
{
if(pDebug)
*pDebug = "cannot found";
return -1;
}
//for debugging
std::vector<std::string> vQualifiersPositive;
std::vector<std::string> vQualifiersNegative;
//total
int iTotalPlotValue = 0;
int iValueModifier = 0; //general modifiers
int iCivModifier = 0; //civ-specific modifiers
int iStratModifier = 0; //strategic modifiers
int iCelticForestCount = 0;
int iIroquoisForestCount = 0;
int iBrazilJungleCount = 0;
int iNaturalWonderCount = 0;
int iDesertCount = 0;
int iWetlandsCount = 0;
int iLakeCount = 0;
int iLuxuryCount = 0;
//currently just for debugging
int iTotalFoodValue = 0;
int iTotalHappinessValue = 0;
int iTotalProductionValue = 0;
int iTotalGoldValue = 0;
int iTotalScienceValue = 0;
int iTotalFaithValue = 0;
int iTotalResourceValue = 0;
int iTotalStrategicValue = 0;
//use a slightly negative base value to discourage settling in bad lands
int iDefaultPlotValue = -100;
int iBorderlandRange = 6;
int iCapitalArea = NULL;
bool bIsAlmostCoast = false;
bool bIsInca = false;
int iAdjacentMountains = 0;
std::vector<SPlotWithScore> workablePlots;
workablePlots.reserve(49);
TeamTypes eTeam = pPlayer ? pPlayer->getTeam() : NO_TEAM;
PlayerTypes ePlayer = pPlayer ? pPlayer->GetID() : NO_PLAYER;
if (pPlayer)
{
if ( pPlayer->getCapitalCity() )
{
iCapitalArea = pPlayer->getCapitalCity()->getArea();
}
// Custom code for Inca ideal terrace farm locations
ImprovementTypes eIncaImprovement = (ImprovementTypes)GC.getInfoTypeForString("IMPROVEMENT_TERRACE_FARM", true);
if(eIncaImprovement != NO_IMPROVEMENT)
{
CvImprovementEntry* pkEntry = GC.getImprovementInfo(eIncaImprovement);
if(pkEntry != NULL && pkEntry->IsSpecificCivRequired())
{
CivilizationTypes eCiv = pkEntry->GetRequiredCivilization();
if(eCiv == pPlayer->getCivilizationType())
{
bIsInca = true;
}
}
}
}
int iRange = pPlayer ? pPlayer->getWorkPlotDistance() : 3;
for (int iDX = -iRange; iDX <= iRange; iDX++)
{
for (int iDY = -iRange; iDY <= iRange; iDY++)
{
CvPlot* pLoopPlot = plotXY(pPlot->getX(), pPlot->getY(), iDX, iDY);
if (pLoopPlot != NULL)
{
int iDistance = plotDistance(pPlot->getX(), pPlot->getY(), pLoopPlot->getX(), pLoopPlot->getY());
if (iDistance <= iRange)
{
int iRingModifier = m_iRingModifier[iDistance];
//not only our cities, also other player's cities!
int iExistingCityDistance = GC.getGame().GetClosestCityDistance(pLoopPlot);
//count the tile only if the city will be able to work it
if ( !pLoopPlot->isValidMovePlot(pPlayer->GetID()) || pLoopPlot->getWorkingCity()!=NULL || iExistingCityDistance<=2 )
iRingModifier = 0;
if (iExistingCityDistance==3)
//this plot will likely be contested between the two cities, reduce its value
iRingModifier /= 2;
int iPlotValue = iDefaultPlotValue;
if (iRingModifier>0)
{
int iFoodValue = 0;
int iHappinessValue = 0;
int iProductionValue = 0;
int iGoldValue = 0;
int iScienceValue = 0;
int iFaithValue = 0;
int iResourceValue = 0;
int iStrategicValue = 0;
if (eYield == NO_YIELD || eYield == YIELD_FOOD)
iFoodValue = ComputeFoodValue(pLoopPlot, pPlayer) * /*15*/ GC.getSETTLER_FOOD_MULTIPLIER();
if (eYield == NO_YIELD || eYield == YIELD_PRODUCTION)
iProductionValue = ComputeProductionValue(pLoopPlot, pPlayer) * /*3*/ GC.getSETTLER_PRODUCTION_MULTIPLIER();
if (eYield == NO_YIELD || eYield == YIELD_GOLD)
iGoldValue = ComputeGoldValue(pLoopPlot, pPlayer) * /*2*/ GC.getSETTLER_GOLD_MULTIPLIER();
if (eYield == NO_YIELD || eYield == YIELD_SCIENCE)
iScienceValue = ComputeScienceValue(pLoopPlot, pPlayer) * /*1*/ GC.getSETTLER_SCIENCE_MULTIPLIER();
if (eYield == NO_YIELD || eYield == YIELD_FAITH)
iFaithValue = ComputeFaithValue(pLoopPlot, pPlayer) * /*1*/ GC.getSETTLER_FAITH_MULTIPLIER();
if (pLoopPlot->getOwner() == NO_PLAYER) // there is no benefit if we already own these tiles
{
iHappinessValue = ComputeHappinessValue(pLoopPlot, pPlayer) * /*6*/ GC.getSETTLER_HAPPINESS_MULTIPLIER();
iResourceValue = ComputeTradeableResourceValue(pLoopPlot, pPlayer) * /*1*/ GC.getSETTLER_RESOURCE_MULTIPLIER();
if (iDistance)
iStrategicValue = ComputeStrategicValue(pLoopPlot, pPlayer, iDistance) * /*1*/ GC.getSETTLER_STRATEGIC_MULTIPLIER(); // the ring is included in the computation
}
iTotalFoodValue += iFoodValue;
iTotalHappinessValue += iHappinessValue;
iTotalProductionValue += iProductionValue;
iTotalGoldValue += iGoldValue;
iTotalScienceValue += iScienceValue;
iTotalFaithValue += iFaithValue;
iTotalResourceValue += iResourceValue;
iTotalStrategicValue += iStrategicValue;
iPlotValue += iRingModifier * ( iFoodValue + iHappinessValue + iProductionValue + iGoldValue + iScienceValue + iFaithValue + iResourceValue ) + iStrategicValue;
}
// for the central plot
if (iDistance==0)
vQualifiersPositive.push_back( CvString::format("raw plot value %d", iPlotValue).c_str() );
if (iDistance==1 && !pPlot->isCoastalLand(GC.getMIN_WATER_SIZE_FOR_OCEAN()) && pLoopPlot->isCoastalLand(GC.getMIN_WATER_SIZE_FOR_OCEAN()))
bIsAlmostCoast = true;
// if this tile is a NW boost the value just so that we force the AI to claim them (if we can work it)
if (pLoopPlot->IsNaturalWonder() && iPlotValue>0)
iPlotValue *= 15;
// lower value a lot if we already own this tile
if (iPlotValue > 0 && pLoopPlot->getOwner() == ePlayer && ePlayer != NO_PLAYER)
iPlotValue /= 2;
// add this plot into the total
workablePlots.push_back( SPlotWithScore(pLoopPlot,iPlotValue) );
// some civ-specific checks
FeatureTypes ePlotFeature = pLoopPlot->getFeatureType();
ImprovementTypes ePlotImprovement = pLoopPlot->getImprovementType();
ResourceTypes ePlotResource = pLoopPlot->getResourceType();
if (ePlotFeature == FEATURE_FOREST)
{
if (iDistance <= 5)
{
++iIroquoisForestCount;
if (iDistance == 1)
if (ePlotImprovement == NO_IMPROVEMENT)
++iCelticForestCount;
}
}
else if (ePlotFeature == FEATURE_JUNGLE)
{
if (iDistance <= iRange)
++iBrazilJungleCount;
}
else if (ePlotFeature == FEATURE_MARSH || ePlotFeature == FEATURE_FLOOD_PLAINS)
{
if (iDistance <= iRange)
++iWetlandsCount;
}
if (pLoopPlot->IsNaturalWonder())
{
if (iDistance <= iRange)
++iNaturalWonderCount;
}
if (pLoopPlot->isLake())
{
if (iDistance <= iRange)
++iLakeCount;
}
if (pLoopPlot->getResourceType(NO_TEAM) != NO_RESOURCE)
{
ResourceTypes eResource = pLoopPlot->getResourceType(eTeam);
if(eResource != NO_RESOURCE && GC.getResourceInfo(eResource)->getResourceUsage() == RESOURCEUSAGE_LUXURY)
{
if (iDistance <= iRange)
{
++iLuxuryCount;
}
}
}
if (pLoopPlot->getTerrainType() == TERRAIN_DESERT)
{
if (iDistance <= iRange)
{
if (ePlotResource == NO_RESOURCE)
{
++iDesertCount;
}
}
}
if (bIsInca)
{
if (pLoopPlot->isHills() && iDistance <= iRange)
{
iAdjacentMountains = pLoopPlot->GetNumAdjacentMountains();
if (iAdjacentMountains > 0 && iAdjacentMountains < 6)
{
//give the bonus if it's hills, with additional if bordered by mountains
iCivModifier += (iAdjacentMountains+1) * m_iIncaMultiplier;
vQualifiersPositive.push_back("(C) incan hills");
}
}
}
}
}
}
}
//take into account only the best 70% of the plots - in the near term the city will not work all plots anyways
std::stable_sort( workablePlots.begin(), workablePlots.end() );
size_t iIrrelevantPlots = workablePlots.size()*30/100;
for (size_t idx=iIrrelevantPlots; idx<workablePlots.size(); idx++)
{
SPlotWithScore& ref = workablePlots[idx];
iTotalPlotValue += ref.score;
}
if (iTotalPlotValue<0)
return 0;
//civ-specific bonuses
if (pPlayer)
{
if (pPlayer->GetPlayerTraits()->IsFaithFromUnimprovedForest())
{
if (iCelticForestCount >= 3)
{
iCivModifier += 2 * 1000 * m_iFlavorMultiplier[YIELD_FAITH];
vQualifiersPositive.push_back("(C) much forest");
}
else if (iCelticForestCount >= 1)
{
iCivModifier += 1 * 1000 * m_iFlavorMultiplier[YIELD_FAITH];
vQualifiersPositive.push_back("(C) some forest");
}
}
else if (pPlayer->GetPlayerTraits()->IsMoveFriendlyWoodsAsRoad())
{
iCivModifier += iIroquoisForestCount * 10;
vQualifiersPositive.push_back("(C) forested");
}
else if (pPlayer->GetPlayerTraits()->GetNaturalWonderYieldModifier() > 0) //ie: Spain
{
iCivModifier += iNaturalWonderCount * m_iSpainMultiplier;
vQualifiersPositive.push_back("(C) natural wonders");
}
// Custom code for Brazil
ImprovementTypes eBrazilImprovement = (ImprovementTypes)GC.getInfoTypeForString("IMPROVEMENT_BRAZILWOOD_CAMP", true);
if(eBrazilImprovement != NO_IMPROVEMENT)
{
CvImprovementEntry* pkEntry = GC.getImprovementInfo(eBrazilImprovement);
if(pkEntry != NULL && pkEntry->IsSpecificCivRequired())
{
CivilizationTypes eCiv = pkEntry->GetRequiredCivilization();
if(eCiv == pPlayer->getCivilizationType())
{
iCivModifier += iBrazilJungleCount * m_iBrazilMultiplier;
vQualifiersPositive.push_back("(C) jungle");
}
}
}
// Custom code for Morocco
ImprovementTypes eMoroccoImprovement = (ImprovementTypes)GC.getInfoTypeForString("IMPROVEMENT_KASBAH", true);
if(eMoroccoImprovement != NO_IMPROVEMENT)
{
CvImprovementEntry* pkEntry = GC.getImprovementInfo(eMoroccoImprovement);
if(pkEntry != NULL && pkEntry->IsSpecificCivRequired() && !pkEntry->IsAdjacentCity())
{
CivilizationTypes eCiv = pkEntry->GetRequiredCivilization();
if(eCiv == pPlayer->getCivilizationType())
{
iCivModifier += iDesertCount * m_iMorrocoMultiplier;
vQualifiersPositive.push_back("(C) desert");
}
}
}
// Custom code for France
ImprovementTypes eFranceImprovement = (ImprovementTypes)GC.getInfoTypeForString("IMPROVEMENT_CHATEAU", true);
if(eFranceImprovement != NO_IMPROVEMENT)
{
CvImprovementEntry* pkEntry = GC.getImprovementInfo(eFranceImprovement);
if(pkEntry != NULL && pkEntry->IsSpecificCivRequired() && pkEntry->IsAdjacentLuxury())
{
CivilizationTypes eCiv = pkEntry->GetRequiredCivilization();
if(eCiv == pPlayer->getCivilizationType())
{
iCivModifier += iLuxuryCount * m_iFranceMultiplier;
vQualifiersPositive.push_back("(C) luxury");
}
}
}
//Custom code for Netherlands
ImprovementTypes ePolderImprovement = (ImprovementTypes)GC.getInfoTypeForString("IMPROVEMENT_POLDER", true);
if(ePolderImprovement != NO_IMPROVEMENT)
{
CvImprovementEntry* pkEntry = GC.getImprovementInfo(ePolderImprovement);
if(pkEntry != NULL && pkEntry->IsSpecificCivRequired())
{
CivilizationTypes eCiv = pkEntry->GetRequiredCivilization();
if(eCiv == pPlayer->getCivilizationType())
{
iCivModifier += iWetlandsCount * m_iNetherlandsMultiplier;
if(pkEntry->IsAdjacentLake())
{
iCivModifier += (iLakeCount * m_iNetherlandsMultiplier);
}
vQualifiersPositive.push_back("(C) wetlands");
}
}
}
}
// Finally, look at the city plot itself
if (pPlot->getResourceType(eTeam) != NO_RESOURCE)
{
iValueModifier += (int)iTotalPlotValue * /*-50*/ GC.getBUILD_ON_RESOURCE_PERCENT() / 100;
vQualifiersNegative.push_back("(V) city on resource");
}
if (pPlot->IsNaturalWonder())
{
iValueModifier += (int)iTotalPlotValue * /*-50*/ GC.getBUILD_ON_RESOURCE_PERCENT() / 100;
vQualifiersNegative.push_back("(V) city on natural wonder");
}
if ( iTotalFoodValue>5*iTotalProductionValue || iTotalProductionValue > 2*iTotalFoodValue )
{
iValueModifier -= (int)iTotalPlotValue * 10 / 100;
vQualifiersNegative.push_back("(V) unbalanced yields");
}
if (pPlot->isRiver())
{
iValueModifier += (int)iTotalPlotValue * /*15*/ GC.getBUILD_ON_RIVER_PERCENT() / 100;
if(pPlayer && pPlayer->GetPlayerTraits()->IsRiverTradeRoad())
iValueModifier += (int)iTotalPlotValue * /*15*/ GC.getBUILD_ON_RIVER_PERCENT() / 100 * 2;
vQualifiersPositive.push_back("(V) river");
}
if (bIsAlmostCoast)
{
iValueModifier -= (iTotalPlotValue * 25) / 100;
vQualifiersNegative.push_back("(V) almost coast");
}
CvArea* pArea = pPlot->area();
int iGoodTiles = 1;
if(pArea != NULL)
{
iGoodTiles = max(1,(pArea->getNumUnownedTiles() - pArea->GetNumBadPlots()));
}
//Island maps need a little more loose restriction here.
if(GC.getMap().GetAIMapHint() & ciMapHint_NavalOffshore)
{
if (pPlot->isCoastalLand(GC.getMIN_WATER_SIZE_FOR_OCEAN()))
{
if(pArea != NULL && iGoodTiles > 0)
{
iValueModifier += (iTotalPlotValue * /*40*/ GC.getSETTLER_BUILD_ON_COAST_PERCENT()) / 100;
vQualifiersPositive.push_back("(V) coast");
if (pPlayer)
{
int iNavalFlavor = pPlayer->GetGrandStrategyAI()->GetPersonalityAndGrandStrategy((FlavorTypes)m_iNavalIndex);
if (iNavalFlavor > 7)
{
iValueModifier += (iTotalPlotValue * /*40*/ GC.getSETTLER_BUILD_ON_COAST_PERCENT()) / 100;
}
if (pPlayer->getCivilizationInfo().isCoastalCiv()) // we really like the coast (England, Norway, Polynesia, Carthage, etc.)
{
iValueModifier += iTotalPlotValue;
}
}
}
}
else
{
if(iGoodTiles <= 3)
{
iValueModifier -= (iTotalPlotValue * 40) / 100;
vQualifiersNegative.push_back("(V) not enough good plots");
}
else if(iGoodTiles <= 6)
{
iValueModifier -= (iTotalPlotValue * 20) / 100;
vQualifiersNegative.push_back("(V) few good plots");
}
}
}
else
{
if (pPlot->isCoastalLand(GC.getMIN_WATER_SIZE_FOR_OCEAN()))
{
if(pArea != NULL && iGoodTiles > 3)
{
iValueModifier += (iTotalPlotValue * /*40*/ GC.getSETTLER_BUILD_ON_COAST_PERCENT()) / 100;
vQualifiersPositive.push_back("(V) coast");
if (pPlayer)
{
int iNavalFlavor = pPlayer->GetGrandStrategyAI()->GetPersonalityAndGrandStrategy((FlavorTypes)m_iNavalIndex);
if (iNavalFlavor > 7)
{
iValueModifier += (iTotalPlotValue * /*40*/ GC.getSETTLER_BUILD_ON_COAST_PERCENT()) / 100;
}
if (pPlayer->getCivilizationInfo().isCoastalCiv()) // we really like the coast (England, Norway, Polynesia, Carthage, etc.)
{
iValueModifier += iTotalPlotValue;
}
}
}
else if(pArea != NULL && iGoodTiles == 1)
{
iValueModifier -= (iTotalPlotValue * 40) / 100;
vQualifiersNegative.push_back("(V) coast on 1-tile island is not great");
}
else
{
iValueModifier -= (iTotalPlotValue * 25) / 100;
vQualifiersNegative.push_back("(V) coast on small island");
}
}
else
{
if(iGoodTiles <= 5)
{
iValueModifier -= (iTotalPlotValue * 40) / 100;
vQualifiersNegative.push_back("(V) not enough good plots");
}
else if(iGoodTiles <= 10)
{
iValueModifier -= (iTotalPlotValue * 20) / 100;
vQualifiersNegative.push_back("(V) few good plots");
}
}
}
//Is this a chokepoint?
if(pPlot->IsChokePoint())
{
iStratModifier += (iTotalPlotValue * /*100*/ GC.getBALANCE_CHOKEPOINT_STRATEGIC_VALUE()) / 100;
vQualifiersPositive.push_back("(S) chokepoint");
//each landbride is a chokepoint, but not every chokepoint is a landbridge
if(pPlot->IsLandbridge(12,54))
{
iStratModifier += (iTotalPlotValue * /*100*/ GC.getBALANCE_CHOKEPOINT_STRATEGIC_VALUE()) / 100;
vQualifiersPositive.push_back("(S) landbridge");
}
}
//Check for strategic landgrab
int iOwnCityDistance = pPlayer ? pPlayer->GetCityDistance(pPlot) : INT_MAX;
int iOtherCityDistance = INT_MAX;
//check if the closest city is our or somebody else's
CvCity* pClosestCity = GC.getGame().GetClosestCity(pPlot);
if( pClosestCity && (!pPlayer || pClosestCity->getOwner()!=pPlayer->GetID()) )
{
iOtherCityDistance = GC.getGame().GetClosestCityDistance(pPlot);
PlayerTypes eOtherPlayer = (PlayerTypes) pClosestCity->getOwner();
PlayerProximityTypes eProximity = GET_PLAYER(eOtherPlayer).GetProximityToPlayer(pPlayer->GetID());
if(eProximity >= PLAYER_PROXIMITY_CLOSE && iOtherCityDistance<=iBorderlandRange)
{
//Neighbor must not be too strong
if ( pPlayer->GetMilitaryMight() > GET_PLAYER(eOtherPlayer).GetMilitaryMight()*1.4f )
{
iStratModifier += (iTotalPlotValue * /*50*/ GC.getBALANCE_EMPIRE_BORDERLAND_STRATEGIC_VALUE()) / 100;
vQualifiersPositive.push_back("(S) landgrab");
}
else if ( pPlayer->GetMilitaryMight() < GET_PLAYER(eOtherPlayer).GetMilitaryMight()*0.8f )
{
iStratModifier -= (iTotalPlotValue * /*50*/ GC.getBALANCE_EMPIRE_BORDERLAND_STRATEGIC_VALUE()) / 100;
vQualifiersNegative.push_back("(S) too dangerous");
}
}
}
// where is our personal sweet spot?
int iMinDistance = /*3*/ GC.getMIN_CITY_RANGE();
if(pPlayer && pPlayer->isMinorCiv())
{
if(GC.getMap().getWorldInfo().getMinDistanceCityStates() > 0)
{
iMinDistance = GC.getMap().getWorldInfo().getMinDistanceCityStates();
}
}
else if(GC.getMap().getWorldInfo().getMinDistanceCities() > 0)
{
iMinDistance = GC.getMap().getWorldInfo().getMinDistanceCities();
}
if (iOwnCityDistance <= iMinDistance)
{
//this case should be handled by the distance check in CanFound() also
iValueModifier -= iTotalPlotValue / 2;
vQualifiersNegative.push_back("(V) too close to existing friendly city");
}
// AI only
if (pPlayer && !pPlayer->isHuman())
{
int iSweetMin = GC.getSETTLER_DISTANCE_DROPOFF_MODIFIER();
int iSweetMax = GC.getSETTLER_DISTANCE_DROPOFF_MODIFIER()+1;
//check our preferred balance between tall and wide
int iGrowthFlavor = pPlayer->GetGrandStrategyAI()->GetPersonalityAndGrandStrategy((FlavorTypes)m_iGrowthIndex);
if (iGrowthFlavor > 5)
{
iSweetMax++;
iSweetMin++;
}
else if (iGrowthFlavor < 5)
{
iSweetMax--;
iSweetMin--;
}
int iExpansionFlavor = pPlayer->GetGrandStrategyAI()->GetPersonalityAndGrandStrategy((FlavorTypes)m_iExpansionIndex);
if (iExpansionFlavor > 5)
{
iSweetMax++;
iSweetMin++;
}
else if (iExpansionFlavor < 5)
{
iSweetMax--;
iSweetMin--;
}
if(iSweetMin < iMinDistance)
iSweetMin = iMinDistance;
//this affects both friendly and other cities
if (min(iOwnCityDistance,iOtherCityDistance) >= iSweetMin && max(iOwnCityDistance,iOtherCityDistance) <= iSweetMax)
{
iValueModifier += (iTotalPlotValue*20)/100; //make this a small bonus, there is a separate distance check anyway
vQualifiersPositive.push_back("(V) optimal distance to existing cities");
}
//boldness comes into play when there are enemy cities around
int iBoldness = pPlayer->GetDiplomacyAI()->GetBoldness();
if (iBoldness > 5)
iSweetMin--;
if (iBoldness < 5)
iSweetMin++;
if (iOtherCityDistance<=iSweetMin)
{
iStratModifier -= iTotalPlotValue / 2;
vQualifiersNegative.push_back("(S) too close to existing enemy city");
}
}
#if defined(MOD_EVENTS_CITY_FOUNDING)
if (MOD_EVENTS_CITY_FOUNDING) {
if (GAMEEVENTINVOKE_TESTALL(GAMEEVENT_PlayerCanFoundCity, pPlayer->GetID(), pPlot->getX(), pPlot->getY()) == GAMEEVENTRETURN_FALSE) {
return false;
}
}
#endif
//logging logging logging
if (pDebug)
{
pDebug->Format("%d,%d,%d,%d", iTotalPlotValue, iValueModifier, iStratModifier, iCivModifier);
for (size_t i=0; i<vQualifiersPositive.size();i++)
{
pDebug->append(",positive: ");
pDebug->append(vQualifiersPositive[i].c_str());
}
for (size_t i=0; i<vQualifiersNegative.size();i++)
{
pDebug->append(",negative: ");
pDebug->append(vQualifiersNegative[i].c_str());
}
}
return max(0,iTotalPlotValue + iValueModifier + iStratModifier + iCivModifier);
}
