{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Blind_Search_BFS

# Blind_Search_BFS - Blind(Uninformed Search C h a p.3,S e c...

This preview shows pages 1–11. Sign up to view the full content.

1 Blind (Uninformed) Search C hap. 3, S e c t. 3.3–5

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Simple Problem-Solving-Agent Agent Algorithm 1. s 0    sense/read initial state 2. GOAL?   select/read goal test 3. Succ   read successor function 4. solution    search (s 0 , GOAL?, Succ)  5. pe rfo rm (s o lutio n)
3 Search Tree S e arc h tre e No te  that s o m e  s tate s  m ay  be  vis ite d m ultiple  tim e s S tate  g raph

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4 Search Nodes States 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 3 5 6 8 1 3 4 5 6 7 8 2 4 7 2 1 2 3 4 5 6 7 8
5 Search Nodes States 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 3 5 6 8 1 3 4 5 6 7 8 2 4 7 2 1 2 3 4 5 6 7 8 If s tate s  are  allo we d to  be  re vis ite d, the  s e arc h tre e  m ay be  infinite  e ve n whe n the  s tate  s pac e  is  finite If s tate s  are  allo we d to  be  re vis ite d, the  s e arc h tre e  m ay be  infinite  e ve n whe n the  s tate  s pac e  is  finite

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6 Data Structure of a Node PARENT-NO DE 1 2 3 4 5 6 7 8 S TATE De pth o f a no de  N           = le ng th o f path fro m  ro o t to  N  (depth of the root = 0)   BOOKKEEPING 5 Path-Cost 5 Depth Right Action Expanded yes ... CHILDREN
7 Node expansion The   e xpans io n  o f a no de  N o f the   s e arc h tre e  c o ns is ts  o f: 1) Evaluating  the  s uc c e s s o r  func tio n o n  S TATE (N) 2) G e ne rating  a c hild o f N fo r  e ac h s tate  re turne d by the   func tio n no de   generation    no de   expansion 1 2 3 4 5 6 7 8 N 1 3 5 6 8 1 3 4 5 6 7 8 2 4 7 2 1 2 3 4 5 6 7 8

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
8 Fringe of Search Tree The   fring e  is  the  s e t o f all s e arc h no de s   that have n’t be e n e xpande d ye t  1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 3 5 6 8 1 3 4 5 6 7 8 2 4 7 2 1 2 3 4 5 6 7 8
9 Is  it ide ntic al  to  the  s e t o f  le ave s ?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
10 Search Strategy The   fring e   is  the  s e t o f all s e arc h no de s  that
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 31

Blind_Search_BFS - Blind(Uninformed Search C h a p.3,S e c...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online