Turochamp

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 of the potential player moves in response, assigning point values to each game state, and selecting the move with the highest average possible point value.

Turochamp
Developer(s)Alan Turing, David Champernowne
Genre(s)Computer chess
Mode(s)Single-player

Turochamp is the earliest known computer game to enter development, but was never completed by Turing and Champernowne, as its algorithm was too complex to be run by the early computers of the time such as the Automatic Computing Engine. Turing attempted to convert the program into executable code for the 1951 Ferranti Mark 1 computer in Manchester, but was unable to do so. Turing played a match against computer scientist Alick Glennie using the program in the summer of 1952, executing it manually step by step, but by his death in 1954 had still been unable to run the program on an actual computer. Champernowne did not continue the project, and the original program design was not preserved. Despite never being run on a computer, the program is a candidate for the first chess program; several other chess programs were designed or proposed around the same time, including another one which Turing unsuccessfully tried to run on the Ferranti Mark 1. The first successful program in 1951, also developed for the Mark 1, was directly inspired by Turochamp, and was capable only of solving "mate-in-two" problems. A recreation of Turochamp was constructed in 2012 for the Alan Turing Centenary Conference. This version was used in a match with chess grandmaster Garry Kasparov, who gave a keynote at the conference.

Gameplay

Turochamp simulates a game of chess against the player by accepting the player's moves as input and outputting its move in response. The program's algorithm uses a two-move heuristic to determine the best move to make: it calculates all of the potential moves that it can make, then all of the potential player responses that could be made in turn, assigns a point value to each resulting state, then makes the move with the highest average resulting points.[1][2][3] Points are determined based on several criteria, such as the mobility of each piece, the safety of each piece, the threat of checkmate, the value of the player's piece if taken, and several other factors. Different moves are given different point values; for example taking the queen is given 10 points but a pawn only one point, and placing the king in check is given a point or half of a point based on the layout of the board.[4] According to Champernowne, the algorithm is primarily designed around the decision to take a piece or not; according to Turing, the resulting gameplay produces a low level game of chess, which he considered commensurate with his self-described average skill level at the game.[1][4]

History
Alan Turing at age 16

Alan Turing was an English mathematician, computer scientist, logician, cryptanalyst, philosopher and theoretical biologist.[5] Turing was highly influential in the development of theoretical computer science, providing a formalisation of the concepts of algorithm and computation with the Turing machine, which can be considered a model of a general-purpose computer.[6][7][8] Turing is widely considered to be the father of theoretical computer science and artificial intelligence.[9] Beginning in 1941, while working in wartime cryptanalysis at Bletchley Park, Turing began to discuss with his colleagues the possibility of a machine being able to play chess or perform other "intelligent" tasks, as well as the idea of a computer solving a problem by searching through all possible solutions using a heuristic or algorithm.[10][11] Some of Turing's cryptanalysis work, such as on the Bombe, was done through this model of a computing machine searching through possibilities for a solution.[11] He continued to discuss the idea with his colleagues throughout the war, such as with economic statistician D. G. Champernowne in 1944, and by 1945 he was convinced that a machine capable of performing general computations would be theoretically capable of replicating anything a human brain could do, including playing chess.[10][12]

After World War II, Turing worked at the National Physical Laboratory (NPL), where he designed the Automatic Computing Engine (ACE), among the first designs for a stored-program computer. In 1946, Turing wrote a report for the NPL entitled "Proposed Electronic Calculator" that described several projects that he planned to use the ACE for; one of these was a program to play chess. He gave a reading at the London Mathematical Society the following year in which he presented the idea that a machine programmed to play chess could learn on its own and acquire its own experience. Subsequently, in 1948, he wrote a new report for the NPL, entitled "Intelligent Machinery", which suggested a form of imitation chess.[13]

In the late summer of 1948 Turing and Champernowne, then his colleague at King's College, Cambridge, devised a system of theoretical rules to determine the next strokes of a chess game. They designed a program that would enact an algorithm that would follow these rules, though the program was too complex to able to be run on the ACE or any other computer of the time.[1] The program was named Turochamp, a combination of their surnames.[13] It is sometimes misreported as "Turbochamp".[14] According to Champernowne, his wife played a simulated game against the program, nicknamed the "paper machine", and lost.[13][15] Turing attempted to convert the program into executable code for the 1951 Ferranti Mark 1 computer in Manchester, but was unable to do so due to the complexity of the code.[14] According to Jack Copeland, author of several books on Turing, he was not concerned that the program could not be run, as he was convinced that the speed and sophistication of computers would soon rise to make it possible.[16] In the summer of 1952, Turing played a match against computer scientist Alick Glennie using the program, executing it manually step by step. The match, which was recorded, had the Turochamp program losing to Glennie in 29 moves, with each of the program's moves taking up to 30 minutes to evaluate. Although the match demonstrated that the program could viably play against a human in a full game, it was not run on an actual computer before Turing's death in 1954.[14]

Legacy
Garry Kasparov speaking at the Alan Turing Centenary Conference in Manchester on 25 June 2012.

