Reasoning · Grade 4-2 One-Stroke Drawing

Problem

Shortest route covering every road

The two road maps are 2 squares stacked one above the other and 3 squares in a row, every side one road 1 yard long. You may start and finish at any dots. Every road must be travelled, and a repeat counts again. Find the shortest distance for each map.
Your answer
How to solve
Strategy Draw a Diagram — The total length of all the roads is the absolute floor for the journey, so the real question is only how much retracing is forced. Marking on the picture how many roads meet at each dot answers that, because roads get used up in pairs at every dot the walk passes through: only the starting dot and the finishing dot are allowed an odd number. So I count the odd dots on the diagram, list the cheapest ways to fix the extra ones by retracing, and then actually walk a route to check the distance really is reached.
1STEP 1

Work out the floor: the total length of all the roads

The totals 7 and 10 yards are the floor.

7 × 1 yd = 7 yd, 10 × 1 yd = 10 yd
2STEP 2

Mark how many roads meet at each dot and find the odd ones

Mark the road counts to find the odd dots.

3STEP 3

Map (1): count the odd dots

Map (1) has only 2 odd dots.

2, 2, 3, 3, 2, 2 → 2 odd dots
4STEP 4

Map (1): walk it in one stroke, 7 yards

So map (1) hits its floor at 7 yards.

7 yd
5STEP 5

Map (2): count the odd dots

Map (2) has 4 odd dots.

2, 3, 3, 2 (top), 2, 3, 3, 2 (bottom) → 4 odd dots
6STEP 6

Map (2): only 2 odd dots may survive, so pick the cheapest pair to fix

Repeat the cheapest road, 1 yard.

1, 1, 1, 1, 2, 2 → cheapest 1 yd
7STEP 7

Map (2): add the retrace and walk it, 11 yards

So map (2) needs 11 yards.

10 + 1 = 11 yd
Answer
7, 11 yards
10 + 1 = 11
Both answers are in yards and both are whole numbers, which is right because every road is a whole yard and the walk only ever moves from dot to dot. Neither answer can be below the total road length, 7 yards and 10 yards, and neither is. For map (1) the answer sits exactly on that floor, which is the best that could ever happen, and it is allowed because the map has only 2 odd dots. For map (2) the answer is just 1 yard above the floor, and it could not be any less, because 4 odd dots force at least one retrace and the shortest thing that can be retraced is a single 1-yard road. Both routes were also traced road by road to make sure nothing was missed.
Takeaway

Count the roads at every dot: the dots with an odd number are the only ones that can force you to walk a road twice.

  • Work out the floor: the total length of all the roads
  • Mark how many roads meet at each dot and find the odd ones
  • Map (1): count the odd dots
  • Map (1): walk it in one stroke, 7 yards
  • Map (2): count the odd dots
  • Map (2): only 2 odd dots may survive, so pick the cheapest pair to fix
  • Map (2): add the retrace and walk it, 11 yards