Please enable JavaScript.
Coggle requires JavaScript to display documents.
Search In Complex Worlds - Coggle Diagram
Search In Complex Worlds
Local Search
General Idea
initial state
moves to neighboring states
no memory of old states or path
repeat
Properties
not systematic
no reason to expect it to be complete or optimal
contends with partial knowlegdge
still can be effective
uses little memory
reasonable solutions in huge or infinite spaces
State space landscape
shows values of objective function
Hill Climbing
General Idea
Search all children for largest
f()
then move to the largest value child node
Kinda like a greedy algorithm
Issues
Local Maxima
a peak thats not the highest in
S
Plateau
broad and flat region
Ridge
flat region with drop-offs to the side
Variations
Stochastic hill climbing
Picks randomly from improving moves
slower
can find better solutions
first choice hill climbing
uses the first node generated with an improvement
random restart hill climbing
runs for a while then restarts at random location
no memory
z
choose a likely new starting point