{"id":"routing-heuristics-prioritize-correctness-over-tightness","text":"Routing heuristics prioritize guaranteed optimality over search efficiency: A* uses haversine distance (always underestimates road distance) and time optimization divides by the global maximum speed limit (always underestimates travel time) — both are admissible heuristics that guarantee optimal paths at the cost of exploring unnecessary nodes.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["maps-astar-heuristic-admissible","maps-time-heuristic-uses-global-max-speed"],"outlist":[],"label":"Both heuristic choices sacrifice tightness for admissibility, choosing provable correctness (guaranteed optimal path) over practical performance (fewer nodes explored)"}],"dependents":["algorithmic-simplicity-is-preferred-over-optimal-performance"],"metadata":{"last_reviewed":"2026-06-06T06:26:57","review_result":"pass"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"routing-heuristics-prioritize-correctness-over-tightness","truth_value":"IN","reason":"SL justification valid","antecedents":["maps-astar-heuristic-admissible","maps-time-heuristic-uses-global-max-speed"],"label":"Both heuristic choices sacrifice tightness for admissibility, choosing provable correctness (guaranteed optimal path) over practical performance (fewer nodes explored)"},{"node":"maps-astar-heuristic-admissible","truth_value":"IN","reason":"premise"},{"node":"maps-time-heuristic-uses-global-max-speed","truth_value":"IN","reason":"premise"}]}}