1868 - Charles Hooper

was an American computer scientist, known for the Kotok-McCarthy-Chess Program, his work at Digital Equipment Corporation, and his contributions on the World Wide Web Consortium (W3C). Between 1959 and 1962, while student under John McCarthy at MIT, Alan Kotok and his fellows Elwyn Berlekamp, Michael A. Lieberman, Charles Niessen and Robert A. Wagner wrote a chess program for the IBM 7090. Based on Alex Bernstein's 1957 program and routines by McCarthy and Paul W. Abrahams, they added alpha-beta pruning to minmax, at McCarthy's suggestion. The Kotok-McCarthy-Program was written in Fortran and FAP, the IBM 7090 macro assembler 

was an English mathematician, logician, and cryptographer. Alan Turing was based at Bletchley Park, Bletchley in Buckinghamshire, while acting as the leading cryptanalyst of German ciphers during the World War II. He was the central force in continuing to break the Enigma machine, and to crack the Lorenz cipher (codenamed "Tunny"). 

Alan Turing was one of the pioneers of the information theory and computer science. He was highly influential in its development, giving a formalization of the concepts of "algorithm" and "computation" with the Turing machine, which can be considered a model of a general purpose computer. 

an American musicologist and professor emeritus at the University of Southern Mississippi. He received a Ph.D. in musical composition from North Texas State University in 1968. 

Alex Bernstein was born in Milan as son of Russian born, Italian mathematician Vladimir Bernstein (1900 - 1936). In 1940, Vladimir’s mother Elizabeth and her second husband fled from Fascist Italy, bringing Alex and his sister to New York City. Alex Bernstein started playing chess seriously during his high school time at City College. After graduating from Columbia University, he served at the US army, where he became acquainted with computers. As full-time employee at IBM, he got interested in writing a chess program, and talked with Claude Shannon about his ideas. During the 1956 Dartmouth workshop, when he was invited to talk about his program already in development, a discussion with John McCarthy led to McCarthy's discovery of alpha-beta - according to McCarthy, Bernstein was not initially convinced about the idea. Pamela McCorduck, who was married to Joseph F. Traub gives details in her seminal book Machines Who Think , with some quotes below, including from an interview with Alex Bernstein. 

was a American researcher in computer science and pioneer in the field of artificial intelligence and chess software at the Carnegie Mellon University, Pittsburgh, Pennsylvania. In 1958, Allen Newell, Cliff Shaw, and Herbert Simon developed the chess program NSS. It was written in a high-level language. Allen Newell and Herbert Simon were co-inventors of the alpha-beta algorithm, which was independently approximated or invented by John McCarthy, Arthur Samuel and Alexander Brudno. Allen Newell and Herbert Simon received the Turing Award in 1975. Two of Allen Newell's students, Hans Berliner and James Gillogly became computer chess researchers and authors of famous chess computers.

  Babbage era muito inteligente e tinha talento especial para a matemática, que estudou por sua conta própria na adolescência Dentre suas principais contribuições está à criação da primeira calculadora que, segundo ele simulava as ações mentais. Além de tabular os valores das funções matemáticas, a máquina dispunha de recursos para jogar xadrez, damas e outros jogos. Era até mesmo dotada de memória para armazenar os resultados parciais usados posteriormente para completar o cálculo. Babbage batizou a calculadora de “a máquina da diferença”.

the dominating chess machine in the late 70s and early 80s, was developed by Ken Thompson and Joe Condon from Bell Laboratories. It was five times winner of the ACM North American Computer Chess Championship, the ACM 1978, ACM 1980, ACM 1981, ACM 1982, and ACM 1986, and won the Third World Computer Chess Championship 1980 in Linz. 

Belle consists of a special-purpose hardware and associated software, and was pure brute-force. Belle started in the early 70s as a sole software approach, but more and more emerged to a hybrid chess computer, next using a move generator, a position evaluator, and a transposition table inside a special-purpose hardware. In its final incarnation, Belle was composed of a PDP-11/23, and further a LSI-11 processor with several custom boards. The speed increased from 200 nps from the software version to about 160,000 nps of the machine mentioned at the Advances in Computer Chess 3 conference in 1981 

