AMC 8 · 2025 · #5

Easy mode Grade 3

Problem

Imagine a neighborhood laid out like a big grid of city blocks. Betty drives a delivery truck. She has to start at the factory, marked $F$ , drop off packages at three other spots, and then come back to $F$ .

The three delivery spots are labeled $A$ , $B$ , and $C$ . Betty must visit them in this order: first $A$ , then $B$ , then $C$ . After visiting $C$ , she drives back to $F$ . The map below shows where each spot is.

Betty can only drive along the streets of the grid. She wants to make her whole trip as short as possible. We measure her trip in blocks — each side of a small grid square counts as one block.

What is the smallest number of blocks she can drive to finish the whole route?

Diagram

Neighborhood grid with factory F and stops A, B, C; arrows show the required visit order F → A → B → C → F.

Pick an answer.

(A)

(B)

(C)

(D)

(E)

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

Try it yourself first — the explanation is most useful after you’ve attempted it.

View mode:

Toolkit + CCSS Solution

Understand

Restated: Betty's delivery truck must start at the factory $F$, visit locations $A$, $B$, and $C$ in that order, and return to $F$. The neighborhood is laid out on a grid of city blocks, so the truck can only drive along the horizontal and vertical streets — it cannot cut diagonally. We want the smallest possible total number of blocks driven.

Givens: Street map is a rectangular grid (streets only run horizontally or vertically).; Labeled points on the grid: $F = (6, 5)$, $A = (7, 3)$, $B = (0, 0)$, $C = (2, 4)$.; Route order is fixed: $F \to A \to B \to C \to F$.; Each grid edge is $1$ block.; Answer choices: (A) $20$, (B) $22$, (C) $24$, (D) $26$, (E) $28$.

Unknowns: The shortest total number of blocks Betty drives on the full $F \to A \to B \to C \to F$ loop.

Understand

Plan

Primary tool: #1 Draw a Diagram

Secondary: #7 Identify Subproblems

The map is already a diagram, so Tool #1 (Draw a Diagram) just asks us to *use* it — read the position of each point by counting blocks right and up from the corner. Because the streets form a grid, the shortest path between any two labeled points is simply (horizontal blocks between them) + (vertical blocks between them); there is no benefit to zig-zagging. Tool #7 (Identify Subproblems) then splits the loop into four independent legs $F \to A$, $A \to B$, $B \to C$, $C \to F$. Solve each tiny leg by counting, then add the four numbers.

Execute — Answer: C

#1 Draw a Diagram K.G.A.1 Step 1

Read each labeled point off the grid by counting blocks right from the left edge and blocks up from the bottom.
This gives $F = (6, 5)$, $A = (7, 3)$, $B = (0, 0)$, $C = (2, 4)$.

$$F=(6,5),\ A=(7,3),\ B=(0,0),\ C=(2,4)$$

💡 Describing where something is on the grid using right/up counts is Kindergarten position language.

#7 Identify Subproblems 3.MD.D.8 Step 2

Because the truck must follow streets, the shortest distance between two corners is (horizontal blocks apart) $+$ (vertical blocks apart).
Split the trip into four legs and find each leg separately — this is the Tool #7 (Subproblems) move.

$$\text{Leg length} = (\text{horizontal blocks}) + (\text{vertical blocks})$$

💡 Adding side-distances to get a path length on a grid is the same idea as finding perimeter pieces in Grade 3.

#1 Draw a Diagram 2.OA.A.1 Step 3

Leg $F \to A$: from column $6$ to column $7$ is $1$ block right; from row $5$ down to row $3$ is $2$ blocks.
Total $= 1 + 2 = 3$ blocks.

$$|7-6| + |5-3| = 1 + 2 = 3$$

💡 Just counting blocks across and down and adding them is a Grade 2 addition word problem.

#1 Draw a Diagram 2.OA.A.1 Step 4

Leg $A \to B$: from column $7$ all the way left to column $0$ is $7$ blocks; from row $3$ down to row $0$ is $3$ blocks.
Total $= 7 + 3 = 10$ blocks.

$$|7-0| + |3-0| = 7 + 3 = 10$$

