Function CalculateTarget

TombEngine/Game/control/box.cpp:3024–3305

* @brief Calculates the world position for creature movement along its path. * * This function walks the path from creature's current box to the target box, * finding the best position to move toward. It handles box boundary clipping * to ensure the creature moves along valid paths through connected boxes. * * CLIPPING SYSTEM: * - Uses directional flags (CLIP_LEFT/RIGHT/TOP/BOTTOM) to track

 * @return TARGET_TYPE indicating the quality of target found.
 */
TARGET_TYPE CalculateTarget(Vector3i* target, ItemInfo* item, LOTInfo* LOT)
{
	// Set creature's current box for A* heuristic.
	LOT->SourceBox = item->BoxNumber;

	// Expand the pathfinding search if needed.
	UpdateLOT(LOT, g_GameFlow->GetSettings()->Pathfinding.SearchDepth);

	// Start with creature's current position as default target.
	*target = item->Pose.Position;

	int boxNumber = item->BoxNumber;
	if (boxNumber == NO_VALUE)
		return TARGET_TYPE::NO_TARGET;

	auto* box = &g_Level.PathfindingBoxes[boxNumber];

	// Convert box boundaries to world coordinates.
	// Note: box coordinates are in blocks, multiply by BLOCK(1) for world units.
	int boxLeft = ((int)box->left * BLOCK(1));
	int boxRight = ((int)box->right * BLOCK(1)) - 1;
	int boxTop = ((int)box->top * BLOCK(1));
	int boxBottom = ((int)box->bottom * BLOCK(1)) - 1;

	// Track the valid corridor as we traverse boxes.
	int left = boxLeft;
	int right = boxRight;
	int top = boxTop;
	int bottom = boxBottom;
	int direction = CLIP_ALL; // Can move in all directions initially.

	// Safety limit to prevent infinite loops from corrupted exitBox chains.
	int maxIterations = (int)g_Level.PathfindingBoxes.size();
	int iterations = 0;

	// MAIN LOOP: Walk along the path from current box to target box.
	do
	{
		if (++iterations > maxIterations)
			break;

		box = &g_Level.PathfindingBoxes[boxNumber];

		// Clamp target Y to box height.
		// Flying creatures stay above the floor.
		if (LOT->Fly != NO_FLYING)
		{
			if (target->y > box->height - BLOCK(1))
				target->y = box->height - BLOCK(1);
		}
		else if (target->y > box->height)
		{
			target->y = box->height;
		}

		// Get current box boundaries.
		boxLeft = ((int)box->left * BLOCK(1));
		boxRight = ((int)box->right * BLOCK(1)) - 1;