A* algorithm A member of the class of best-first heuristic search techniques that attempt to find a “best” path from a given start node to a designated goal node in a problem graph . An evaluation function is used to estimate the cost of the (unknown) distance from the current node being explored to the goal and this ...