John H. Conway’s Work Algorithms

A 300-case reconstruction of Conway’s mathematical workflow across combinatorial games, surreal numbers, finite groups, sporadic symmetry, the Leech lattice, sphere packings, codes, quadratic forms, tilings, quantum foundations, algorithms, and playful exposition. Each paper, book chapter, lecture, or section-style unit is treated as one case. Histogram percentages are overlapping case prevalence and need not sum to 100%.

33 Overlapping Strategies300 CasesGames · Groups · Lattices · SymmetryPrevalence Histograms
00

Reconstruction Method

This page is a bibliographic and methodological reconstruction, not a full-text reproduction. The case corpus uses public bibliographic records and book/chapter-level source spines. Strategy tags overlap: a single case may use several methods, so histogram percentages indicate case prevalence rather than a probability distribution.

The reconstruction treats Conway’s work as a repeatable workflow: invent a playable universe; compress it into notation; compute examples; discover an invariant; then promote the invariant into a theorem, table, algorithm, or research program. The corpus combines the Princeton bibliography’s article-paper list with chapter-level reconstructions from Conway’s books and lecture-style expositions.

01

Decision Tree of Strategies

02

Prevalence Ranking

Bars show the percentage of the 300 cases using each strategy. Since each case may carry multiple strategy tags, the total prevalence can exceed 100%.
03

300-Case Corpus

#YearSourceCaseMain thesis / problem moveResult typeStrategy tags
04

Source Spine

05

Worked Demonstrations