problem 1:

Illustrate out any two heuristic search in detail.

problem 2:

Illustrate out the term Hill climbing in detail.

problem 3:

Illustrate out the term A* search in detail.

problem 4:

Illustrate out the term Simulated annealing search in detail.

problem 5:

Illustrate out the term Memory bounded heuristic search in detail.

problem 6:

Discuss any two local search algorithms in detail.

problem 7:

Illustrate out the term genetic algorithm as a local search.

problem 8:

Illustrate out in detail the online search agent working using depth first exploration.

problem 9:

Illustrate out in detail the learning of an agent in online search method.

problem 10:

Discuss constraint satisfaction problem with an instance.