thumb|upright=1.2|The 1952 game between Turochamp (White) and Alick Glennie (Black). After 29 moves, White is one pawn up but about to lose its Pin (chess)|pinned Queen on the next move. Therefore, White resigns.
thumb|upright=1.2|The 1952 game between Turochamp (White) and Alick Glennie (Black). After 29 moves, White is one pawn up but about to lose its Pin (chess)|pinned Queen on the next move. Therefore, White resigns.
Turochamp is a chess program developed by Alan Turing and David Champernowne in 1948. It was created as part of research by the pair into computer science and machine learning. Turochamp is capable of playing an entire chess game against a human player at a low level of play by calculating all potential moves and all potential player moves in response, as well as some further moves it deems considerable. It then assigns point values to each game state, and selects the move resulting in the highest point value.
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).