It is 1949 at Bell Labs, and Claude Shannon is writing the paper that will found computer chess before any machine can run it. Sketch a complete design: represent the board, define an evaluation function from material and mobility, and choose between searching every line to fixed depth or selectively following plausible moves — the brute-force and intuition strategies, named and costed decades before hardware can test either. The arithmetic is brutal: the game tree holds more positions than atoms, so the design must argue from principle, not experiment. Get the framing wrong and the field inherits a dead end for its first canonical problem; get it right and fifty years of machines climb the ladder this one paper builds.
Tao's extraordinary breadth across pure and applied mathematics, including compressed sensing developed with Emmanuel Candes decades after this problem's 1949 setting, demonstrates general mathematical brilliance relevant in spirit to arguing rigorously from combinatorial first principles, as this problem's design requires when no hardware exists to test empirically. He has no documented specific contribution to chess programming, game-tree search, or Shannon's original 1949 design questions; his research centers on number theory, harmonic analysis, and partial differential equations, not AI or game theory. His relevance to this problem is general mathematical proximity to the kind of rigorous argument-from-principle the problem demands, rather than a direct historical contribution to the specific chess-design task.
The professor arrives at Bell Labs a year late, waving a laptop that does not yet exist in 1949, and confidently proposes evaluating chess positions by 'just asking the model,' at which point Shannon, mid-sentence about material and mobility weightings, simply blinks. He tries to explain that brute-force search will eventually run on something called a GPU; the room stares, because vacuum tubes are the state of the art and he has just described science fiction badly. Turing, sketching Turochamp on a napkin nearby, quietly finishes a working design before the professor finishes his slide transition. He loses this one before the first move is even played, mostly to the calendar, but partly, and more damningly, to Shannon.
Battle #173 · 8/11/2026, 9:30:42 AM · this result is deterministic: the same two personas on this problem always resolve the same way.