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 Solvers50
Suggested Problems
-
Return the 3n+1 sequence for n
8491 Solvers
-
315 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
718 Solvers
-
Area of an equilateral triangle
6802 Solvers
-
1117 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!
