Chapter 4.1 - 4.2

Uninformed Search Techniques

• Breadth First
• Uniform Cost
• Depth First
• Depth Limited
• Iterative Deepening
• Bidirectional

Informed Search Costs

• h(n) = estimated cost of cheapest path from current node to goal node
• g(n) = cost to go from the start node to the current node

Global Informed Search Techniques

• Greedy Best First, f(n) = h(n)
• A*, f(n) = g(n) + h(n)
• complete
• optimal, provided that h(n) is admissable (never overestimates)
• optimally efficient
• IDA*

Heuristic Functions

• Eight Puzzle
• Missionaries and Cannibals
• Crossword Puzzles

Practice Exercises

• 1.1, 1.4, 1.6, 1.9, 1.10, 1.11, 1.13
• 2.1, 2.2, 2.3, 2.4, 2.5, 2.6
• 3.1, 3.2, 3.3, 3.7, 3.8, 3.9a, 3.13, 3.15a-b, 3.17a