Homework 2 A* search Solution

Implement the A* search algorithm for the Romania map route-finding problem to find the shortest path between Zerind and Bucharest. Use straight distance as the heuristic function. Answer the following questions:



What route was discovered?



How many nodes were expanded?



What is the cost of this solution?



Same problem as in 1. with a new evaluation function f’ = (1-w)g + wh, where w = 0.25 and w = 0.75.



Please submit the source code and results via e-learing.