Consider the search graph where all edges are bidirectional. Suppose we want to go from start...

  

Transcribed Image Text:

Consider the search graph where all edges are bidirectional. Suppose we want to go from start state S to goal state G is the goal state. There are four possible solution paths. 1. S-B-E-F-G 2.S-B-E-G 3.S-C-G 4. S-D-G Sh=11 3 B h=10 h=5 15 14 2 Assuming ties (e.g., which child to first explore in depth-first search) should be resolved alphabetically (i.e. prefer A before Z), write the number of the solution returned to the right of each of the algorithms below. h=7 h=1E F h=1 h=0 a) (2 points) Depth-First Search returns solution number, b) (2 points) Breadth-First Search returns solution number. c) (2 points) Greedy Search returns solution number_ d) (2 points) A Search returns solution number. Consider the search graph where all edges are bidirectional. Suppose we want to go from start state S to goal state G is the goal state. There are four possible solution paths. 1. S-B-E-F-G 2.S-B-E-G 3.S-C-G 4. S-D-G Sh=11 3 B h=10 h=5 15 14 2 Assuming ties (e.g., which child to first explore in depth-first search) should be resolved alphabetically (i.e. prefer A before Z), write the number of the solution returned to the right of each of the algorithms below. h=7 h=1E F h=1 h=0 a) (2 points) Depth-First Search returns solution number, b) (2 points) Breadth-First Search returns solution number. c) (2 points) Greedy Search returns solution number_ d) (2 points) A Search returns solution number.