Is the greedy best-first search algorithm different from the best-first search algorithm?

Question

Is the greedy best-first search algorithm different from the best-first search algorithm?

The wiki page has a separate paragraph about Greedy BFS but it\'s

Answer 1

As far as I understand, "best-first search" is only a collective name of a particular search technique in which you use a heuristic evaluation function h(n). So, A* and greedy best-first search are algorithms that fall into this category.