n. an approach to problem-solving which chooses a path closest to the solution first. The strategy involves evaluating all possible paths leading to the solution as to the likelihood that they would be successful. The most promising path is selected and attempted first. See heuristic search.

BEST-FIRST SEARCH: "In terms of problem-solving, the best-first search is one of the fastest, most practical ways to end a search and find the solution."
Cite this page: N., Pam M.S., "BEST-FIRST SEARCH," in, April 7, 2013, (accessed September 18, 2021).