the Northwestern University Chess Program by primary authors Larry Atkin and David Slate was the dominating program in the 70s, winning eight times the ACM North American Computer Chess Championships and the second WCCC Toronto 1977. The version Chess 4.0 from 1973 was a complete re-write and paradigm shift from Shannon type B to type A. Chess ran on Control Data Corporation's line of supercomputers, CDC 6600 and CDC Cyber, Chess 4.x was completely written in COMPASS, the CDC assembly language.

 In 1949 Shannon published a groundbreaking paper on computer chess entitled Programming a Computer for Playing Chess . It describes how a machine or computer could be made to play a reasonable game of chess. His process for having the computer decide on which move to make is a minimax procedure, based on an evaluation function of a given chess position. 

was an American mathematician and pioneer in computer programming languages, artificial intelligence, and the development of on-line, interactive, time-sharing computers. He worked for the RAND Corporation, 1950-1971, where he completed his most significant work. 

was the successor of the program Blitz by Robert Hyatt and Albert Gower. With the sponsorship of Cray Research, supported by Dave Darling and Derek Robb, and later by Cray Assembly expert Harry Nelson from the Lawrence Livermore National Laboratory , they adopted and optimized Blitz for a Cray-1 supercomputer, later a Cray X-MP, Cray Y-MP and C916 with up to 16 processors. Cray Blitz initially used root splitting as parallel search algorithm on the two processor Cray X-MP, implemented and tested just before the WCCC 1983, later principal variation splitting, enhanced principal variation splitting , and in the 90s DTS, specifically designed for a shared memory multiprocessor architecture of the Crays. Cray Blitz was written in Fortran, time-critical parts in the Cray Assembly Language CAL. 

Cray Blitz won two times the ACM North American Computer Chess Championships and also was two times winner of the World Computer Chess Championships, the WCCC 1983 in New York , and the WCCC 1986 in Cologne. 

was an English mathematician, statistician and economist who picked a hole in John Maynard Keynes' General Theory of Employment, Interest and Money and 'built a chess computer' with Alan Turing , a long-time friend from the time that they were undergraduates together at King's College, Cambridge.

an American computer scientist and former computer chess programmer. He started chess programming in 1968 as physics graduate student at Northwestern University, and by mid 1969 joined the group of Larry Atkin and Keith Gorlen, to produce their first successful program, Chess 2.0. After Gorlen left the Northwestern in 1970, the development continued under Atkin and Slate. Later supported by CDC Cyber consultant David Cahlander, Chess almost dominated computer chess during the 70s in the United States. 

From the late 70s, Slate collaborated with William Blanchard to build their new chess program Nuchess. In the early 80s, David Slate was further involved in the development of programs for dedicated chess computers. Affiliated with Applied Concepts, and along with Atkin, Slate co-authored the Gruenfeld and Capablanca module programs for the Great Game Machine and the Chafitz modular game system. David Slate further worked with Peter W. Frey on Pattern and Letter Recognition. 

was a German computer scientist and pioneer, who developed the first limited chess program in England 1951. The computer, a Ferranti Mark 1, was not powerful enough to play a full game but could find the best move if it was only two moves away from checkmate, known as the Mate-in-two problem. 

Dietrich Prinz was educated at Berlin University, where his teachers included Planck and Einstein, and graduated with a Ph.D. in Philosophy. As Jewish scientist, Prinz escaped Nazi-Germany in 1938 and settled in England. In collaboration with the University of Manchester, Prinz worked as a research scientist at Ferranti Ltd in 1947, and became involved in the firm's work with the Manchester Mark series of computers. His interest in computer chess was likely influenced by his colleague Alan Turing, and like Michie, Strachey, and others, by an important article published in 1950 by Donald Davies, A Theory of Chess and Noughts and Crosses 

Was a British researcher and pioneer in artificial intelligence and game theory. During World War II, Michie worked with Alan Turing at Bletchley Park, with Jack Good and Shaun Wylie et al. in the section Newmanry headed by Max Newman, contributing to crack the German Lorenz cipher. In 1947-48, along with Wylie, Michie designed Machiavelli, a rival of Turing's Turochamp program. 

Michie was head of the University of Edinburgh's Department of Machine Intelligence from 1965 until 1985, when he left to found the Turing Institute in Glasgow. Michie researched on game theory and computer games and chess. He was a close friend of David Levy and involved in the famous Levy Bet with John McCarthy, which occurred during an AI-workshop in Edinburgh , where Michie affirmed McCarthy to take the challenge by David Levy and even want to share the bet on McCarthy's site . 

Autômato capaz de executar com precisão a fase final de uma partida de xadrez, construído em 1912 por Leonardo Torres y Quevedo. 

