AMC 8 2027 Practice: Count Routes Without Listing Them Twice
A robot can move right or up on a square grid. How many shortest routes go two right and two up? Use this original counting exercise for the January AMC 8. Keep your rough list so you can see which routes your method misses.
Dates and organiser details
The MAA lists 21–27 January 2027 for the AMC 8. Its 25 questions take 40 minutes. Ask your participating site which day it will use.
Mathematical Association of America competition calendarDivide the list into two cases
| First move | Distinct move strings |
|---|---|
| Right | RRUU, RURU, RUUR |
| Up | URRU, URUR, UURR |
After an initial R there is one R left among three remaining moves. It can occupy any of three positions. After an initial U, the same count applies to the last U. The two lists cannot overlap because their first moves differ. There are six routes.
Now forbid the centre point (1, 1). Four routes reach the centre: there are two ways in and two ways out. Subtract four from six, leaving RRUU and UURR. Check your list by tracing both surviving paths on squared paper.
Try it yourself
How many shortest routes take three rights and one up?
Show the answer
Four. Put the single U in any of four positions.
Why does 2 × 2 count the routes through the centre?
Show the answer
Each route to the centre can be followed by either route from the centre. These choices pair independently.
How would you revisit this during timed practice?
Show the answer
First label the required moves. If a list grows confusing, separate it by its first move and move on once each case is accounted for.