1. Solving Problems by Searching: Un-informed search strategies: Breadth first search, Depth-first search, Depth-limited search, Iterative deepening depth-first search, bidirectional search;
  2. Informed search and exploration: Greedy best-first search, A* search, Memory-bounded heuristic search; Local search algorithms and Optimization: Hill climbing, Simulated Annealing, Local beam search, Genetic Algorithms;
  3. Constraint Satisfaction Problems: Backtracking search for CSPs,Local search for CSPs;
  4. Adversarial Search: Optimal Decision in Games, The minimax algorithm, Alpha-Beta pruning;
  5. Knowledge Representation: Situation Calculus, semantic networks, description logics, reasoning with default systems;
  6. Planning: Planning with state space search, Partial-Order Planning, Planning Graphs, Planning with Propositional Logic, hierarchical task network planning, non-deterministic domains, conditional planning, continuous planning, multi-agent planning;
  7. Miscellaneous Topics: Fuzzy logic systems, Natural Language Processing.