In 1912, Zermelo proved the determinism of games like chess and that rational players were able to utilize all information to develop an optimal strategy. Zermelo's theorem is the mathematical justification for the retrograde analysis chess algorithm.

was a Soviet and Israeli mathematician, computer scientist and computer chess pioneer, most famous for inventing the AVL tree along with Evgenii Landis, and as co-author of the ITEP Chess Program and Kaissa. Adelson-Velsky and his fellow Alexander Kronrod were the last students of Nikolai Luzin at Moscow State University, where he graduated in 1949 under Israel Gelfand on Spectral Analysis of Ring of Bounded Linear Operators. 

In the 90s, Adelson-Velsky emigrated to Israel and lived in Ashdod, at times affiliated with the Technion, and Mathematics & Computer Science department of Bar-Ilan University . Georgy Adelson-Velsky died on April 26, 2014, aged 92, in Givatayim, Israel. 

Mac Hack VI, also called Mac Hack, MacHack VI and the Greenblatt Chess Program, was a chess program, developed in 1966 and 1967 at MIT by Richard Greenblatt assisted by Donald Eastlake for a DEC PDP-6. It was developed entirely in MIDAS, the PDP-6 macro assembler. The Greenblatt Chess Program was the first computer program to play chess in human tournament competitions and be granted a chess rating 

was a German born, American Computer Scientist and Professor Emeritus from Carnegie Mellon University, Pittsburgh, Pennsylvania. Hans Berliner was Grandmaster of Correspondence Chess, International Master for over-the-board chess and was Correspondence Chess World Champion from 1965 until 1968. 

Hans Berliner made his Ph.D. Thesis in 1974 at Carnegie Mellon about computer chess: Chess as Problem Solving: The Development of a Tactics Analyser under the supervision of Allen Newell. Berliner contributed as co-author to the Technology Chess Program. He was author of the chess programs J. Biit, CAPS, Patsoc, along with Murray Campbell co-author of the chunking pawn endgame program Chunker, and lead the team in developing the HiTech chess entity - namely Carl Ebeling, Murray Campbell, Gordon Goetsch and Chris McConnell. Beside other things, Hans Berliner's research was about pattern knowledge and creation and implementation of the best-first tree search algorithm called B* , also used in HiTech. 

an American mathematician and researcher at the Lawrence Livermore National Laboratory. Harry was the Cray Assembly Language (CAL) expert and along with Robert Hyatt and Albert Gower co-author of Cray Blitz, the two-time winner of the World Computer Chess Championship. Along with David Slowinski, Harry Nelson discovered the 27th Mersenne prime in 1979.. 

was an American scientist and artificial intelligence pioneer, economist, psychologist, and professor, most notably, at Carnegie Mellon University, which became an important center of AI and computer chess, associated with names like Hans Berliner, Carl Ebeling, Feng-hsiung Hsu, Murray Campbell and the computers HiTech and Deep Thought. Herbert Simon received many top-level honors, most notably the Turing Award (with Allen Newell) (1975) for his AI-contributions and the Nobel Memorial Prize in Economics for his pioneering research into the decision-making process within economic organizations (1978) . 

 a chess entity (special purpose hardware + software) by Hans Berliner and a crew of assorted experts at Carnegie Mellon University in Pittsburgh - Carl Ebeling, Murray Campbell, Gordon Goetsch, Andrew James Palay and later Andy Gruss, Larry Slomer and Chris McConnell. Move generation and pattern recognition for evaluation purposes was done in hardware - With 64 chips in parallel. Search algorithm was either alpha-beta as well as B* (ACM 1993). 

an early Soviet chess program, developed since 1961 at Alexander Kronrod’s laboratory at the Moscow Institute of Theoretical and Experimental Physics (ITEP) by Georgy Adelson-Velsky, Vladimir Arlazarov, Anatoly Uskov, Alexander Zhivotovsky, A. Leman, M. Rozenfeld and Russian chess master Alexander Bitman, to run under the Soviet M-20 computer. According to the description of the Russian Virtual Computer Museum, the ITEP Chess Program was developed for the M-2, which seems wrong since all primary sources mention the Chess Program was written for the M-20. 

