title: Branching Factor and Overhead
body: <p>The branching factor is the number of successors generated by a given node. The effective branching factor is the number of successors generated by a "typical" node for a given search problem.And the depth is The height of a node Y is the number of edges on the longest downward simple path from Y to a leaf. The height of a tree is defined as the height of its root node. Note that a simple path is a path without repeat vertices. The height of a tree is equal to the maximum depth of a tree.I want to know what is effect on overhead by increasing or decreasing the branching factor and depth?</p>