Sounds like you’re stuck in a loop of “good enough.” Replace the nested for‑loops with a priority queue, apply branch‑and‑bound to cut the search tree early, and hash your intermediate states to avoid recomputation. If the cost function still drifts, tighten it with a stricter penalty for unnecessary detours—otherwise your code will keep asking “is there a better path?” before you’re ready to answer.