Imagine a two-dimensional space defined as a \(6 \times 6\) grid of cells, that is \(6\) rows and \(6\) columns. You are positioned in the bottom-left cell and your goal is to reach the top-right cell of this grid. The only allowed movements are: you can go right (to the adjacent cell in the same row) or you can go up (to the adjacent cell in the same column). Movements to the left or downwards are not allowed.
The question is, how many distinct paths can you follow from the bottom-left cell to the top-right cell under these constraints?
Scratchpad