Difference between simple hill climbing and steepest ascent hill climbing in artificial intelligence
Answers
Simple hill climbing: An iterative algorithm which already has an arbitrary solution to a problem but then attempts to find a better solution by making changes to the arbitary solution is called as simple hill climbing.
Steepest ascent hill climbing: An iterative algorithm which already has an arbitrary solution to a problem but then attempts to find a better solution by comparing all the successors to the closest solution.
Difference:
The closest node is chosen in a simple hill climbing algorithm while the node closest to the solution is identified and chosen in a steepest ascent hill climbing algorithm.
Steepest ascent hill climbing - best first search algorithm
Simple hill climbing - breadth first search technique.
Yeah
Yeah
Yeah
Yeah
Yeah
.
Yeah