Breadth first search. Suppose you perform a breadth first search in a tree with branching factor b. But we don't know that the space
search is a tree, so we try to avoid expanding
nodes that have been already encountered and expand. Thus, for each new node
generated, we check whether it is the same as any other node that has been encountered.
How many tests will be done in a search to depth d; (expression
parameters b and d)
Any help on that will be appreciated...