Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

Else do
Begin
End
insert the children of the front element,
if exist, in any order at the rear end of
the queue;
Until the queue is empty;
End.
The breadth first search algorithm, presented above, rests on a simple
principle. If the current node is not the goal add the offspring of the
current in any order to the rear end of the queue and redefine the front
element of the queue as the current. The algorithm terminates, when the goal
is found.
n 1
n 2
n3
n 3 n 4
Fig. 4.2: First few steps of breadth first search on the tree of fig. 4.1.
Time Complexity
n4
n 4 n5 n6
n 5 n 6 n 7 n 8
For the sake of analysis, we consider a tree of equal branching factor from
each node = b and largest depth = d. Since the goal is not located within
depth (d-1), the number of false search [1], [2] is given by
1+b+b 2 +b 3 + … + b d-1 = (b d -1) / (b-1) , b>>1.