9/10/20
1
Properties)of)Heuristic)
Functions
MICHAEL)WOLLOWSKI
Introduction
We(will(now(look(at(three(properties(of(heuristic(functions:
◦Informedness
◦Admissible
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Properties of Heuristic Functions, Lecture notes of Algorithms and Programming
A key property of a heuristic function is that it has to be admissible. By admissible we mean that the function never overestimates. In other ...
Typology: Lecture notes
2021/2022
1 / 3
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Properties of Heuristic Functions and more Lecture notes Algorithms and Programming in PDF only on Docsity!
Properties of Heuristic
Functions
MICHAEL WOLLOWSKI
Introduction
We will now look at three properties of heuristic functions: ◦ Informedness ◦ Admissible
Informedness
Let’s consider the following heuristic function: h = 0. It is very optimistic, it always assumes we have reached the goal. However, it brings us back to uniform-cost search. It is just not as informed as the straight-line distance heuristic. As you can imagine, there are other heuristics that are more or less informed. Informedness can be visualized as the width of our ellipses, the smaller the width, the more informed a heuristic is.
Admissibility
A key property of a heuristic function is that it has to be admissible. By admissible we mean that the function never overestimates. In other words, it always has to underestimate the remaining cost.