2 lectures 16 17-informed search algorithms ch 4.3
Optimality of A*(standard proof) Suppose suboptimal goal G 2 in the queue. Let n be an unexpanded node on a shortest path to optimal goal G. f(G 2 ) =
Computing & Information Sciences Kansas State University Monday, 08 Sep 2008CIS 530 / 730: Artificial Intelligence Lecture 5 of 42 Monday, 08 September.
More advanced aspects of search Extensions of A*.
