# AI software to determine distance between countries i just need the program for the follwing example i will compare it to another project later

예산 $30-250 USD

write a program to find a path between two European cities, using only the roads provided on the map. For instance, we may want you to find a path from Paris to Vienna. One such path would be Paris to Genoa to Rome to Munich to Prague to Vienna, with a total length of 629 + 328 + 582 + 174 + 185 = 1898 kilometers.

You will need to propose a suitable data type to store the information in the map together with methods to generate the neighbor cities, test for the Goal State, and any other methods related to the domain. You will also need to implement a queue data type to store the nodes during the search. SEARCH also keeps track of how many nodes have been expanded altogether, and returns that information at the end, along with the path it found and the cost of the path. The final result of a search from Amsterdam to Berlin might be

(14 520 Amsterdam Hamburg Berlin)

indicating that a total of 14 search nodes were examined, that the total cost of the solution found was 520, and that the solution discovered is Amsterdam to Hamburg to Berlin.

The roads connecting the cities are provided in the accompanying text file: [login to view URL], where you’ll find a list of triples, each is a list in the form (city1 city2 dist) where "city1" and "city2" are connected by a direct road of length "dist" kilometers.

Also provided are the cities’ coordinates in another accompanying text file: [login to view URL], where each element is a two-element list. The first element is the name of a city and the second element is a dotted pair, in the form (xcoord . ycoord), of the city.

The search functions that i need to work in order to compare

It is required to experiment with:

1. Depth First Search,

2. Breadth First Search,

3. Iterative Deepening,

4. Uniform Cost search,

5. Greedy algorithm,

6. and A* Search algorithm

You can use the air distance (a.k.a Euclidean distance) as the heuristic function for estimating the distance from a certain node to the goal.

- UI

You also have to implement a very simple user interface that will interact with the user asking for:

1. the city they want to start at

2. the city they want a path to

3. and the search strategy that they want to experiment

and return the resulting solution together with statistics. The statistics include total number of nodes visited, and cost; as mentioned previously:

(14 520 Amsterdam Hamburg Berlin)

The result program i need

- Run the search program on the test case "Paris to Vienna" using the six search methods, and compare their results and performance. An algorithm may be deemed successful according to several different measures. You are required to use two measures to compare the algorithms which are the number of nodes it expands, and the cost of the solution path it finds.

- Try to find city pairs for which breadth-first search expands fewer nodes than depth-first, and vice versa. Comment on your findings

-experiment by decreasing and increasing the heuristic function by multiplying it by these factors 0.5,1.0 and 1.5 and notice the impact of the heuristic function on the nodes visited and cost.

- i need comments in the code to on each search function in order to be able to edit it later

## 이 프로젝트의 입찰 현황은 다음과 같습니다. 입찰자: 4명, 평균 입찰가: $279

We already have built large scale applications, CRMs, ERPs and huge systems can be found at our website. Like [login to view URL] [login to view URL] [login to view URL] [login to view URL] https: 더 보기

yes buddy,,i will make this porgram in matlab, you will get the best work,,,,,,,,,,,,,,,,,,,,,,,,,, accompanied with brotherhood,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,

HI , I am interested to your project , please send me message so that we can discuss more ...........