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:

Greedy search

Author: Christian N



Answer:

Evaluation function h(n) (heuristic) is an estimate of cost from n to the closest goal Greedy search expands the node that appears to be closest to goal


0 / 5  (0 ratings)

1 answer(s) in total