Lecture 2 An Anatomy of Search Algorithms

10/8/01


Click here to start


Table of Contents

Lecture 2 An Anatomy of Search Algorithms

GUESSING (“Tree Search”)

Getting from Seattle to Spokane

Getting from Seattle to Spokane

Getting from Seattle to Spokane

Getting from Seattle to Spokane

Roadmap

State Space Search

Example: Route Planning

Example: Blocks World

Cryptarithmetic

CSE 326 Review: Graph Search

Dijkstra’s Pseudocode (actually, our pseudocode for Dijkstra’s algorithm)

Dijkstra’s Algorithm in Action

The Cloud Proof

Complexity?

Single Source & Goal

Why Aren’t We Done?

BFS / Dijkstra’s

DFS

Iterative Deepening

Cost of Iterative Deepening

And the Winner is...

Author: Henry Kautz

Email: kautz@cs.washington.edu

Home Page: www.cs.washington.edu/homes/kautz

Download presentation source