Turán’s brick factory problem · 1944
The Brick Factory
Every kiln must be joined by rail to every storage yard. Where two rails cross, the carts jump the track. How few crossings can you manage?
Where the question came from
“The work itself was not difficult; the trouble was only at the crossings. The trucks generally jumped the rails there, and the bricks fell out of them… the idea occurred to me that this loss of time could have been minimized if the number of crossings of the rails had been minimized. But what is the minimum number of crossings?”
1. Lay the rails yourself
Drag the kilns and the yards. Every crossing is marked. Try to reach the target — then try to beat it.
Kilns 4
Yards 4
Your crossings 0
Target (best known) 0
kiln (square)storage yard (circle)a crossing
With three kilns and three yards this is the old “three utilities” puzzle: one crossing cannot be avoided. Rails here are straight; the real problem allows curves, and the classical layout is still the best anyone has found. Nobody has ever beaten the target, for any numbers.
2. What was actually proven
The target comes from a formula found in the 1950s. This table shows it for each number of kilns and yards — and which entries people had managed to prove by 2026.
proven before 2026 (by hand to six, a few more by computer)never proven — claimed in 2026
Green is everything eighty years of work had settled: any size where one side has six or fewer, and a few more up to eight by ten. The table goes on forever, and beyond that edge every entry is unproven. The 2026 paper claims all of them at once.
3. Eighty-two years
- 1944The question. Turán, a forced labourer, asks it while pushing brick carts near Budapest.
- 1950sDeclared solved. Zarankiewicz publishes the layout and a proof that it is the best possible.
- Mid-1960sA gap. After about a decade as an accepted result, the proof is found to have a hole that nobody can fill.
- 1970Six kilns. Kleitman proves the formula when one side has at most six.
- 1993A few more, by computer. Seven kilns with eleven yards, and nine with nine, remain the smallest unsettled cases.
- 2026A sixteen-page claim. A paper written by an OpenAI model claims every case, with a machine-checked statement. No specialist has yet verified it, and Wikipedia’s note on removing the claim reads: “let’s wait until we have published reliable sources.”
A companion visual to UC-330 · The Trouble Was Only at the Crossings, a StratIQX case study. It illustrates the subject; it is not part of the case’s scored analysis.
Sources: P. Turán, “A note of welcome”, J. Graph Theory 1 (1977); K. Zarankiewicz, Fund. Math. 41 (1954); D. Kleitman (1970); D. R. Woodall (1993); OpenAI, “The crossing number of complete bipartite graphs” (2026, unverified). The classical layout’s crossing counts were recomputed for this page and match the formula.
See also: Colouring the Plane and The Fastest Way to Multiply, from the same release.