0

6.0kviews

Explain Hill-climbing algorithm with an example

written 8.0 years ago by teamques10 ★ 68k

modified 2.5 years ago by binitamayekar ★ 6.6k

artificial intelligence

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

60views

written 8.0 years ago by teamques10 ★ 68k

• Difficulty: we want to still be able to generate the path with minimum cost

• A* is an algorithm that:

  – Uses heuristic to guide search

  – While ensuring that it will compute a path with minimum cost

• A* computes the function

• f(n) = g(n) + h(n)

  – g(n) = “cost from the starting node to reach n”

  – h(n) = “estimate of the cost of the cheapest path from n to the goal node”

• Example: minimize f(n) = g(n) + h(n)

ADD COMMENT SHARE EDIT