Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Hill Climbing

  • Special case of depth-first search
  • Uses h(n) = heuristic function as its evaluation function
  • Ignores cost so far to get to that node (g(n))
  • Expand the node that appears closest to goal

 

  • Hill Climbing is not complete
    • Unless we introduce backtracking
  • Hill Climbing is not optimal
    • Solution found is a local optimum

Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.