AI Search Algorithms
Path from Start to Goal for an undirected graph:
Edge weights are on the diagram, use the below h-function for part 3.
h(n) 9 24162 27512
Copyright By Assignmentchef assignmentchef
Questions:
You can assume a visited-set that avoids revisiting nodes.
For BFS and ID, choose the lower alphabetical first (so A before B, etc.)
1. [3 pts.] Show the order of nodes visited using Breadth First Search (BFS), and the final
path selected. Is this optimal? Why or why not?
2. [3 pts.] Show the order of nodes visited using Iterative Deepening (initial depth of 2
increasing depth by 1), and the final path selected. Is this optimal? Why or why not?
3. [4 pts.] Using the above h-function, show the order of nodes visited using A*, and the
final path selected. Is this optimal? Why or why not?
CS: assignmentchef QQ: 1823890830 Email: [email protected]
Reviews
There are no reviews yet.