Encyclopedia > Best-first search

  Article Content

Best-first search

Best-first search is a search algorithm which optimises breadth first search by ordering all current paths according to some heuristic. The heuristic attempts to predict how close the end of a path is to a solution. Paths which are judged to be closer to a solution are extended first.

Efficient selection of the current best candidate for extension is typically implemented using a priority queue.

Examples of best-first search algorithms include Dijkstra's algorithm and the A-star search algorithm. Best-first algorithms are often used for pathfinding in combinatorial search.

External links



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Canadian Music Hall of Fame

... 1995 Buffy Sainte-Marie[?] 1996 David Clayton-Thomas[?] 1996 Denny Doherty[?] 1996 John Kay[?] 1996 Dominic Troiano[?] 1996 Zal Yanovsky 1997 Gil Evans[?] ...

 
 
 
This page was created in 21.3 ms