Hill Climbing

• Heuristic search. BFS and DFS are uninformed and exhaustive.
• A simple form of non-exhaustive search is a greedy algorithm.
• In a 3D geometric topology, this is called steepest ascent hill climbing. You simply go up as fast as you can.
• This can lead to local maxima.
• You can also do any way up hill climbing.
• This requires a measurement of what's the best next move from the current position.
• You might be able to do it with the maze if you know the direction of the goal.
• How would this work on the travelling salesman problem?
• It's also called best first search. Just choose the best next option.