After the opening 16 and the reply 28, naming 58 reaches Y. Y is short, so by the Quiet End Theorem it is P exactly when each of its 54 obligations, the moves listed below, leads to an N-position. Every one is covered, so the reply 28 to the opening 16 loses. With the certified answers for 2–24, U for 26, and Hutchings' theorem for the odd replies, every reply to 16 up to 28 now has an answer.
What it rests on. 48 obligations have finite witnesses, each replayed from empty memos by the native and the Python solver with equal state counts. Six reach repository certificates of P-positions (C, E, F and P0), which through E, F and P0 rest on Blok's pairing family. The result lists everything, including how Y was found.
Loading the audit from the repository…
| Move | Position | Evidence | Answer | States | Check |
|---|
Source: the campaign result
and its audit.json, produced by python sylver/campaigns/y-2026-10-07/audit.py.
Back to U, W, The Book, or the
solver demo.