0 votes 0 votes Given a tree with a branching factor of 3 and a depth of 4, calculate the maximum number of nodes expanded during a breadth-first search. Artificial Intelligence discrete-mathematics analytical-aptitude quantitative-aptitude artificial-intelligence + – rajveer43 asked Jan 1 rajveer43 381 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes The maximum number of nodes expanded during a breadth-first search can be calculated using the following formula. N = 1 + b + b² + ......+ b^d. Given b=3 (b is branching factor) d = 4. (d is depth) N = 1+ 3 + 3^2 + 3^3 + 3^4 = 121. C.Aravind REDDY answered Jan 2 • selected Jan 16 by rajveer43 C.Aravind REDDY comment Share Follow See 1 comment See all 1 1 comment reply rajveer43 commented Jan 3 reply Follow Share thank you for the answer 0 votes 0 votes Please log in or register to add a comment.