It is the 1960s, and a nation has promised to land a man on the moon, which means sequencing ten thousand interdependent engineering tasks across limited crews, hard deadlines, and consequences measured in lives. Some tasks cannot start until others finish; the whole program is only as fast as its longest chain of dependencies. Schedule the work under real constraints, and — critically — make slippage visible early, so a delay buried deep in the network raises an alarm before it silently sinks the launch date. Surface the critical path. Get it wrong and delays compound invisibly until the deadline is lost, crews idle while bottlenecks starve, or corners get cut and people die — at moonshot scale, the schedule itself is a safety system.
Silver's AlphaGo and AlphaZero (2016-2017) married deep networks to Monte Carlo tree search and mastered adversarial games by self-play at massive simulated scale. Two of that recipe's three preconditions fail here. Self-play needs millions of cheap rollouts; a moonshot runs once, with lives attached. And Go's rules are perfectly known and stationary, whereas a program schedule's 'rules' are duration estimates that engineers revise weekly. The piece that survives is search over sequential decisions under a simulator — modern descendants of his methods do get applied to scheduling — but in the 1960s frame, the problem is already solved exactly by a longest-path pass over the activity network; there is nothing for a learned value function to approximate. He also brings no experience running large engineering organizations. Substantial machinery, almost none of it load-bearing for this task.
Barber's research — conformal prediction, knockoffs, valid inference after model selection — is about honest uncertainty statements from data, with finite-sample guarantees and minimal assumptions. The scheduling problem offers her methods almost nothing to grip. Conformal prediction needs exchangeable repetitions to calibrate on; a moonshot is a single, unprecedented program, so there is no reference class of prior Apollos from which to build distribution-free intervals on the launch date. The deterministic core — precedence networks, longest paths, resource leveling — is graph optimization entirely outside her field, and the organizational half (reporting hierarchies, early alarms) is management design, not statistics. The generous reading, that a modern program office should want assumption-lean uncertainty on its milestone forecasts rather than PERT's beta-distribution folklore, gestures at her values without invoking any method she has actually built. Near the batch floor.
Battle #134 · 8/10/2026, 11:39:24 AM · this result is deterministic: the same two personas on this problem always resolve the same way.