A parallel best-first search
Dexter Whitlock, Pradip Peter Dey, Robert M. Hyatt · 1988
The best-first search method is commonly employed in searching a dynamic search space with heuristic information which allows the method to locate the goal state or solution by generating only a small part of the search space. This search is efficient because it always considers the most promising node or state for expansion or exploitation. By transferring the best-first methodology into a parallel environment, the task of solving current problems is handled more efficiently.