Turochamp EmulatorChess · History · Artificial intelligence
An idea from 1948.
A different way to play.

1952 / The recorded game

The paper machine meets Glennie.

Replay the historical score, one move at a time, with a few landmarks along the way.

Historical replayRecorded moves

The players

Move record

The surviving score

This replay follows the commonly published 29-move game attributed to Turing’s paper machine and Alick Glennie in Manchester, usually dated 1952. White is the paper machine; Glennie has Black.

The published reconstruction account notes a different continuation in Turing’s typescript after move 21. We use the later, commonly reproduced score and keep that choice explicit. The last position is a resignation, not checkmate.

Watch the ideas, not only the mistakes

Look for development, pawn advances and king safety. The rook manoeuvres are especially visible. A replay lets you pause before an exchange and count which pieces are attacking and defending each square.

You can then return to the live console and see how the reconstruction behaves in a fresh game. Similar-looking play does not prove exact fidelity, and a different move does not by itself explain why the historical calculation differed.