AMC 8 · 2017 · #15

Grade 4 counting
permutations-basicsystematic-enumerationspatial-visualizationpattern-recognition tree-enumerationidentify-subproblemspattern-recognition ↑ Prerequisites: systematic-enumeration
📏 Medium solution 💡 3 insights 📊 Diagram
📘 View easy version →
Problem
Letters and numerals are arranged in a diamond-shaped grid with the letter A in the center. Starting at the central A, we move only to horizontally or vertically adjacent cells (no diagonals) and want to spell out A-M-C-8. How many different 4-step paths spell AMC8?

Pick an answer.

(A)
8
(B)
9
(C)
12
(D)
24
(E)
36

AMC 8 2017 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Draw a Diagram

The problem is purely spatial — we are walking on a grid — so Tool #1 (Draw a Diagram) is the natural starting point. With the picture in hand we use Tool #7 (Identify Subproblems) to split the 3-move walk into three independent counting questions: A → M, then M → C, then C → 8. Tool #5 (Look for a Pattern) helps once we notice that every M has the same number of valid C-neighbors and every C has the same number of valid 8-neighbors, so we can multiply the three small counts instead of enumerating all paths.

1STEP 1

The central A's four orthogonal neighbors are all M's (up, down, left, right), so the first move has 4 choices.

A → M: 4 choices
2STEP 2

From any M the neighbors are the already-used A plus three C's, so by symmetry every M offers 3 C-choices.

M → C: 3 choices from every M
3STEP 3

Both kinds of C — the inner corner and the outer tip — touch exactly two 8's, so each C gives 2 choices for the last move.

C → 8: 2 choices from every C
4STEP 4

Multiply the three independent counts by the multiplication principle: 4 × 3 × 2 = 24 paths — answer choice (D).

4 × 3 × 2 = 24 → (D)
Answer
24
Does 24 make sense? The path has 3 moves; at the worst there are 4 options at each move, giving an upper bound of 4 × 4 × 4 = 64. Our count of 24 is comfortably below that, and it matches the most-symmetric-looking choice (D). Sanity-checking by symmetry: paths starting up = paths starting down = paths starting left = paths starting right. Starting up, the M-above-A has 3 C-choices and each C has 2 eight-choices, giving 3 × 2 = 6 paths per starting direction, then 6 × 4 = 24 total. Same answer — consistent.
💡Key takeaway

This AMC 8 problem only needs Grade 4 pattern-spotting plus the simple Grade 3 idea that the total number of paths is the product of the choices at each step!