From b1dde938276f226c823769f19e55c34dd70365ff Mon Sep 17 00:00:00 2001
From: bash <hermensb@gmail.com>
Date: Mon, 18 May 2026 00:59:59 +0200
Subject: [PATCH] Revert non-progress chained-probe detection (broke valid
 paths)

---
 src/Mgr/Travel/TravelMgr.cpp | 23 -----------------------
 1 file changed, 23 deletions(-)

diff --git a/src/Mgr/Travel/TravelMgr.cpp b/src/Mgr/Travel/TravelMgr.cpp
index e05b6af70..7d287e824 100644
--- a/src/Mgr/Travel/TravelMgr.cpp
+++ b/src/Mgr/Travel/TravelMgr.cpp
@@ -852,18 +852,6 @@ std::vector<WorldPosition> WorldPosition::getPathFromPath(std::vector<WorldPosit
 
     PathGenerator path(pathUnit);
 
-    // Non-progress detection: track best distance-to-target seen so
-    // far. Bail only after many consecutive iterations with no
-    // meaningful improvement — the chained probe can legitimately
-    // zigzag (especially on dense vertical-stacked polys like spiral
-    // ramps) so we want a generous threshold to avoid false positives.
-    // Trigger fires only when stuck for ~10 iterations in a navmesh
-    // pocket where no step gets us 1y closer to the target.
-    float bestDistToTarget = std::numeric_limits<float>::max();
-    uint32 iterSinceImprovement = 0;
-    constexpr uint32 MAX_ITER_NO_IMPROVEMENT = 10;
-    constexpr float MIN_IMPROVEMENT = 1.0f;
-
     // Limit the pathfinding attempts
     for (uint32 i = 0; i < maxAttempt; i++)
     {
@@ -883,17 +871,6 @@ std::vector<WorldPosition> WorldPosition::getPathFromPath(std::vector<WorldPosit
         if (isPathTo(subPath))
             break;
 
-        float distNow = this->distance(&subPath.back());
-        if (distNow < bestDistToTarget - MIN_IMPROVEMENT)
-        {
-            bestDistToTarget = distNow;
-            iterSinceImprovement = 0;
-        }
-        else if (++iterSinceImprovement >= MAX_ITER_NO_IMPROVEMENT)
-        {
-            break;
-        }
-
         currentPos = subPath.back();
     }