This problem is inspired by https://www.mathworks.com/matlabcentral/cody/problems/1483-number-of-paths-on-a-grid and https://www.mathworks.com/matlabcentral/cody/problems/44066-number-of-paths-on-a-3d-grid, which you might want to solve first.
Consider n-dimensional grid, and you are moving from one corner to the farthest corner in a minimal number of moves. Each move corresponds to moving to a neighbouring hypercube (among possible up to 2*n neighbours). How many ways are there?
Input format is a row array of size "d" (for d dimension) with number of grid points on each direction.
Optional: can you solve it without loops?
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers51
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
53676 Solvers
-
3412 Solvers
-
Matrix with different incremental runs
597 Solvers
-
Cell Counting: How Many Draws?
2526 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
738 Solvers
More from this Author9
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
