Status: IN
The minimum steps between two points on an 8-directional grid equals Chebyshev distance `max(|dx|, |dy|)`, not Manhattan distance `|dx| + |dy|`; diagonal moves close both axes simultaneously.
Source: entries/2026/06/06/minimum-time-visiting-all-points-solution.md