Programming, Computer Science, Graph Theory, Graph, Mathematics.
this book is the book on Artificial Intelligence everyone uses their notation. b is the branching factor of the tree. d is the shallowest goal node (the lowest level at which a node is a goal for a given search problem) m is the maximum length of any path in the state space. Disadvantages Breadth