an American computer scientist and cryptographer from RAND Corporation. He graduated from Carnegie Mellon University in 1978, receiving a Ph.D. in computer science. His thesis Performance Analysis of the Technology Program was advised by Allen Newell. James Gillogly was the primary author of the The Technology Chess Program, which was the predecessor of all modern chess programs, using a Shannon Type A Strategy. In 1970, Tech was written in BLISS, a system programming language developed at Carnegie Mellon, and in 1977 ported to C. Gillogly further authored the Fortran chess player dubbed MAX, and along with Samuel Fuller and John Gaschnig, analyzed the alpha-beta algorithm.

was an American experimental physicist and electrical engineer, Ph.D. in physics from Northwestern University, and affiliated with the Bell Laboratories. Along with Ken Thompson, Joe Condon was creator of the chess entity Belle, the winner of the 3rd World Computer Chess Championship 1980 in Linz. Joseph Henry Condon died on January 2, 2012 at the age of 76. 

a Hungarian-born American mathematician. Beside his contributions in a vast range of fields, he was a pioneer in game-theory and computer science and specially noted for the computer architecture with a single storage for instructions and data.

the famous chess program developed from 1970 at the Moscow Institute of Control Sciences by a group of researchers around Mikhail Donskoy and authors of the former ITEP Chess Program. In 1972 it was named after the goddess of chess Caissa and won the 1st World Computer Chess Championship 1974 in Stockholm, where it ran on an IBM 360 compatible ICL 4/70. Kaissa was a quite sophisticated program for that time. It was a Shannon Type A program, using Bitboards for the internal board representation and advanced search techniques, notably already the idea of null move pruning.. 

an American computer scientist and pioneer. Beside other things, best known for his contributions at the Bell Laboratories in creating the Unix operating system together with Dennis Ritchie, in 2011 awarded with the Japan Prize for their contribution. 

Along with Joe Condon, Ken Thompson was creator of the chess entity Belle, the winner of the 3rd World Computer Chess Championship 1980 in Linz. From the mid 70s until 2000, Ken Thompson worked on creating Endgame Databases of up to six pieces. 

a German engineer and computer pioneer. His greatest achievement was the world's first functional program-controlled Turing-complete computer, the Z3, in 1941. Between 1943 and 1945 Zuse designed the high-level programming language Plakalkul, first published about in 1948. Since 1941 Zuse worked on chess playing algorithms and formulated program routines in Plankalkül in 1945. 

His Calculating Space started the field of Digital Physics in 1969, later popularized and extended by Edward Fredkin, Jurgen Schmidhuber and Stephen Wolfram. 

also known as "A Chess Playing Program for the IBM 7090 Computer" was the first computer program to play chess convincingly. Between 1959 and 1962, while student of John McCarthy at the Massachusetts Institute of Technology, Alan Kotok and his fellows Elwyn Berlekamp, Michael A. Lieberman, Charles Niessen and Robert A. Wagner wrote a chess program for the IBM 7090. Based on Alex Bernstein's 1957 program and routines by McCarthy and Paul W. Abrahams, they added alpha-beta pruning to minmax, at McCarthy's suggestion. The Kotok-McCarthy-Program was written in Fortran and FAP, the IBM 7090 macro assembler.. 

an American computer scientist, former chess programmer and consultant. Along with Keith Gorlen (1968), David Slate (1969) and CDC Cyber hardware consultant David Cahlander, Larry Atkin was the initial author of the Northwestern University's program Chess, which almost dominated computer chess during the 70s in the United States. Larry Atkin further was lead programmer at Odesta aka Helix Technologies and co-creator of the Helix database and is now consultant at QSA Toolworks and various companies.

was an Spanish engineer and mathematician, influenced by the work of the English mathematician Charles Babbage (1791-1871) and his analytical engine. Torres was most famous for the Aero Cable Car on the Canadian side of the Niagara River and analogue calculating machines. 

In 1910 he began (other sources state 1890, or 1901) to construct a chess automaton, El Ajedrecista (The Chessplayer). In 1912 it was able to automatically play a white king and rook against the black king. A second, mechanical but not algorithmic improved El Ajedrecista was built by Leonardo Torres Quevedo's son Gonzalo in 1922, under the direction of his father. At the 1951 Paris Cybernetic Congress the advanced machine was introduced to a greater audience and explained to Norbert Wiener 

Tudo começou em 1968, com uma simples aposta. Um campeão escocês de xadrez de 23 anos, David Levy, estava em uma festa que tinha como anfitrião Donald Michie, fundador do Departamento de Inteligência Artificial da Universidade de Edimburgo. Levy estava justamente conversando com o inventor do termo “inteligência artificial”, o acadêmico americano John McCarthy.

