Suppose two friends live in different cities on a map, such as the Romania map s

Question

Suppose two friends live in different cities on a map, such as the Romania map shown in Figure 3.2 of Artificial Intelligence-A Modern Approach 3rd edition. On every turn, we can simultaneously move each friend to a neighboring city on the map. The amount of time needed to move from city i to neighbor j is equal to the road distance d(i,j) between the cities, but on each turn the friend that arrives first must wait until the other one arrives (and calls the first on his/her cell phone) before the next turn can begin. We want the two friends to meet as quickly as possible.

a.Write a detailed formulation for this search problem. (You will find it helpful to define some formal notation here.)

Explanation / Answer

States are all possible city pairs (i; j). The map is not the state space.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.