greedy best first Algorithm

Best-first algorithms are often used for path finding in combinatorial search."Some writers have used" best-first search" to refer specifically to a search with a heuristic that try to predict how near the end of a path is to a solution, so that paths which are judged to be closer to a solution are extended first.

greedy best first source code, pseudocode and analysis