A counter is initially at square A in the grid below. It is then moved from one square to an adjacent square (horizontally or vertically, but not diagonally), until it ends up at square B, passing through every square in the grid exactly once. How many different paths could the counter have taken?
