title: Dynamic programming and backtack search
body: <p>Can a backtrack  and "branch and bound" problem be always solved using dynamic programming?? i.e. given a problem which can be solved using a backtrack method be also solved using dynamic programming</p>