If you are standing on the blue how may different routes can

If you are standing on the blue, how may different routes can you take to get to red if you can only move east and north. Cannot backtrack.

Solution

Assuming that walking both left and down directions is not allowed, then we have a genuine question in discrete mathematics. There are 6 moves in up direction, and 2 moves in right direction. The only choice we have is to decide which moves we take on nth step. Number of paths are: number of ways of selecting 6 up moves out of 8 steps = 8C6 = 8 choose 6 = 28 (same answer with 8C2)