Method updatePathfinding

game/state/battle/battle.cpp:1511–1622

}

void Battle::updatePathfinding(GameState &, unsigned int ticks)
{
	// Throttling updates so that big explosions won't lag
	static const int LIMIT_PER_TICK = 10;

	// How much attempts are given to the pathfinding until giving up and concluding that
	// there is no path between two sectors. This is a multiplier for "distance", which is
	// a minimum number of iterations required to pathfind between two locations
	static const int PATH_ITERATION_LIMIT_MULTIPLIER = 2;

	// How much can resulting path differ from optimal path
	static const int PATH_COST_LIMIT_MULTIPLIER = 2;

	int lbCount = losBlocks.size();
	auto &mapRef = *map;

	// Fill up map of helpers
	// It would be appropriate to use a std::map here, alas, it doesn't work when there's
	// no default constructor available, so I have to use this kludge
	std::vector<BattleUnitTileHelper> helperMap = {BattleUnitTileHelper(mapRef, (BattleUnitType)0),
	                                               BattleUnitTileHelper(mapRef, (BattleUnitType)1),
	                                               BattleUnitTileHelper(mapRef, (BattleUnitType)2),
	                                               BattleUnitTileHelper(mapRef, (BattleUnitType)3)};

	// First update all center positions
	for (int i = 0; i < lbCount; i++)
	{
		if (!blockNeedsUpdate[i])
		{
			continue;
		}
		blockNeedsUpdate[i] = false;

		// Mark all paths including this block as needing an update
		for (int j = 0; j < lbCount; j++)
		{
			if (linkAvailable[i + lbCount * j])
			{
				linkNeedsUpdate[std::min(i, j) + std::max(i, j) * lbCount] = true;
			}
		}

		// Find closest to center valid position for every kind of unit
		auto &lb = *losBlocks[i];
		auto center = (lb.start + lb.end) / 2;
		for (auto &type : BattleUnitTypeList)
		{
			blockAvailable[type][i] =
			    findLosBlockCenter(mapRef, type, lb, center, blockCenterPos[type][i]);
		}
	}

	int updatesRemaining = ticks > 0 ? LIMIT_PER_TICK * ticks : -1;

	// Now update all paths
	for (int i = 0; i < lbCount - 1; i++)
	{
		for (int j = i + 1; j < lbCount; j++)