Build your intuition. Fill in the missing part by typing it in.

Choosing a ____ heuristic is crucial for the efficiency and accuracy of the A algorithm. A good heuristic should be admissible and consistent, ensuring that it never overestimates the actual remaining distance to the target and satisfies the condition: h(node) ≤ cost(node, neighbor) + h(neighbor). Commonly used heuristics in the A algorithm include Manhattan Distance, Euclidean Distance, Chebyshev Distance, and Octile Distance.

Fill in the blank with the appropriate term.