Scribd
Upload
46 views12 pages

Hill Climbing

Hill climbing is a local search algorithm that starts with an initial solution and iteratively moves to a neighbor with improved value until no better neighbors exist. It can get stuck at local optima rather than finding the global optimum. Variants include simple hill climbing, which moves to the first improving neighbor; steepest ascent, which moves to the best neighbor; and stochastic hill climbing, which randomly selects neighbors. Problems include getting stuck at local optima or plateaus, and ridges can be addressed through backtracking or bidirectional search.

Uploaded by

Vishesh Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
46 views12 pages

Hill Climbing

Hill climbing is a local search algorithm that starts with an initial solution and iteratively moves to a neighbor with improved value until no better neighbors exist. It can get stuck at local optima rather than finding the global optimum. Variants include simple hill climbing, which moves to the first improving neighbor; steepest ascent, which moves to the best neighbor; and stochastic hill climbing, which randomly selects neighbors. Problems include getting stuck at local optima or plateaus, and ridges can be addressed through backtracking or bidirectional search.

Uploaded by

Vishesh Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Hill Climbing Algorithm in

Artificial Intelligence
By - Astha Tripathi
Introduction
• 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. It terminates when it reaches
a peak value where no neighbor has a higher value.
• Hill climbing algorithm is a technique which is used for optimizing the mathematical problems. 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.
• Generate and Test variant: Hill Climbing is the variant of Generate and Test method. The Generate and Test
method produce feedback which helps to decide which direction to move in the search space.
• Greedy approach: Hill-climbing algorithm search moves in the direction which optimizes the cost.
• No backtracking: It does not backtrack the search space, as it does not remember the previous states.
State-space Diagram for Hill Climbing:
Types of Hill Climbing Algorithm

• Simple hill Climbing:


• Steepest-Ascent hill-climbing:
• Stochastic hill Climbing:
Simple Hill Climbing:

• Simple hill climbing is the simplest way to implement a hill climbing algorithm. It
only evaluates the neighbor node state at a time and selects the first one which
optimizes current cost and set it as a current state. It only checks it's one successor
state, and if it finds better than the current state, then move else be in the same
state. This algorithm has the following features:
• Less time consuming
• Less optimal solution and the solution is not guaranteed
Steepest-Ascent hill climbing:

• The steepest-Ascent algorithm is a variation of simple hill climbing algorithm. This algorithm
examines all the neighboring nodes of the current state and selects one neighbor node which is
closest to the goal state. This algorithm consumes more time as it searches for multiple neighbors.
Stochastic hill climbing:

• Stochastic hill climbing does not examine for all its neighbor before moving.
Rather, this search algorithm selects one neighbor node at random and decides
whether to choose it as a current state or examine another state.
Problems in Hill Climbing Algorithm:
1. Local Maximum: A local maximum is a peak
state in the landscape which is better than each
of its neighboring states, but there is another
state also present which is higher than the local
maximum.
Solution: Backtracking technique can be a
solution of the local maximum in state space
landscape. Create a list of the promising path so
that the algorithm can backtrack the search
space and explore other paths as well.
Cont..
2. Plateau: A plateau is the flat area of the search
space in which all the neighbor states of the
current state contains the same value, because of
this algorithm does not find any best direction to
move. A hill-climbing search might be lost in the
plateau area.

Solution: The solution for the plateau is to take


big steps or very little steps while searching, to
solve the problem. Randomly select a state
which is far away from the current state so it is
possible that the algorithm could find non-
plateau region.
Cont..
3. Ridges: A ridge is a special form of the local
maximum. It has an area which is higher than its
surrounding areas, but itself has a slope, and cannot
be reached in a single move.

• Solution: With the use of bidirectional search, or by


moving in different directions, we can improve this
problem.
Pseudo code of the Hill Climbing method

You might also like