22202956

Exercise 4.9 question 3 done.

Works okay for smaller grids but is a lot slower for larger grids. Might be worthwhile to use Dijkstra’s Algorithm

4_9_Exercises/Question 3.py

+def nsp(x, y, current=(0, 0)):
+    if current is None:
+        return 0
+    if current == (x, y):
+        return 1
+    else:
+        next_corner = new_index(x, y, current)
+        # uses helper function to find the next corner
+        return nsp(x, y, next_corner[0]) + nsp(x, y, next_corner[1])
+    pass
+
+
+def new_index(x, y, current):
+    # Helper function to find the possible next states, reduced clutter
+    if current[0] < x and current[1] < y:
+        return (current[0], current[1] + 1), (current[0] + 1, current[1])
+    if current[0] >= x and current[1] < y:
+        return (current[0], current[1] + 1), None
+    if current[0] < x and current[1] >= y:
+        return (current[0] + 1, current[1]), None