Mathematics · the experiment
Map the openings
A catalogue of 3,810 named openings, pawns that never move backwards, and a network of pawn structures. Four questions, from beginner to expert, on the hidden map behind chess opening names.
1 · Find the slow part
Beginner
Why do the authors treat the pawns as the slow part of an opening?
2 · Count the pawn commitment
Pawn commitment Λ adds up the rows a side's pawns have advanced: 1 for a one-square move, 2 for a two-square move, a capture counting as one row. The advances of pawns captured later still count.
Moves: 1.e4 d5 2.exd5 Qxd5 3.g3.
Intermediate
What is White's pawn commitment after 3.g3?
3 · Test the eight regions
The algorithm finds eight communities in the network of White pawn structures, with modularity 0.569. Random networks with the same number of links per node give about 8.4 communities, with modularity 0.444 ± 0.007.
Expert
What shows that the eight communities are not an accident?
4 · Explain the arrows
In the network, a link goes from structure A to structure B when a single pawn advance, or the loss of a single captured pawn, turns A into B. All 335 links are one-way.
Expert
Why can no chain of links ever lead back to a structure already visited?
Openings mapped
—