6.034 Artificial Intelligence - Recitations, fall 2004 Enrichment slides on search
		Search: basic and optimal Search - guided slide tour Search Problem-Solving Agent Assumptions Assumptions Assumptions Assumptions Assumptions Assumptions Search Example Search Space Definitions Search Space Definitions Problem Formulation Search Process Sample Search Problems Sample Search Problems Sample Search Problems Sample Search Problems Sample Search Problems Sample Search Problems Sample Search Problems Sample Search Problems View Search Space as a Tree General Search Example Search Function Search Strategies Breadth-First Search Examples Analysis Analysis Depth-First Search Examples Analysis Avoiding Repeated States Maze Example Uniform Cost Search (Branch and Bound Search) Example Iterative Deepening Search Examples Analysis Bidirectional Search Informed Searches Best-First Search Example Hill Climbing (Greedy Search) Example Hill Climbing Issues Hill Climbing Issues Hill Climbing Issues Beam Search Example A* Power of f Example Example Optimality of A* IDA* Example Eight Puzzle Example Eight Puzzle Example Eight Puzzle Example Analysis RBFS Example Analysis SMA* Example Heuristic Functions Heuristic Functions Reasons Informedness Effect on Search Cost Heuristics Generating Heuristic Functions Admissible Search Algorithms Comparison of Search Techniques Online Learning LRTA* Example Simulated Annealing