best-first search
Search strategy that expands the node judged most promising by a heuristic. Basis for A* and other informed search algorithms.
1 milestone
A* Search Algorithm Published by Hart, Nilsson, and Raphael at Stanford Research Institute
In 1968, Peter E. Hart, Nils J. Nilsson, and Bertram Raphael at the Stanford Research Institute published 'A Formal Basis for the Heuristic Determination of Minimum Cost Paths', introducing the A* search algorithm, which finds shortest paths in graphs efficiently by combining actual path cost with a heuristic estimate of remaining cost.