Difference hill climbing and stipest hill climbing
Answers
Answered by
0
This differs from the basic Hill climbing algorithm by choosing the best successor rather than the first successor that is better. This indicates that it has elements of the breadth first algorithm.
The algorithm proceeds
Steepest ascent Hill climbing algorithm
1 Evaluate the initial state
2 If it is goal state Then quit
otherwise make the current state this initial state and proceed;
3 Repeat
set Target to be the state that any successor of the current state can better;
for each operator that can be applied to the current state
apply the new operator and create a new state
evaluate this state
If this state is goal state Then quit
Otherwise compare with Target
If better set Target to this value
If Target is better than current state set current state to Target
Until a solution is found or current state does not change
Both the basic and this method of hill climbing may fail to find a solution by reaching a state from which no subsequent improvement can be made and this state is not the solution.
The algorithm proceeds
Steepest ascent Hill climbing algorithm
1 Evaluate the initial state
2 If it is goal state Then quit
otherwise make the current state this initial state and proceed;
3 Repeat
set Target to be the state that any successor of the current state can better;
for each operator that can be applied to the current state
apply the new operator and create a new state
evaluate this state
If this state is goal state Then quit
Otherwise compare with Target
If better set Target to this value
If Target is better than current state set current state to Target
Until a solution is found or current state does not change
Both the basic and this method of hill climbing may fail to find a solution by reaching a state from which no subsequent improvement can be made and this state is not the solution.
Answered by
1
Simple hill climbing: A mathematical optimization technique where an iterative algorithm starts with an arbitrary solution to a problem and then attempts to find a better solution by making an incremental change to the solution is called as simple hill climbing.
Steepest ascent hill climbing: It is similar to simple hill climbing algorithm but steepest ascent hill climbing all successors are compared and the closest to the solution is chosen.
Difference:
- In simple hill climbing, the first node that is close is chosen whereas in steepest ascent hill climbing, all the successors are compared and the closest to the solution is chosen.
- Steepest ascent hill climbing is a best first search algorithm while Simple hill climbing is breadth first search technique.
Read more on Brainly.in - https://brainly.in/question/6293363
Similar questions