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:
“There’s a theory, one I find persuasive, that the quest for knowledge is, at bottom, the search for the answer to the question: “Where was I before I was born.” In the beginning was ... what? Perhaps, in the beginning, there was a curious room, a room like this one, crammed with wonders; and now the room and all it contains are forbidden you, although it was made just for you, had been prepared for you since time began, and you will spend all your life trying to remember it.”
—Angela Carter (1940–1992)