Informed Search Algorithms
Book section 3.5
Slides: https://webeep.polimi.it/pluginfile.php/257113/mod_folder/content/0/FAI2021-06-InformedSearchStrategies.pdf?
Pages
Introduction
An informed search uses domain-specific hints about the location of goals to find solutions more efficiently than an uninformed strategy. The hints come in the form of a heuristic function , denoted…
A* search
The most common informed search algorithm is A* search (pronounced “A-star search”), a best-first search that uses the evaluation function: $$f(n) = g(n) + h(n)$$ Where $g(n)$ is the path cost from…