SEARCH
🇬🇧
MEM
O
RY
.COM
4.37.48
Guest
Log In
Â
Homepage
0
0
0
0
0
Create Course
Courses
Last Played
Dashboard
Notifications
Classrooms
Folders
Exams
Custom Exams
Help
Leaderboard
Shop
Awards
Forum
Friends
Subjects
Dark mode
User ID: 999999
Version: 4.37.48
www.memory.com
You are in browse mode. You must login to use
MEM
O
RY
  Log in to start
Index
 »Â
Intro to AI 1
 »Â
Lecture 3 - Informed search
 »Â
Level 1 of Lecture 3 - Informed search
« Previous
Next »
From course:
Intro to AI 1
» Start this Course
(Practice similar questions for free)
Question:
Optimality of A*
Author:
Christian N
6 months ago
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 Stars
1 Star
1.5 Stars
2 Stars
2.5 Stars
3 Stars
3.5 Stars
4 Stars
4.5 Stars
5 Stars
0 / 5
Â
(0 ratings)
1
answer(s) in total
Author
Christian N