Suppose we have 2 paths, 1st path that has the lower hurestic value but it does not contain the goal, will the greedy best first search will go to that path that has the lower hurestic values or it will go to other path which contains the goal ? please explain
Suppose we have 2 paths, 1st path that has the lower hurestic value but it does not contain the goal, will the greedy best first search will go to that path that has the lower hurestic values or it will go to other path which contains the goal ? please explain
It selects a node with the lowest heuristic value using a priority queue, regardless of whether the node is on the path to the goal.