0
5.9kviews
Explain Hill-climbing algorithm with an example
1 Answer
0
60views
  • 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

enter image description here

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

    – g(n) = “cost …

Create a free account to keep reading this post.

and 2 others joined a min ago.

Please log in to add an answer.