This question already has an answer here:
You start at coordinate (0, 0) on a grid and want to reach position (3, 3). On this grid, you can only move right or up, not diagonally. How many paths are there?
This is a question I am trying to solve - would the answer to this be 20? I have done this graphically, writing out all the different ways this journey could be done and arrive at 20 - however, is there a simpler way to calculate this, with a formula?