Body

1) For the Coin-Change problem using backtracking, is it better to arrange the coins into ascending order or descending order? (Justify your answer)

2) For the sum-of-subsets problem W = 21 and {5, 6, 10, 11, 16}, what should the search-space (recursion) tree look like?

3) Without some pruning criteria how many nodes would the above search-space tree contain?

4) Develop pruning criteria for the above search-space tree.

Steps for customizing the "checknode" backtracking template:

0) Decide on the state-space tree

1) What problem instance information is needed?

2) What state information is needed at each node?

3) What does our promising function need?