Best-first Search - Greedy BFS

Greedy BFS

Using a greedy algorithm, expand the first successor of the parent. After a successor is generated:

  1. If the successor's heuristic is better than its parent, the successor is set at the front of the queue (with the parent reinserted directly behind it), and the loop restarts.
  2. Else, the successor is inserted into the queue (in a location determined by its heuristic value). The procedure will evaluate the remaining successors (if any) of the parent.

Read more about this topic:  Best-first Search

Famous quotes containing the word greedy:

    “Don’t make your enemies happy.
    Make up with your lover,
    who’s greedy to be back
    in your good graces.
    Daughter,
    because you’ve taken anger to extremes,
    you won’t amount
    to a hill of beans.”
    —Hla Stavhana (c. 50 A.D.)