A search tree is as follows, nodes 8 and 11 are the goal nodes: 1. If Breadth First Search (BFS) is utilized as the search strategy (choosing leftmost branches first ), then what is the fringe after the agent has explored five (5) nodes? a. {11, 3, 4, 7, 8, 9} b. (11, 3, 4) c. {6, 10, 11, 7, 12, 13, 8, 9} d. {6, 7, 8, 9} 2. If Depth First Search (DFS) is utilized as the search strategy (choosing leftmost branches first ), then what is the fringe after the agent has explored five (5) nodes? a. {6,7, 8, 9} b. {11, 3, 4, 7, 8, 9} c. {11, 3, 4} d. {6, 10, 11, 7, 8, 9} e. {11} 3. If Depth First Search (DFS) is utilized as the search strategy (choosing leftmost branches first ), then what is the solution an agent would find after search? a. 1->2->3->4->8 b. 1->2->5->6->11 c. 1->4->8 d. 1->2->6->11
A search tree is as follows, nodes 8 and 11 are the goal nodes:
1. If Breadth First Search (BFS) is utilized as the search strategy (choosing leftmost
branches first ), then what is the fringe after the agent has explored five (5) nodes?
a. {11, 3, 4, 7, 8, 9}
b. (11, 3, 4)
c. {6, 10, 11, 7, 12, 13, 8, 9}
d. {6, 7, 8, 9}
2. If Depth First Search (DFS) is utilized as the search strategy (choosing leftmost branches
first ), then what is the fringe after the agent has explored five (5) nodes?
a. {6,7, 8, 9}
b. {11, 3, 4, 7, 8, 9}
c. {11, 3, 4}
d. {6, 10, 11, 7, 8, 9}
e. {11}
3. If Depth First Search (DFS) is utilized as the search strategy (choosing leftmost branches
first ), then what is the solution an agent would find after search?
a. 1->2->3->4->8
b. 1->2->5->6->11
c. 1->4->8
d. 1->2->6->11
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
My question is how can you move from node 5 to node 10 when node 10 is not a children of node 5
by Bartleby Expert
