Steepest-Ascent Hill climbing: It first examines all the neighboring nodes and then selects the node closest to the solution state as of next node.
A Useful variation of Simple Hill Climbing considers all the moves from the current state and selects the best one as the next state. This method is called steepest ascent or gradient search.
Both simple and ascent hill climbing may fail to find a solution. They
may terminate by finding a state from which no better states can be generate instead of goal state.
🔗Important playlists:
Artificial Intelligence: https://www.youtube.com/playlist?list=PL5-M_tYf311YXhOOv6Cy4YgnwTslHOH5_
🌐Join our community:
Android App(Notes+Videos): https://play.google.com/store/apps/details?id=com.thinkx.thinkx
Facebook: https://www.facebook.com/thinkxacademy
Twitter: https://www.twitter.com/thinkxacademy
Instagram: https://www.instagram.com/thinkxacademy
#hillclimbing #artificialintelligence #steepestascent #ai
