Backtracking: Updated README for Homework 4

Backtracking/README.md

@@ -1,4 +1,4 @@
-# Coding 3: Backtracking
+# Homework 3: Coding Backtracking
 
 ## Rocket Sections
 
@@ -114,3 +114,41 @@ as `cs412_hw3_a.py` to Gradescope.
 - (10 points) Does the code solve the samples in the write-up?
 - (7 point) Does the code solve the private testing samples?
 - (3 points) For solving the full credit option.
+
+# Homework 4: Coding Dynamic Programming
+
+Modify your solution to the backtracking version of Coding Homework 3:
+Backtracking to utilize dynamic programming in an iterative way rather than
+recursive. You should clearly separate the dynamic programming phase of your
+algorithm from the solution building phase. As with the previous iterations of
+this homework, partial credit may be obtained by solving the optimization
+problem but not producing a full solution; however, this time more weight is
+given to solving the full credit option.
+
+The input/output samples are the same as for Coding Homework 3: Backtracking.
+
+## Your Task
+
+Develop a dynamic programming solution to the problem. Turn your solution in as
+`cs412_rockets_dynamic.py`.
+
+## Coding Requirements
+
+No points will be awarded if any of the following techniques are in your code:
+
+- dictionaries
+- copying of lists or other objects
+- not allocating the dynamic memory structure in a single (or at more 2 lines)
+- Retrieving which parts were used MUST be performed by tracing back through the
+  dynamic/memoized structure. No points will be awarded for that portion of the
+  HW if this is performed differently.
+
+Gradescope does not check for these items. Your code will be manually reviewed
+after submission.
+
+## Rubric (see notes above for coding requirements)
+
+- (1 point) Does your code pass the pep8 coding guidelines?
+- (5 points) Does the code solve the samples in the write-up?
+- (4 point) Does the code solve the private testing samples?
+- (1 points) instructor points