a01141c959b3c5b17c47a6957e45d96a43a6f684
Measures the owner's two complaints per pick (turn angle, heat on the path vs at the destination, time-to-arrive, and whether the destination is hot on the recorded true future when we would arrive), split by empty vs non-empty safe set. Result: the path IS scored (hard filter + least-hot fallback), but there was NO time term at all -- 65% of picks outran the 15-tick commitment and the chosen tile was reached 6.5% of the time. The bound refuses a candidate we cannot reach in TR_TFIL_ARRIVE_TICKS (default 0 = off = today). Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
Description
No description provided
Languages
Nim
73.7%
Python
18%
Shell
3.7%
Java
3.5%
HTML
1%
Other
0.1%