Abstract
Macro placement quality is judged by an evaluator that combines wirelength, density, and routing congestion, and that evaluator is usually considered too expensive to sit inside an optimization loop, so placers optimize surrogates instead. We measure what that substitution costs. A first-order analytical placer that solves wirelength essentially optimally (normalized wirelength 0.05 to 0.08) still lands 34% above the best scores we obtain, because its loss omits routing congestion, which contributes 54% to 73% of the evaluated score on the 17 ICCAD04 benchmark designs. We then make exact evaluation affordable: an incremental reimplementation of the public TILOS evaluator scores a single-block move in 0.85 ms, 1,510× to 6,287× faster than the reference implementation, and agrees with it to 10-7. Plain greedy coordinate descent on this exact objective improves every design by 19% to 34% over the analytical placer (suite mean 1.399 to 1.043) and never produces an overlap. Controlled ablations attribute the gain: descent over soft standardcell clusters contributes a mean 0.351, congestion-weighted move acceptance a further 0.015, while annealing with perfect objective fidelity but three orders of magnitude fewer evaluations contributes approximately zero. The same annealer given the fast evaluator recovers to within 0.005 of coordinate descent, isolating evaluation throughput, not optimizer choice, as the deciding variable. We specify all four optimizer families to reimplementation detail, with inputs, tensor shapes, update rules, and budgets, and release the implementation as an open artifact.