HOMEWORK > Homework-3-solutions.
University of Texas, Dallas CS 6364 Question 1 Let h1(n), h2(n), and h3(n) be three heuristic estimates to the distance from node n to the nearest goal node. It is known that h1(n) and h2(n) are both admissible heuristics, but h3(n) is not known to be admissible. (An admissible heuristic always underestimates the distance to the nearest goal node.) We define other heuristics as co ...[Show More]
Preview 1 out of 4 pages
Reviews( 0 )
| Category: | |
| Number of pages: | 4 |
| Language: | English |
| Last updated: | 1 month ago |
| Downloads: | 0 |
| Views: | 1 |
-preview.jpeg)
-preview.jpeg)
-preview.jpeg)
-preview.jpeg)
