Artificial Intelligence, Q1 M2 F21
QUESTION 1. Consider the search problem below with start state S and goal state G. The transition costs are next to the edges, and the heuristic values are next to the states. A, h=4 E, h=1 S, h=6 C, h=4 3 ZD 1 3 2 D, h=3.5 F, h=1 B, h=4 2 G, h=0 i. If we use Depth First Search, and it terminates as soon as it reaches the goal state, what is the final path for this DFS search? If a node has multiple successors, then we always expand the successors in increasing alphabetical order. ii. What is the final path for this A* search? Show each step in the above answers.
Artificial Intelligence, Q1 M2 F21
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am