Bucharest

Bucharest

Bucureş ti

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

Tom bought a ticket to Bucharest.

Now we've given the agent the full map of Romania.

And 220 plus 97 is 317.

Let's say we start off in Arad, and 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.

Now let's go back to Romania and apply the A algorithm and we're going to use a heuristic, which is a straight line distance between a state and the goal.

We don't add the path going back because it's in the explored list, but we don't terminate it yet.

Now, it may seem silly and redundant to have a path that starts in Arad, goes to Sibiu and returns to Arad.

We have to go down this direction, up, then we reach a path we've seen before, and we go in this direction.

The actions that the agent can execute when driving from one city to the next along one of the roads shown on the map.

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

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.

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.