{"id":"chebyshev-distance-for-8dir-grid","text":"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.","truth_value":"IN","source":"entries/2026/06/06/minimum-time-visiting-all-points-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"chebyshev-distance-for-8dir-grid","truth_value":"IN","reason":"premise"}]}}