Greedy BFS
Using a greedy algorithm, expand the first successor of the parent. After a successor is generated:
- 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.
- 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:
“There is no dream of love, however ideal it may be, which does not end up with a fat, greedy baby hanging from the breast.”
—Charles Baudelaire (1821–1867)