SEARCH
You are in browse mode. You must login to use MEMORY

   Log in to start


From course:

Intro to AI 1

» Start this Course
(Practice similar questions for free)
Question:

Optimality of A*

Author: Christian N



Answer:

Theorem:The tree-search version of A* is optimal if h(n) is admissibleThe graph-search version of A* is optimal if h(n) is consistent


0 / 5  (0 ratings)

1 answer(s) in total