AMC 8 · 2025 · #5

Grade 3 geometry-2d
coordinate-geometryperimeterspatial-visualization path-length-comparisonidentify-subproblems ↑ Prerequisites: coordinate-geometrymulti-digit-arithmetic
📏 Long solution 💡 2 insights 📊 Diagram
📘 View easy version →
Problem
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.

Pick an answer.

(A)
20
(B)
22
(C)
24
(D)
26
(E)
28

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

How to solve
Strategy Draw a Diagram

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 → A, A → B, B → C, C → F. Solve each tiny leg by counting, then add the four numbers.

1STEP 1

Read each labeled point off the grid: F = (6, 5), A = (7, 3), B = (0, 0), C = (2, 4).

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

On a grid the shortest leg is (horizontal blocks apart) + (vertical blocks apart); split the loop into four legs (Tool #7).

Leg length = (horizontal blocks) + (vertical blocks)
3STEP 3

Leg F → A: 1 block right and 2 blocks down, so 3 blocks.

|7-6| + |5-3| = 1 + 2 = 3
4STEP 4

Leg A → B: 7 blocks left and 3 blocks down, so 10 blocks.

|7-0| + |3-0| = 7 + 3 = 10
5STEP 5

Leg B → C: 2 blocks right and 4 blocks up, so 6 blocks.

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

Leg C → F: 4 blocks right and 1 block up, so 5 blocks.

|6-2| + |5-4| = 4 + 1 = 5
7STEP 7

Add the four legs: 3 + 10 + 6 + 5 = 24 blocks, which matches choice (C).

3 + 10 + 6 + 5 = 24 → (C)
Answer
24
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 → A → B → C → F order. The grid is 8 × 6, so a route that touches the far corners (B at (0,0), A at (7,3)) must include the long A → 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 ± 1 or ± 2.
💡Key takeaway

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