The Search Trees Strategy

1. we have that many problems can be translated into search trees...

1.1. BEST-FIRST-SEARCH

1.1.1. It is a way to combine in a single method the advantages of the search of the first in depth and search of the first in amplitude.

1.2. BRANCH-AND-BOUND

1.2.1. The algorithm suggests that a problem may have feasible solutions, for them solutions must be discovered that may be not so optimal and then it is necessary to narrow the space of the solution.

1.2.1.1. We can solve problems like...

1.2.1.1.1. problems personal assignment.

1.2.1.1.2. travel agent optimization problems.

1.3. DEPTH-FIRTS SEARCH

1.3.1. it works by choosing the deepest node to expand it.

1.4. HILL CLIMBING

1.4.1. This greedy method uses a heuristic measure to order the options and if you have better heuristics the better the hill climb.