1.

Prove each of the following statements:

a) Breadth-first search is a special case of uniform-cost search.
b) Breadth-first search, depth-first search, and uniform-cost search are special cases
of best-first search.
c) Uniform-cost search is a special case of A* search.

2. Give the name of the algorithm that results from each of the following special cases:
a) Local beam search with k = 1.
b) Local beam search with one initial state and no limit on the number of states
retained.
c) Simulated annealing with T = 0 at all times (and omitting the termination test).
d) Genetic algorithm with population size N = 1.

3. Compare the performance of A* and RBFS on a set of randomly generated problems in

the 8-puzzle (with Manhattan distance) domains. Discuss your results. What happens to
the performance of RBFS when a small random number is added to the heuristic values
in the 8-puzzle domain?

4. Write about Local Search in Continuous Space?

5. Write in Detail about Local Search Algorithms And Optimization Problems?

6. Write about Memory bounded Heuristic Search Algorithms?