Blind_Search_BFS

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

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

View Full Document Right Arrow Icon
1 Blind (Uninformed) Search C ha p. 3, S e c t. 3.3–5
Background image of page 1

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

View Full DocumentRight Arrow Icon
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)
Background image of page 2
3 Search Tree S e arc h tre e No te  tha t s o m e  s ta te s  m a y  b e  vis ite d m ultiple  tim e s S ta te  g raph
Background image of page 3

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

View Full DocumentRight Arrow Icon
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
Background image of page 4
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 ta te s  a re  a llo we d to  b e  re vis ite d, the  s e a rc h tre e  m a y b e  infinite  e ve n whe n the  s ta te  s pa c e  is  finite If s ta te s  a re  a llo we d to  b e  re vis ite d, the  s e a rc h tre e  m a y b e  infinite  e ve n whe n the  s ta te  s pa c e  is  finite
Background image of page 5

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

View Full DocumentRight Arrow Icon
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 pa th fro m  ro o t to  N  (depth of the root = 0)   BOOKKEEPING 5 Path-Cost 5 Depth Right Action Expanded yes ... CHILDREN
Background image of page 6
7 Node expansion The   e xpa ns io n  o f a  no de  N o f the   s e a rc h tre e  c o ns is ts  o f: 1) Eva lua ting  the  s uc c e s s o r  func tio n o n  S TATE (N) 2) G e ne ra ting  a  c hild o f N fo r  e a c h s ta te  re turne d b y 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
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 Fringe of Search Tree The   fring e  is  the  s e t o f all s e a rc h no de s   tha t ha ve n’t b e 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
Background image of page 8
9 Is  it ide ntic a l  to  the  s e t o f  le a ve s ?
Background image of page 9

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

View Full DocumentRight Arrow Icon
10 Search Strategy The   fring e   is  the  s e t o f a ll s e a rc h no de s  tha t 
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/15/2011 for the course CAP 4630 taught by Professor Staff during the Fall '08 term at FAU.

Page1 / 31

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

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online