Question 6
In the $4\times4$ grid shown, each small line segment is 1 unit long. What is the longest distance a beetle can travel from $A$ to $B$ if each segment may be traversed at most once? Original choices: (A) 24; (B) 26; (C) 28; (D) 30; (E) 31.
The printed choices are retained, but a choice-list inconsistency requires manual assessment. Give the longest distance itself. Vertices may be revisited; only reusing a line segment is forbidden, exactly as in the printed restriction.
The printed choices are retained, but a choice-list inconsistency requires manual assessment. Give the longest distance itself. Vertices may be revisited; only reusing a line segment is forbidden, exactly as in the printed restriction.