Let a MxN matrix where the start is at position (0,0) and the finish at (M-1,N-1) . Every square has a positive integer which is the cost to move on this square. What algori
