Fold Go: Exact Counted Legality, Certified Solves, and Zero-Parameter Competitive Play

Go rebuilt as exact counted law. Fold Go is a zero-trained-parameter computational proof in which legality is connected-component counting, board states are finite three-colour fields, and solved values are produced by exhaustive execution rather than learned policy or value networks. The engine exactly reproduces the legal-position inventories 1, 57, 12,675, and 24,318,165 for boards 1×1 through 4×4, plus 5 and 489 for 1×2 and 2×3, with zero disagreements from an independent referee. It freshly secures exact empty-board values 1×1 = 0, 1×2 = 0, and 2×2 = +1, the latter through 17,038,501 visited nodes. The same programme has produced two independent, replay-verified 2–0 batches against GNU Go 3.8 on 9×9: every move was legal, every game ended pass–pass, and every internal score reproduced. Together, the exact census, solved games, and competitive receipts show a continuous route from theorem-forced rule structure to functioning play without trained weights.