Problem 81 - Path sum two ways

 - Just use simple memoization, as loops are not possible
   under these rules
Problem 82 - Path sum 3 ways

 - Use a depth first search with an early termination
   for non-optimal paths
 - Almost needs dijkstras minimum spanning tree, maybe
   the next puzzle.