Turochamp is a candidate for the first chess program, though the original program was never run on a computer. Several other chess programs were designed and attempted around the same time, such as in Claude Shannon's 1950 article Programming a Computer for Playing Chess, Konrad Zuse's chess routines developed from 1941 to 1945 for his proposed programming language Plankalkül, and Donald Michie and Shaun Wylie's chess program Machiavelli, which Turing unsuccessfully tried to run on the Ferranti Mark I at the same time as Turochamp.[13][17][18][19] In November 1951 Dietrich Prinz, who worked at Ferranti and was inspired by Turing's work on Turochamp, developed the first runnable computer-based chess program for the Ferranti Mark I, which could solve "mate-in-two" problems.[1]

The original code and algorithm written by Turing and Champernowne has not been preserved. In 1980, Champernowne described the way Turochamp worked, but he was not able to recall all of the details of the game's rules.[1][16] A version of Turochamp was developed in 2012 from descriptions of the game's algorithm as a symbolic recreation.[20] After the initial recreation was unable to recreate Turing's simulated match against Glennie, several computer chess experts and contemporaries of Turing were consulted in interpreting Turing and Champernowne's descriptions of the program, including Ken Thompson, creator of the 1983 Belle chess machine and the Unix operating system. They were unable to find the explanation for the deviation until they consulted with Donald Michie, who suggested that Turing had not been concerned with meticulously working out exactly which move Turochamp would recommend. With this in mind they were able to prove that from the very first move of the game Turing had incorrectly deviated from moves that appeared suboptimal without working out their point value.[lower-alpha 1] The resulting recreation was presented at the Alan Turing Centenary Conference on 22–25 June 2012, in a match with chess grandmaster and former world champion Garry Kasparov.[21] Kasparov won the match in 16 moves, and complimented the program for its place in history and the "exceptional achievement" of developing a working computer chess program without being able to ever run it on a computer.[22]

gollark: <:thonk_down:433149076721238016> <:transistor:717746226925404181> <:thonk:445016973798014987> <:dodecahedron:724893894822854697>
gollark: <:thonk_down:433149076721238016> <:thonk:445016973798014987> <:thonk_down:433149076721238016> <:thonk:445016973798014987>
gollark: <:transistor:717746226925404181> <:transistor:717746226925404181> <:bees:724389994663247974> <:bees:724389994663247974> <:transistor:717746226925404181>
gollark: …
gollark: <:bees:724389994663247974>:bees:

See also

Notes
  1. Specifically, Turing had opened by moving his pawn 2 spaces to E4 as he likely felt it was the obviously superior move to moving it one space to E3, when actually the algorithm gives it a lower point value as it leaves the king theoretically open to attack from E3, even though at that point in the game no opposing piece could possibly reach that location.[21]

References
  1. The Essential Turing, pp. 563-564
  2. "David Champernowne (1912-2000)". ICGA Journal. 23 (4): 262. December 2000. doi:10.3233/ICG-2000-23419.
  3. Cochlin, Daniel (2012-06-26). "Kasparov versus Turing". University of Manchester. Retrieved 2019-04-09.
  4. How Computers Play Chess, p. 35
  5. "Turing, Alan Mathison". Who's Who. ukwhoswho.com (online Oxford University Press ed.). A & C Black, an imprint of Bloomsbury Publishing plc. 2017. doi:10.1093/ww/9780199540884.013.U243891. (subscription or UK public library membership required) (subscription required)
  6. Newman, M. H. A. (1955). "Alan Mathison Turing. 1912–1954". Biographical Memoirs of Fellows of the Royal Society. 1: 253–263. doi:10.1098/rsbm.1955.0019. JSTOR 769256.
  7. Gray, Paul (1999-03-29). "Alan Turing – Time 100 People of the Century". Time. Retrieved 2019-02-07.
  8. Introduction to the Theory of Computation, p. 37
  9. Alan Turing: His Work and Impact, pp. 481–485
  10. Hodges, Andrew (2013-09-30). "Alan Turing". Stanford Encyclopedia of Philosophy. Stanford University. Retrieved 2019-05-22.
  11. Copeland, Jack; Proudfoot, Diane (2012). "Alan Turing, Founder of the Modern Computer". The Rutherford Journal. 1 (4). ISSN 1177-1380.
  12. Alan Turing: The Enigma, p. 488
  13. Alan Turing: His Work and Impact, pp. 644–650
  14. Clark, Liat; Steadman, Ian (2017-06-07). "Remembering Alan Turing: from codebreaking to AI, Turing made the world what it is today". Wired. Condé Nast. Retrieved 2019-02-07.
  15. "Reconstructing Turing's "Paper Machine"". ICGA Journal. 40 (2): 1–8. June 2018.
  16. The Antipodean Philosopher, pp. 13–14
  17. It Began with Babbage: The Genesis of Computer Science, p. 193
  18. Prof: Alan Turing Decoded, ch. 9
  19. Chess and Machine Intuition, p. 39
  20. "Player of the Century". New In Chess. Interchess. August 1999. pp. 6–7. ISSN 0168-8782.
  21. Kasparov, Garry (June 2012). The Reconstruction of Turing's 'Paper Machine'. Alan Turing Centenary Conference. Manchester, England. Retrieved 2019-04-09 – via VideoLectures.net.
  22. Parnell, Brid-Aine (2012-06-26). "Chess algorithm written by Alan Turing goes up against Kasparov". The Register. Situation Publishing. Retrieved 2019-04-09.

Sources
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.