Question: 1) Use the backtracking algorithm, state space tree and a promising function to find all combinations of the following numbers that sum to W

1) Use the backtracking algorithm, state space tree and a promising function

 

1) Use the backtracking algorithm, state space tree and a promising function to find all combinations of the following numbers that sum to W =52: w1 =10 w2=13 w3=17 w4 =22 w5 =42 a) Form the state space tree (15 points) b) Describe the heuristic that can be used in the promising function (5 points) c) Step by step find/show the solution(s) using the state space tree and your heuristics (15 points)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a Forming the state space tree To find all combinations of the given numbers that sum to W 52 using the backtracking algorithm we can construct a stat... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!