Given a checkerboard size nxn, counting the number of ways we can get from one corner to another corner diagonally across by only going upwards and to the side (unidirectionally) can be computed by treating the two directions, up and side as objects to be permuted. The number of ways to get to the corner is thus the number of arrangements that can be made of these two sets of n objects each.
The number of ways we can arrange is computed by fixing one object(up), and considering that there are n+1 'SLOTS' between them to insert the other object(sideways) giving us n(n+1) ways to move from one corner to the other.
Now my question is suppose that the checkerboard is split in half diagonally across, giving something which looks like a staircase, how many ways are there to move up? (I.e. how many arrangments are there such that at any point the number of 'side' thus not exceed the number of 'ups' preceding it?)
Does this problem require partition theory?