💡 Counting blocks across and down, then adding, is still Grade 2 arithmetic.

#1 Draw a Diagram 2.OA.A.1 Step 5

Leg $B \to C$: from column $0$ to column $2$ is $2$ blocks; from row $0$ up to row $4$ is $4$ blocks.
Total $= 2 + 4 = 6$ blocks.

$$|2-0| + |4-0| = 2 + 4 = 6$$

💡 Same idea: count across, count up, add.

#1 Draw a Diagram 2.OA.A.1 Step 6

Leg $C \to F$: from column $2$ to column $6$ is $4$ blocks; from row $4$ up to row $5$ is $1$ block.
Total $= 4 + 1 = 5$ blocks.

$$|6-2| + |5-4| = 4 + 1 = 5$$

💡 One more across-and-up count, then add.

#7 Identify Subproblems 3.NBT.A.2 Step 7

Add the four leg lengths to get the full loop.
$3 + 10 + 6 + 5 = 24$ blocks, which matches choice (C).

$$3 + 10 + 6 + 5 = 24 \;\Rightarrow\; \textbf{(C)}$$

💡 Summing four small numbers fluently is Grade 3 add-within-$1000$.

[1] #1 K.G.A.1 Read each labeled point off the grid by counting blocks right from the left edge

[2] #7 3.MD.D.8 Because the truck must follow streets, the shortest distance between two corners

[3] #1 2.OA.A.1 Leg $F \to A$: from column $6$ to column $7$ is $1$ block right; from row $5$ do

[4] #1 2.OA.A.1 Leg $A \to B$: from column $7$ all the way left to column $0$ is $7$ blocks; fro

[5] #1 2.OA.A.1 Leg $B \to C$: from column $0$ to column $2$ is $2$ blocks; from row $0$ up to r

[6] #1 2.OA.A.1 Leg $C \to F$: from column $2$ to column $6$ is $4$ blocks; from row $4$ up to r

[7] #7 3.NBT.A.2 Add the four leg lengths to get the full loop. $3 + 10 + 6 + 5 = 24$ blocks, whi

Review

Reasonableness: Every leg's length is at least the straight-line block gap between its endpoints, so $24$ blocks is a true lower bound for this $F \to A \to B \to C \to F$ order. The grid is $8 \times 6$, so a route that touches the far corners ($B$ at $(0,0)$, $A$ at $(7,3)$) must include the long $A \to B$ trip of $10$ blocks; $24$ total is consistent with that. The answer sits in the middle of the choices $20$–$28$, which is the typical AMC 8 spread when the trap answers come from miscounting one leg by $\pm 1$ or $\pm 2$.

Alternative: Tool #3 (Eliminate Possibilities) plus a parity check: any closed loop on a grid that returns to its start uses an even number of horizontal moves and an even number of vertical moves, so the total must be even. That alone keeps only $20$, $22$, $24$, $26$, $28$. Then a quick sanity bound — the single leg $A \to B$ already needs $10$ blocks, and the other three legs together need at least $3 + 6 + 5 = 14$, giving $\geq 24$ — pins the answer to (C).

CCSS standards used (min grade 3)

K.G.A.1 Describe positions of objects using above, below, beside, in front of (Reading each labeled point's position on the grid by saying how many blocks right and how many blocks up it is from the corner.)
2.OA.A.1 Solve one- and two-step word problems using addition and subtraction within 100 (Finding each leg's block-length by adding the horizontal block-count and the vertical block-count (e.g. $1 + 2 = 3$, $7 + 3 = 10$).)
3.MD.D.8 Solve real-world problems involving perimeters of polygons (Treating the closed delivery route $F \to A \to B \to C \to F$ as a polygonal path whose total length is the sum of its sides.)
3.NBT.A.2 Fluently add and subtract within 1000 (Adding the four leg lengths $3 + 10 + 6 + 5 = 24$ to get the total number of blocks.)

⭐ This AMC 8 problem only needs Grade 3 addition and the idea of "path length around a shape" you already know!

Problem

Diagram

Toolkit + CCSS Solution

Understand

Plan

Execute — Answer: C

Review

CCSS standards used (min grade 3)

More like this