It is an iterative algorithm that starts with an arbitrary solution to a problem and attempts to find a better solution by changing a single element of the solution incrementally. If the change produces a better solution, an incremental change is taken as a new solution. This process is repeated until there are no further improvements.<\/p>\n
function Hill-Climbing (problem), returns a state that is a local maximum.<\/p>\n
inputs: problem, a problem<\/p>\n
local variables: current, a node
\nneighbor, a node<\/p>\n
current ←Make_Node(Initial-State[problem])
\nloop
\ndo neighbor ← a highest_valued successor of current
\nif Value[neighbor] ≤ Value[current] then
\nreturn State[current]
\ncurrent ← neighbor
\nend<\/p>\n
Disadvantage<\/strong>: This algorithm is neither complete, nor optimal.<\/p>\n","protected":false},"excerpt":{"rendered":" It is an iterative algorithm that starts with an arbitrary solution to a problem and attempts to find a better solution by changing a single …<\/p>\n","protected":false},"author":2,"featured_media":0,"menu_order":0,"template":"","meta":{"footnotes":""},"class_list":["post-3337","glossary","type-glossary","status-publish","hentry"],"yoast_head":"\n