Skip to content

How does steepest descent ascent Hill climbing work?

Cameron W edited this page Jun 8, 2017 · 3 revisions

How does steepest-descent/ascent Hill-climbing work?

  1. Check if the current state is a solution, if so retuHow does steepest-descent/ascent Hill-climbing work?

    • All successors are compared and select the best state.
  2. The decision on descent or ascent depends on the heuristics. rn it else go to next step.

  3. Expand the current state of the search.

  4. Evaluate its children states using a heuristic function.

  5. Select the FIRST better state for further expansion.

  6. Continue steps 1 - 4 until it finds a solution or reach no better state.

What is Simple Hill-climbing Algorithm?

  • Check if the current state is a solution, if so return.

Clone this wiki locally