Find the length of the shortest path through the matrix from the top left to bottom right corner. You may move right, down, or diagonally right-down one element at a time. The length of the path is the sum of the elements you pass through.
E.g.
M = [*8 6 10 10 4 7 7 7
9 *1 10 5 9 0 8 2
1 3 *2 8 8 8 7 7
9 5 10 *1 *10 *9 *4 *0 ];
>> shortest_path(M)
ans =
35
The shortest path through this matrix has length 35. Each element along the path is marked with a *
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers83
Suggested Problems
-
3826 Solvers
-
Find the two most distant points
2960 Solvers
-
17272 Solvers
-
1480 Solvers
-
Number of paths on a n-dimensional grid
52 Solvers
More from this Author5
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Cool problem. Optimal solutions sometimes appear if moving up is enabled.