BEST FIRST SEARCH

Domain	Definition
Computing	Best first search 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). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Frequency of Internet Keywords: BEST FIRST SEARCH

The following statistics estimate the number of searches per day across the major English-language search engines as identified by various trade publications. Hyperlinks lead to commercial use of the expression at Amazon.com.

Anagrams: BEST FIRST SEARCH

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "a-b-c-e-e-f-h-i-r-r-s-s-s-t-t"
	-3 letters: researchists.
	-4 letters: afterbirths, researchist, tetrarchies, traitresses.
	-5 letters: aesthetics, afterbirth, birthrates, brasseries, brassieres, breathiest, briefcases, careerists, chastisers, chatterers, earthrises, fricassees, hesitaters, restitches, scatterers, starchiest, starfishes, streetcars, stretchers, stretchier, tesseracts.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.