##  [A\* Search](/index.php/search-0) 

  ##  [A\* Search](https://natural.quantumdictionary.io/search-1) 

  

 [![Natural & Formal Sciences Dictionary](/sites/default/files/styles/large/public/2026-01/Natural%20%26%20Formal%20Sciences.png.webp?itok=2kCDRVQv)](/index.php/topic-specific-dictionaries/natural-formal-sciences)



**Natural & Formal Sciences Dictionary**

 







 

 

 

 



 

 

 

 

Definition

A best-first graph search algorithm that orders node expansion by a cost function f(n)=g(n)+h(n), where g(n) is the cost from the start to node n and h(n) is a heuristic estimate of the cost from n to a goal; with an admissible (and preferably consistent) heuristic, A* finds least-cost paths efficiently.