Hill Climbing

Hill climbing is an example of an informed search method because it uses information about the search space to search in a reasonably efficient manner. The Hill climbing search always moves towards the goal. Using heuristics it finds which direction will take it closest to the goal. The name hill climbing is derived from simulating the situation of a person climbing the hill. A hiker is lost halfway up/down a mountain at night. His camp is at the top of the mountain. Even though it is dark, the hiker the hiker knows that evey step he takes up the mountain is a step towards his goal.

The algorithm for Hill climbing is as follows:

1. Evaluate the initial state, if it is goal state quit otherwise make current state as initial state.
2. Select a new operator that could be applied to this state and generate a new state.
3. Evaluate the new state
• If this new state is closer to the goal state, than current state make the new state as the current state.
• If it is not better ignore this state and proceed with current state.
• If the current state is goal state or no new operators are available, quit. Otherwise repeat from 2.

Problems with Hill climbing

There are three problems encountered in hill climbing technique:

1. Local maxima

It is a state which is better than all of its neighbours but is not better than some other states which are farther away. It is a state where we have climbed to the top of the hill, and missed the mountain.

Solution to the problem

i. One possible solution is backtracking.

We can backtrack to some earlier node and try to go in a different direction to attain the global peak. We can maintain a list of paths almost taken and go back to one of them if the path that was taken leads to a dead end.

ii. Another solution can be a list of promising plan.

1. Plateau

It is a state where everything around is about as good as where we are currently. In other words a flat area of the search space in which all neighbouring states have the same value.

Solution to the problem

i. A big jump in some direction can be done in order to get to a new section of search space. This method is recommended as in a plateau all neighbouring points have the same value.

ii. Another solution is to apply small steps several times in the same direction. This depends on the rules available.

1. Ridges

It is a special kind of local maximum. It is an area of the search space which is higher than the surrounding areas and that itself has a slope. We cannot travel the ridge by single moves as the orientation of the high region compared to the set of available moves makes it impossible.

Solution to the problem

i. Trying different paths at the same time is a solution. We can apply two or more rules before doing the test. This corresponds to moving in several directions at once.

ii. Bidirectional search can be useful here.

• It can be used in conversions as well as discrete domains

• It is not an efficient method.
• It is not suited to problems where the value of the heuristic function drops off suddenly when the solution may be in sight.
• It is a local method as it looks at the immediate solution and decides about the next step to be taken rather than exploring all consequences before taking a move.
Hill Climbing

3 thoughts on “Hill Climbing”

1. Uday says:

Nice notes….after searching so many websites I finally found the relevant study material on this topic.

2. appas says:

thank you very much,preethi

Scroll to top
You cannot copy content of this page. The content on this website is NOT for redistribution