![]() ![]() 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. Hill climbing algorithm is a technique which is used for optimizing the mathematical problems.It terminates when it reaches a peak value where no neighbor has a higher value. Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem.Next → ← prev Hill Climbing Algorithm in Artificial Intelligence ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |