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)