1/19/2014 a a %a &! ' % ! % $ ' a ! " # $! ! " # ! % ' a a( e % a e a * + 1/19/2014 a a( e % a e a * , - a a( e % a e a * 1/19/2014 / 2 3 , 5 4 a %a &! ' % ! % $ ' - - +- ! " # $! ! " # ! % ' a a( e % a e a * 1/19/2014 function Breath-First-Search(problem) returns solution nodes := Make-Queue(Make-Node(Initial-State(problem)) loop if nodes is empty then return failure node := Remove-Front (nodes) if Goal-Test[problem] applied to State(node) succeeds then return node new-nodes := Expand (node, Operators[problem])) nodes := Insert-At-End-of-Queue(new-nodes) end / + 1/19/2014 " # ! $a 9: $ e $! $ %! $ '! !< a !a 9: ; # %# ' $ a => ? @ , % ' a e a * , 2 e # e a a( $ 3 4 - - +- 1/19/2014 ! " ' #$ ( %& ) ! " A 1/19/2014 +8 + 1/19/2014 ++ 4; a ! ' 4; 9: % %! " '! > ' a a( e % a( e % a a e a * + a e a * +, 1/19/2014 6 # 5% C eB4 # %# /e $ a a( e % a e a * +- ...1/19/2014 a a( e % a e a * , - a a( e % a e a * 1/19/2014 / 2 3 , 5 4 a %a &! ' % ! % $ ' - - +- ! " # $! ! " # ! % ' a a( e % a e a * 1/19/2014 function Breath-First-Search(problem)... 1/19/2014 " # ! $a 9: $ e $! $ %! $ '! !< a !a 9: ; # %# ' $ a => ? @ , % ' a e a * , 2 e # e a a( $ 3 4 - - +- 1/19/2014 ! " ' #$ ( %& ) ! " A 1/19/2014 +8 + 1/19/2014 ++ 4; a ! ' 4; 9: % %! " '!