I am not getting 8690 for 31x31. I even tried doing it maually, I am only getting 8377. Not sure where I am taking the wrong path. If possible, can someone send me the path it has to take?

You're right. These are the tags I wrote for this Kata: algorithms, dynamic programming.

Great Kata.. classic Dyanamic programming helps to get the program done!! I think other than dyanamic programming no other algorithm will help..

Nice one! If you choose the fast method first time, it feels like a 6kyu. If you try to brute-force all the routes, it's too slow and you end up doing as much work as a 4kyu!

Paths along first/last rows or columns are considered on code, I also considered the case in which immediate bottom and right positions have the same value (which does not occur on predefined tests).

Have you handle edges correctly? what about paths along first row or first column?

Correct answer is 8690 and test checks against 8690.

I'm pretty sure I may have messed up at some point on my code, but should the predefined test for a 31x31 matrix yield 8690?
My code works properly on both Testing Matrix 1 and tests I ran with arrays created on numpy with the same N range given in Kata.