Search

 

Search is ubiquitous in AI. Most problems can be formulated as search problems. Make sure you know all the basic search methods, their time-space complexities, advantages of each, and their real-time variants.

• [Ginsberg1993] Essential of AI Chapters 3,4,5 (search).
  Winston's chapters 3-6 and Rich & Knight's book aren't as good.
• [Pearl and Korf1987] Search techniques.
  An excellent survey of the field. Korf's survey in Exploring Artificial Intelligence is not as comprehensive, but does contain references to some interesting recent developments, especially in chess. (*) We must find something newer from Korf.
• [Kumar1992] Algorithms for constraint-satisfaction problems: a survey.
  An excellent survey of constraint satisfaction problems. The bound on page 40 for backtrack bounded search is wrong. It should be .

• [Shapiro and Eckroth1992] Entries on Search, Constraint Networks, Constraint Satisfaction.
  Browse over the material. Note how Branch&Bound generalizes many algorithms like A* and B*.