I4.1 The figure shows a board consisting of nine squares. A counter originally on square $X$ can be moved either upwards or to the right one square at a time. By how many different routes may the counter be moved from $X$ to $Y$ ?
By adding numbers on the right as shown (Pascal triangle), the number of different routes $=6$