Problem 2534. Path of least resistance - Move all direction
A matrix is given as input. You have to take a tour starting from the top left corner to the bottom right corner of the matrix. You can move to any one of the adjacent 8 elements. Return only the sum of the elements in your path.
Example :
Input = [1 9 1 1
9 1 9 1
1 3 9 1
9 9 8 1];
Output = 7;
Here, the least-sum path though the matrix is shown below with asterisk(*):
[1* 9 1* 1*
9 1* 9 1*
1 3 9 1*
9 9 8 1*];
Return only the sum of the elements along the path. I will add robust test cases time to time WITHOUT re-scoring existing solutions.
Solution Stats
Problem Comments
-
7 Comments
Show
4 older comments
rifat
on 2 Sep 2014
May be you are considering the element at the bottom left corner. But, it is not necessary since diagonal movement is also allowed
Paul Berglund
on 3 Sep 2014
OK, you're right about test case 2. I was wrong. But I get 6 for test case 1, not 7. The shortest path does not include upper right corner.
rifat
on 4 Sep 2014
yeah, that is wrong.. corrected and thanks. too many mistake in a single problem
Solution Comments
Show commentsProblem Recent Solvers21
Suggested Problems
-
6305 Solvers
-
The Hitchhiker's Guide to MATLAB
3321 Solvers
-
261 Solvers
-
Find out sum and carry of Binary adder
1526 Solvers
-
Calculate Amount of Cake Frosting
25576 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!