2012 AMC 10B Problem 25
Problem 25 of 25HarderCounting & Probability
A bug travels from to along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there?

Answer choices
Show solution
Solution
Classify a path by the set of backward arrows it uses. If , the path is determined by choosing one forward arrow in each column, giving paths.
If uses only the left backward arrow, there are paths, and by symmetry the same for only the right backward arrow. If it uses both outer backward arrows but not the middle one, there are paths.
If uses only the middle backward arrow, there are paths. If it uses the middle arrow and exactly one outer backward arrow, there are paths for each choice of outer arrow. If it uses all three backward arrows, there are paths.
The total is .
Thus, E is the correct answer.