Deterministic Tie-Breaking in Graph Search: Simple Arithmetic Ordering Outperforms Complex Heuristics

A 70% Improvement Through Deterministic Ordering

We demonstrate that simple arithmetic node ordering (DigitSum, Mod2) 

achieves 70% better performance than complex heuristics in graph search. 

Counterintuitively, O(1) strategies outperform O(√n) approaches through 

consistent tie-breaking. Includes reproducible experiments on 150 graphs 

with complete source code.