# Greedy Best First Search

---

FreelancingGig— [October 10, 2017](/content/blog/glossary/greedy-best-first-search/index.html)

It expands the node that is estimated to be closest to goal. It expands nodes based on f(n) = h(n). It is implemented using priority queue.

**Disadvantage**: It can get stuck in loops. It is not optimal.