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?

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?

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 the search?

Transcribed Image Text:

5 12 10 00 יס 13 5 12 10 00 יס 13

Answer rating: 100% (QA)

To answer the questions regarding BFS and DFS on the given search tree we need to follow the specifi... View the full answer