#greedy-best-first-search

Run greedy best-first search (always extend the agenda path whose last state has the smallest $h$) on the tree below from A to the goal J, with no visited list. Arc lengths are on the edges; $h(B) = 1$, $h(C) = 6$, $h(D) = 3$ and every other state has $h = 0$. Ties are broken alphabetically. List the states in the order they are expanded, ending with J.