This document discusses hill climbing, an optimization technique used to find the best solution to a problem. It begins by explaining hill climbing search and its implementation. It then provides examples of applying hill climbing to solve the N-Queen problem and the 8-puzzle problem. The document notes some drawbacks of hill climbing and introduces random restart hill climbing as a variation that can help overcome local maxima issues.

1. Hill Climbing
Lecture-25
Hema Kashyap
1

2. Hill Climbing Search
2

3. 3

4. Implementation
4

5. Implementation
5

6. Example-2
6

7. Example 3:N Queen Problem
7

8. Example 4: 8-Puzzle
8

9. Drawbacks of Hill Climbing
9

10. Random Restart Hill Climbing
• Generates different strating points when no
progress can be made from the previous point
• Saves the best result
• Can eventually find out the optimal solution if
enough iterations are allowed
• The fewer local mavima, the quiker it finds a
good solution
10