Lecture 5 Flashcards
1
Q
What is a best first search?
A
Choose node with minimum value of some evaluation function.
2
Q
Can a heuristic function be non-negative?
A
No, it is zero at the goal state.
3
Q
How does a greedy search work?
A
Expand node you think is the closest goal state.
4
Q
Why is greedy search not effective?
A
Heuristic is not perfect estimation.
5
Q
How does a* work?
A
Path cost + heuristic cost.
5
Q
When is A* optimal?
A
if h(n) is an underestimate of the actual cost from n to the goal!
6
Q
When is a heuristic admissible?
A
When 0 < h(n) < true cost to nearest goal
7
Q
A
