Bucharest

Bucharest

The goal, again, is Bucharest, and so the distance from Bucharest to Bucharest is, of course, 0.

Tom bought a ticket to Bucharest.

Okay, and now, notice that we're closing in on Bucharest.

How can that help us get to our destination in Bucharest?

And the problem then is to find a route from Arad to Bucharest.

To start, he's in Arad, and the destination or goal is in Bucharest.

Male narrator The answer is that we add 1 more path, the path to Bucharest.

Now the cheapest node is 239 here, so we expand, finally, into Bucharest at a cost of 460.

True, we have added a path that ends in Bucharest, but the goal test isn't applied when we add a path to the frontier.

let's say that the state of being in Bucharest is the only state that counts as a goal, and all the other states are not goals.

The question is, is there a solution that the agent can come up with given the knowledge shown here to the problem of driving from Arad to Bucharest?

Now we reach Bucharest, which is the goal, and the h value is going to be 0 because we're at the goal, and the g value works out to 418.

There is no solution that the agent can come up with because Bucharest doesn't appear on the map, and so the agent doesn't know any actions that can arrive there.

In a route finding problem, the only goal would be being in the destination city the city of Bucharest and all the other states would return false for the Goal Test.

This is a route finding problem where we're given a start city, in this case, Arad, and a destination, Bucharest, the capital of Romania, from which this is a corner of the map.