O pesquisador britânico Donald Michie afirmou que o xadrez era a “drosophilamelanogaster da Inteligência Artificial” — a drosophilamelanogaster é uma espécie de mosca que ajudou a criar padrões para pesquisas da evolução, considerada uma “espécie modelo”. 

Chess program developed in 1947-1948 by Donald Michie and Shaun Wylie which was a rival "paper machine" of Alan Turing's and David Champernowne's Turochamp. Turing began programming both at University of Manchester but never completed them and they never played each other. 

In their 1961 article Machines that play games, John Maynard Smith and Donald Michie elaborate the evaluation features of their one-ply analyzers SOMA and Machiavelli, to consider material, center and neighboring king square control, pieces en-prise, swap-off values and other tactical and strategical considerations. Later, John Maynard Smith built a SOMA-Machiavelli hybrid named SOMAC (SOMA with features taken from the Machiavelli). This machine, when allowed a lookahead of two, has a standard of play equal to that of a mediocre human player. 

the chess program on a MANIAC I (Mathematical Analyzer, Numerical Integrator, and Computer or Mathematical Analyzer, Numerator, Integrator, and Computer), the machine designed and build by a team around John von Neumann and Nicholas Metropolis at the Los Alamos Scientific Laboratory. The MANIAC I chess program was written in 1956 by a group of H-bomb researchers, Stanislaw Ulam, Paul Stein, Mark Wells, James Kister, William Walden and John Pasta. Due to lack of computing power, only a chess variant with a reduced 6 x 6 board was implemented, without bishops, double-step for pawns and castling , later called Los Alamos Chess.

was the very first chess playing program running on a general-purpose computer, developed in 1951 by Dietrich Prinz to solve a restricted set of mate-in-two problems. It ran on a Ferranti Mark 1, the world's first commercially available general-purpose electronic computer, which was based on the Manchester Mark 1, developed at University of Manchester.  

1878 - Charles Gumpel 

was a Russian computer scientist and chess programmer. He studied at the Institute of Theoretical and Experimental Physics, where his teachers include Alexander Kronrod and Georgy Adelson-Velsky, and was also affiliated with the Moscow State University where he had to appeal professor Mikhail R. Shura-Bura with his programming skills. By 1971, Mikhail Donskoy joined with Vladimir Arlazarov and Anatoly Uskov to program the successor of the ITEP Chess Program on an ICL 4/70 at the Institute of Control Sciences, calledKaissa, which became the first World Computer Chess Champion in 1974 in Stockholm. The development of Kaissa was accompanied by Georgy Adelson-Velsky, Vladimir Arlazarov, Anatoly Uskov and Alexander Bitman. 

