AIMA Artificial Intelligence a modern approch

AIMA-exercises is an open-source community of students, instructors and developers. Anyone can add an exercise, suggest answers to existing questions, or simply help us improve the platform. We accept contributions on this github repository.

Exercise 3.25 [search-special-case-exercise]

Prove each of the following statements, or give a counterexample:

  1. Breadth-first search is a special case of uniform-cost search.

  2. Depth-first search is a special case of best-first tree search.

  3. Uniform-cost search is a special case of A search.

View Answer