SEARCH

OUTLINE
• Search: depth-first, hill climbing, beam
• Search: optimal, branch and bound, A*
• Search: games, minimax, and alpha-beta
SEARCH AS A MODEL OF PROBLEM SOLVING

VISION IS THE REAL PROBLEM SOLVING

BUT PROGRAM DOES’T HAS EYES

 Example
8
C E

B G
5 4
5

S A D
3 3
 S G
S

A B

B D A C

C G D E
FIND ALL POSSIBLE PATH

E G
“BRITISH MUSEUM” ALGORITHM
 SEARCH MAPS ?

SEARCH IS ABOUT CHOICE WHEN YOU TRY TO MAKE DECISION

Depth-first Search
S

A B

B D

C G

E
 BACKTRACKING
BRITISH MUSEUM X
DEPTH FIRST v
BREADTH FIRST
HILL CLIMBING
BEAM
Breadth-first Search
S

A B

B D A C

C G D E
 Program development
(queue)
(S)
INITIALIZE EXTEND ENQUEUE
(S A) (S B)
QUEUE FIRST PATH DEPTH: FRONT
ON QUEUE (S A B) (S A D) (S B)
(S A B C) (S A D) (S B)
(S A B C E) (S A D) (S B)
(S A D) (S B)
(S A D G) (S B)
 Program development
(queue)

INITIALIZE EXTEND ENQUEUE

QUEUE FIRST PATH BREADTH: BACK
ON QUEUE
UNLESS FINAL NODE NEVER BEFORE EXTENDED