-
Notifications
You must be signed in to change notification settings - Fork 0
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?
-
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.
-
The decision on descent or ascent depends on the heuristics. rn it else go to next step.
-
Expand the current state of the search.
-
Evaluate its children states using a heuristic function.
-
Select the FIRST better state for further expansion.
-
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.