Greedy best-first search expands the node whose heuristic h(n) makes it look closest to the goal. It ignores the cost already spent getting there, so it can be fast but follow a promising route into a dead end or long detour. A* also considers the cost so far. section 12.1
Use it when finding a good path quickly matters more than guaranteeing the lowest-cost path. Weighted A* offers another alternative when that tradeoff is acceptable. section 12.3
