A* Search Algorithm
In computer science, A* (pronounced "A star") is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable path between points, called nodes. Noted for its performance and accuracy, it enjoys widespread use.
Peter Hart, Nils Nilsson and Bertram Raphael of Stanford Research Institute (now SRI International) first described the algorithm in 1968. It is an extension of Edsger Dijkstra's 1959 algorithm. A* achieves better performance (with respect to time) by using heuristics.
Read more about A* Search Algorithm: Description, History, Process, Pseudocode, Properties, Admissibility and Optimality, Complexity, Variants of A*
Famous quotes containing the word search:
“If ever the search for a tranquil belief should end,
The future might stop emerging out of the past,
Out of what is full of us; yet the search
And the future emerging out of us seem to be one.”
—Wallace Stevens (1879–1955)