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)