-
And the answer goes as follows:
-
This one is being expanded first. It's being removed from the queue.
-
We have all those nodes for the queue over here,
-
but the first one we remove and expand is this one, because it's the smallest heuristic.
-
Then move over here, here, and finally to this guy over here,
-
and from here we expand to the goal state over here.
-
All of those remain unexpanded, and therefore receive a 0.
-
The heuristic is mostly admissible except for this guy over here, which is too large.
-
It over estimates the exact costs, and therefore we have to check "no" over here.