Problem 59526. Count paths between corners of a grid that remain on or below the diagonal
Consider motion from the lower left corner of a square grid to the upper right corner. The motion is constrained in two ways: (1) the only legal moves are (0,1), (1,0), and (1,1)—i.e., right, up, and up-and-right between points of the lattice—and (2) the motion must remain on or below the line connecting the starting and finishing corners. For a 2x2 grid, the number of paths is 6, as shown below.
Write a function to count the legal paths for an nxn grid. Return the count as a string. Check the last test for banned functions.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
Replace NaNs with the number that appears to its left in the row.
2956 Solvers
-
1704 Solvers
-
Check to see if a Sudoku Puzzle is Solved
320 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
99 Solvers
-
Generate N equally spaced intervals between -L and L
854 Solvers
More from this Author269
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!