Review:Tree search function TREE-SEARCH(problem,fringe)returns a solution,or failure fringeINSERT(MAKE-NODE(INITIAL-STATE[problem]),fringe) loop do if fringe is empty then return failure node-REMOVE-FRONT(fringe) if GOAL-TEST[problem]applied to STATE(node)succeeds return node fringeINSERTALL(EXPAND(node,problem),fringe) A strategy is defined by picking the order of node expansion Chapter 4.Sections 1-2 3 Review: Tree search function Tree-Search( problem, fringe) returns a solution, or failure fringe ← Insert(Make-Node(Initial-State[problem]),fringe) loop do if fringe is empty then return failure node ←Remove-Front(fringe) if Goal-Test[problem] applied to State(node) succeeds return node fringe ← InsertAll(Expand(node, problem),fringe) A strategy is defined by picking the order of node expansion Chapter 4, Sections 1–2 3