Exhaustive search

Exhaustive Search is just about try every possible ways to search for a solution. It is usually combined with pruning to reduce the number of items to search for. It is also known as Backtracking.

Basically the psuedo code is like

backtrack(int sol, int depth) {  if (issolution) printsolution else{ generatesolution backtrack(solgenerated, depth+1) } }