https://github.com/janina280/artificial_intelligence

Let's suppose that two friends live in different cities on a map. At every step, we can simultaneously move each friend to a neighboring city on the map.
https://github.com/janina280/artificial_intelligence

algorithm java latex-document

Last synced: 7 days ago
JSON representation

Let's suppose that two friends live in different cities on a map. At every step, we can simultaneously move each friend to a neighboring city on the map.

• Host: GitHub
• URL: https://github.com/janina280/artificial_intelligence
• Owner: janina280
• Created: 2023-06-29T18:21:18.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2023-06-29T19:20:17.000Z (over 1 year ago)
• Last Synced: 2024-02-22T08:34:46.203Z (9 months ago)
• Topics: algorithm, java, latex-document
• Language: Java
• Homepage:
• Size: 216 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Artificial_Intelligence

Let's suppose that two friends live in different cities on a map. At every step, we can

simultaneously move each friend to a neighboring city on the map. Time required to pass

from city i to the neighboring city j is equal to the length of the road d(i, j) between the 2 cities, but at

every step the friend who arrives first has to wait until the other friend arrives

(and calls the first one on his cell phone) before the next shift can start. WANT

for the two friends to meet as soon as possible.

a. Write a detailed formulation for this search problem.

b. Identify a search algorithm for this task and explain your choice.