This week's book giveaway is in the Design forum.We're giving away four copies of Design for the Mind and have Victor S. Yocco on-line!See this thread for details.
Win a copy of Design for the Mind this week in the Design forum!

# anyone good at dynamic programming?

Randall Twede
Ranch Hand
Posts: 4371
3
i was certain i had solved this one rather quickly, but i get the wrong answer. i am new to dynamic programming and any clues on how to debug this would be appreciated.
the problem:
In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right and down, is indicated in bold red and is equal to 2427.

131 673 234 103 18
201 96 342 965 150
630 803 746 422 111
537 699 497 121 956
805 732 524 37 331

Find the minimal path sum, in matrix.txt (right click and 'Save Link/Target As...'), a 31K text file containing a 80 by 80 matrix, from the top left to the bottom right by only moving right and down.

my code:

the problem must be somewhere in the try block.

Randall Twede
Ranch Hand
Posts: 4371
3
never mind, i think i found it

Randall Twede
Ranch Hand
Posts: 4371
3
i fixed the obvious problem. i wasn't adding i was assigning. my answer is now much closer to the correct answer. i get 409646, correct answer is 427337