Starting in the top left corner of a 2×2 grid, there are 6 routes (without backtracking) to the bottom right corner.
Solved using combinatorics. João Ferreira has a good description of the problem and general solution.
Tags: binomial coefficient, combinatorics, grid, paths, problem15, project euler