![]() ![]() Hill Climbing is mostly used when a good heuristic is available.A node of hill climbing algorithm has two components which are state and value.It is also called greedy local search as it only looks to its good immediate neighbor state and not beyond that.One of the widely discussed examples of Hill climbing algorithm is Traveling-salesman Problem in which we need to minimize the distance traveled by the salesman. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |