贪婪的 最佳第一搜索算法是否与最佳第一搜索算法不同？

该wiki页面大约有贪婪的BFS一个单独的段落，但它是一个有点不清楚。

我的理解是，贪婪的BFS只是Wikipedia的算法中“ OPEN最好的节点”是一个为节点计算的启发式函数的BFS。所以实现这个：

OPEN = [initial state]
CLOSED = []
while OPEN is not empty
do
 1. Remove the best node from OPEN, call it n, add it to CLOSED.
 2. If n is the goal state, backtrace path to n (through recorded parents) and return path.
 3. Create n's successors.
 4. For each successor do:
   a. If it is not in CLOSED: evaluate it, add it to OPEN, and record its parent.
   b. Otherwise: change recorded parent if this new path is better than previous one.
done

“贪婪的BFS”实际上是“贪婪的BFS”，其中“ OPEN中的最佳节点”是一种启发式函数，用于估计节点与目标的距离。我对吗？

编辑： 评论匿名者的答案：

因此，贪婪的BFS本质上不需要“ OPEN列表”，而应该仅基于当前节点做出决定吗？这个算法是GBFS：

1. Set START as CURRENT node
2. Add CURRENT to Path [and optinally, to CLOSED?]
3. If CURRENT is GOAL, exit
4. Evaluate CURRENT's successors
5. Set BEST successor as CURRENT and go to 2.