Question

1. Suppose we needed to search for a goal state in a tree with infinite depth.
   1. Which of breadth-first, uniform-cost, depth-first, depth-first with max depth m, depth-limited, and iterative-deepening would be potentially applicable to use?
   2. For this same tree, suppose it has an average branching factor of 5, of the applicable search algorithms to use, which will be able to find the goal (assuming it exists) in less time?  
   3. Which, of the applicable search algorithms to use, will be able to find the goal (assuming it exists) with the least amount of space/memory?  

Answer 1

suppose we needed to search for a goal state in a tree with infinite depth

a) yes these uninformed search algorithms which of breadth-first ,uniform-cost,depth-first,depth-first with max depth m,depth-limited,and iterative-deepending would be potentially applicable to use

these are searches apllicable to tree with infinite depth

b) suppose same tree it has an average branching factor of 5 of the applicable search algorithms to use which will be able to find the goal in less time uses uniform-cost search to find the less time

so it has uniform-cast search is used

C) depth limited search is as well as time and sapce complexity is minimum

i hope clearly explain infinity depth search in tree and its also explain clearly a,b,c options so i kindly requesting rating me