From 1982 Mikhail Donskoy was the chief system programmer for the INES DBMS, the INES archive system original programmer. Since 1989 he was leader of the programmers group later growing into DISCo (Donskoy's Interactive Software Company). Mikhail Donskoy died at age 60 

was an American mathematician and founder of cybernetics. From 1919 until 1960, Wiener was professor at MIT. In his 1948 book Cybernetics or Control and Communication in the Animal and the Machine, he describes how a chess program could be developed using a depth-limited minimax search with an evaluation function.

NSS Chess Program, (Newell, Shaw, and Simon, also mentioned as Newell CP)
an early chess program developed in the the late 1950s by Carnegie Mellon University researchers Allen Newell and Herbert Simon, and Cliff Shaw at RAND Corporation. NSS ran on the JOHNNIAC (short for John v. Neumann Numerical Integrator and Automatic Computer), and was written in a high-level language developed by Shaw, known as Information Processing Language (IPL). It already used branch-and-bounds as an approximation to the alpha-beta algorithm.

1769 - Wolfgang von Kempelen

was an American mathematician, chess player, and computer chess pioneer. While affiliated with IBM in the 50s, along with his colleagues Michael de V. Roberts, Timothy Arbuckle and Martin Belsky, he was primary author of The Bernstein Chess Program for the IBM 704, which was the first complete chess program in history. 

an American computer programmer, along with Bill Gosper considered the co-founder of the hacker community. At MIT, working for the Project MAC (Machine-Aided Cognition), he was the main implementor of Maclisp on the PDP-6 and co-developer of the ITS (Incompatible Timesharing System), the operating system on which MacLisp was developed. 

Richard Greenblatt was primary author of Mac Hack (The Greenblatt Chess Program) in 1966 and 1967, and along with Tom Knight main designer of the MIT Lisp machine. In 1978 Mac Hack got adapted to the Chess-orientated Processing System CHEOPS, one of the first dedicated hardware approaches in computer chess. 

In 1979, Greenblatt founded Lisp Machines, Inc. to build and sell Lisp machines, competing with Symbolics, a company founded by his former MIT AI Lab fellows around Russell Noftsker, Tom Knight and Jack Holloway. Lisp Machines, Inc. went bankrupt in 1987. 

an American computer scientist, computer chess researcher, chess programmer, acknowledged computer chess authority, and associate professor at Faculty of Computer and Information Sciences, University of Alabama at Birmingham, since September 2016 officially retired from UAB. Bob Hyatt is one of the most active researchers in computer chess, being involved from 1968 until the present. He holds a Master of Science from University of Southern Mississippi in 1983 with a thesis on Cray Blitz, and a Ph.D. from UAB in 1988 on the topic of parallel search. 

His engine Crafty was the strongest open source engine for many years in the 90's and early 00's. He was primary author of Blitz and Cray Blitz, the two-time winner of the World Computer Chess Championship, the WCCC 1983 and the WCCC 1986. Beside research and publications on parallel search, transposition table, time management and book learning, Bob is inventor of rotated bitboards. He is active poster in Computer Chess Forums, served as moderator of CCC, and as member of the Secretariat of ICGA Investigations. 

was a British mathematician and along with Alan Turing a World War II codebreaker at Bletchley Park, contributing to crack the German Enigma machine and along with Jack Good and Donald Michie et al. in the section Newmanry headed by Max Newman to crack the Lorenz cipher.. 

a Polish mathematician, known for his participation in the Manhattan Project , the Teller-Ulam design of thermonuclear weapons and the Fermi–Pasta–Ulam experiment. A group of H-bomb researchers at Los Alamos National Laboratory around Stanislaw Ulam, Paul Stein, Mark Wells and John Pasta developed the chess-playing program for the MANIAC I by John von Neumann and Nicholas Metropolis. It played Los Alamos Chess on a 6×6 board without bishops.

abbreviated Tech, was one of the predecessors of modern chess programs, using a Shannon Type A Strategy. In 1970 Tech was written in BLISS, a system programming language developed at Carnegie Mellon University, and in 1977 ported to C. Primary Author was James Gillogly from Carnegie Mellon. Hans Berliner helped in developing the positional analysis (evaluation). The basic idea of the Tech program is due in large part to Allen Newell. In 1978 Gillogly wrote his Ph.D. Thesis about the performance analysis of Tech. Tech competed at three ACM North American Computer Chess Championships, and was two times runner-up at ACM 1971 and ACM 1972.

was the first complete chess program, developed around 1957 at Service Bureau Corporation, Madison & 59th Street, Manhattan, New York City , by chess player and programmer at IBM, Alex Bernstein with his colleagues Michael de V. Roberts, Timothy Arbuckle and Martin Belsky, supported by chess advisor Arthur Bisguier, who became IBM employee at that time and in 1957 international chess grandmaster, and supervised by Nathaniel Rochester. Pamela McCorduck, who was married to Joseph F. Traub, interviewed Alex Bernstein as published with several details given on the development of the program in her seminal book Machines Who Think .

a Hungarian mechanical and electrical engineer, pioneer in electronics and cybernetics, inventor, designer and developer of phones, frequency analysis devices, typewriter that reacted to the human voice, logical machines like Jevons' logical piano, moving robots, computers, and chess machines. He experimented with television as early as 1930, and designed and constructed an electro-mechanical chess machine in 1949.

Chess program by Alan Turing and David Champernowne developed in 1948 as chess playing algorithm, implemented as "paper machine". Since there was no machine yet that could execute the instructions, Turing acted as a human CPU requiring more than half an hour per move. One game from 1952 is recorded, which Turochamp lost to one of Turing's colleagues, Alick Glennie. It won an earlier game versus Champernowne's wife, a beginner at chess. 

Turochamp incorporated important methods of evaluation, and also the concepts of selectivity and dead position, despite it is unclear how this was "implemented" in the game playing experiments. Champernowne later said 'they were a bit slapdash about all this and must have made a number of slips since the arithmetic was extremely tedious with pencil and paper'. In a CCC forum post, Frederic Friedel mentioned a search depth of up to three plies 

Século V da era cristã