Category Archives: Branch and Bound

Branch and Bound | Set 5 (N Queen Problem)

The N queens puzzle is the problem of placing N chess queens on an N×N chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal. For example, below is one of the solution for famous 8 Queen problem. Backtracking Algorithm for N-Queen is already discussed here.… Read More »

Branch and Bound | Set 3 (8 puzzle Problem)

We have introduced Branch and Bound and discussed 0/1 Knapsack problem in below posts. Branch and Bound | Set 1 (Introduction with 0/1 Knapsack) Branch and Bound | Set 2 (Implementation of 0/1 Knapsack) In this puzzle solution of 8 puzzle problem is discussed. Given a 3×3 board with 8 tiles (every tile has one… Read More »

Branch and Bound | Set 1 (Introduction with 0/1 Knapsack)

Branch and bound is an algorithm design paradigm which is generally used for solving combinatorial optimization problems. These problems typically exponential in terms of time complexity and may require exploring all possible permutations in worst case. Branch and Bound solve these problems relatively quickly. Let us consider below 0/1 Knapsack problem to understand Branch and… Read More »