best first search

Computing Dictionary

best first search definition

algorithm
A graph 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.
See also beam search, hill climbing.
(1995-12-09)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source

00:10

00:09

00:08

00:07

00:06

00:05

00:04

00:03

00:02

00:01

Best first search is always a great word to know.
So is quincunx. Does it mean:
an arrangement of five objects, as trees, in a square or rectangle, one at each corner and one in the middle.
the offspring of a zebra and a donkey.
Dictionary.com, LLC. Copyright © 2012. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature
FAVORITES
RECENT