|
HILL-CLIMBING is the first
local search algorithm which we covered.
It requires a complete state specification and moves between leaf
nodes in the search tree by computing valid moves that end up in other
complete states. It terminates at the
maximal value of the objective function for some states.
|
