ORithm> 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)