Hill Climbing
Hill Climbing is an iterative local search algorithm that continuously moves uphill in the direction of increasing state evaluation. It can get trapped in local maxima or plateaus.
Category:Local Search
•Difficulty:Beginner
•Time complexity:O(∞) / State-dependent
•Space complexity:O(1)
Interactive visualizationHill Climbing Visualizer
Optimization Landscape
Drag the slider to set initial starting point. Hill Climbing will only move uphill!
Start:
0 / 0
Speed:
Nodes Explored0
Frontier Size0
Path Cost g(n)—
Total Steps0