6.2 Branch and Bound:
The term branch and bound refer to all state space search methods in which all possible branches are derived before any other node can become the E-node. In other words the exploration of a new node cannot begin until the current node is completely explored.
6.2.1 Tape filling:
The branch and bound tree for the records of length (5,10,3) is as shown in fig 6.4
