The Romanian Holiday Map - Bidirectional Breadth-First Search Algorithm - Engineering Assignment Help

Assignment Task:

Write an integrated LISP codes that implements the following two search algorithms:

1. Bidirectional breadth-first search algorithm. The agent’s initial state is at Urziceni and the goal state is at Arad.

2. Iterative deepening A* search algorithm. The agent’s initial state is at Arad and the goal state is at Bucharest. 
1. For Bidirectional breadth-first search algorithm, the following feature should be incorporated into the code:

(a) Assume that each step cost is 1 KM.

(b) By default, during the search for a solution path, no repeated states are allowed. However, twice-repeated states are allowed for up to a maximum of 3 selected cities by user. If a user did not indicate any choice, the system should pick a city within the map before the start of the search for the solution path. 
2. For iterative deepening A* search algorithm, the following features should be incorporated into the code:

(a) Use the information on the map and the heuristic values as in the lecture slide. 
(b) By default, during the search for a solution path, no repeated states are allowed. However, a user can specify up to a maximum of 3 cities that should not be traversed by the agent. In this case, the agent will bypass the cities as indicated by the user. If a user did not indicate any choice, the system should pick a city within the map for the agents before the start of the search.

(c) A user must select one city as Rest and Relax (R&R). During the search, if the agent is at the city which has been marked as R&R, it will stop for ten-time units for a coffee break before continuing with the search for a solution path. 
3. The program should be able to do the following:

(a) Implement bidirectional search using breadth-first search algorithm and iterative deepening A* search algorithm with the features as listed as above.

(b) Construct and show the content of closed and open lists step-by-step during the implementation of the algorithms.

(c) Calculate and display the total number of nodes generated step-by-step during the implementation of the algorithms.

(d) Display the solution path (if any) (e) Calculate the path cost (if there is a solution path). 
Write a txt file to explain your codes. 

This Engineering Assignment has been solved by our Engineering Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.