You are here: irt.org | FOLDOC | best first search
<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)
Nearby terms: Berzerkley « bespoke « best effort « best first search » best fit » BETA » beta
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL