Question

.Compare the performance of A∗ and RBFS on a set of randomly generated problems in the 8-puzzle (with Manhattan distance) and TSP (with MST—see Exercise 3.30 in AI book) domains. Discuss your results. What happens to the performance of RBFS when a small random number is added to the heuristic values in the 8-puzzle domain?
2.Trace the operation of A∗ search applied to the problem of getting to Bucharest from Lugoj using the straight-line distance heuristic. That is, show the sequence of nodes that the algorithm will consider and the f, g, and h score for each node.
3. Devise a state space in which A∗ using GRAPH-SEARCH returns a sub optimal solution with an h (n) function that is admissible but inconsistent.
4.Consider the unbounded version of the regular 2D grid shown in Figure 3.9. The start state is at the origin, (0, 0), and the goal state is at (x,y).
a.How many nodes are expanded by A∗ graph search using h?
b. Does h remain admissible if some links are removed?
c. Does h remain admissible if some links are added between nonadjacent states?

Answer 1

i know what is the answer but it is to long