Wikispaces : chessprogramming - items matching description

Alan Turing

GerdIsenberg — Wed, 08 Feb 2017 17:00:25 GMT

Home * People * Alan Turing

		Alan Mathison Turing, (23 June 1912–7 June 1954) was an English mathematician, logician, and cryptographer. Alan Turing was based at Bletchley Park ^[1], 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 ^[2] ^[3] ^[4] ^[5] ^[6], and to crack the Lorenz cipher (codenamed "Tunny") ^[7]. 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 ^[8].
Alan Turing ^[9]

Photos

Ratio Club at Cambridge 1952, Giles Brindley (yellow), Donald MacKay (red), Alan Turing (green) ^[10]

Turing Machine

Turing machines are abstract symbol-manipulating devices which can be adapted to simulate the logic of any computer algorithm, described in 1936 by Alan Turing ^[11] , as thought experiment about the limits of mechanical computation. An example of a concrete Turing machine is the Busy beaver ^[12] .

The Universal Turing machine can simulate an arbitrary Turing machine on arbitrary input, and can be considered as the origin of the John von Neumann architecture. A universal Turing machine can calculate any recursive function, decide any recursive language, and accept any recursively enumerable language. According to the Church-Turing thesis, the problems solvable by a universal Turing machine are exactly those problems solvable by an algorithm or an effective method of computation, for any reasonable definition of those terms. For these reasons a system that can simulate a universal Turing machine is called Turing complete.

Turing Test

Turing addressed the problem of artificial intelligence, and proposed an experiment now known as the Turing test, an attempt to define a standard for a machine to be called "intelligent" ^[13] ^[14] .

Chess and Go

Alan Turing used chess-playing as an example of what a computer could do. Along with David Champernowne he specified a chess playing algorithm, implemented as "paper machine" dubbed Turochamp. Since there was no machine yet that could execute the instructions, he did himself, acting as a human CPU requiring more than half an hour per move. One game is recorded, which Turing's "paper machine" lost to one of his colleagues ^[15], Alick Glennie. At the University of Manchester, Turing began programming Turochamp, as well as Michie's and Wylie's program Machiavelli, to run on a Ferranti Mark 1 computer, but could not complete them ^[16].

Could one make a machine?

In his 1953 paper 'Chess' in Bowden's Faster Than Thought ^[17] , Turing asks some questions, answered and discussed them, mentioning evaluation features, the concepts of minimax strategy, variable look-ahead, quiescence and learning. He does not explicitly mention the name Turochamp, but the 'Machine', and its game versus a human ^[18] ^[19] .

When one is asked 'Could one make a machine to play chess?', there are several possible meanings which might be given to the words. Here are a few:

Could one make a machine which would obey the rules of chess, i.e. one which would play random legal moves, or which could tell one whether a given move is a legal one?
Could one make a machine which would solve chess problems, e.g. tell one whether, in a given position, white has a forced mate in three?
Could one make a machine which would play a reasonable good game of chess, i.e. which, confronted with an ordinary (that i, not particularly unusual) chess position, would after two or three minutes of calculation, indicate a passably good legal move?
Could one make a machine to play chess, and to improve its play, game by game, profiting from its experience?

To these we may add two further questions, unconnected with chess, which are likely to be on the tip of the reader's tongue.

Could one make a machine which would answer questions put to it, in such a way that it would not be possible to distinguish its answers from those of a man?
Could one make a machine which would have feelings like you and I do?

Andrew Hodges

Andrew Hodges in the Alan Turing Scrapbook - the Origins of Artificial Intelligence ^[20] :

Alan Turing talked at Bletchley Park with his younger colleague Jack Good about what we would now call chess-playing programs. They got the idea of searching decision trees for the best move.

Turing knew the game of Go as early as 1936: in fact he explained it to Christopher Morcom's mother shortly before he left for America. At Bletchley Park he showed the game to others including Jack Good. According to the British Go Association's page it was Good who twenty years later popularised the game in Britain.

In the later years of the war, he talked with a young student, Donald Michie, about the prospect of machines 'learning.' In other conversations he talked about 'building a brain.' It seems that it was during the war that he came to the view that anything done by the brain must be a computable operation, and so could be simulated by a Turing machine.

Turing's post-war ideas reflected the discussions he had enjoyed during the wartime period. After 1945 he often used chess-playing as an example of what a computer could do, and in his 1946 report on the possibilities of a computer, made his first reference to machine 'intelligence' in connection with chess-playing. In 1948 he met Donald Michie again and competed with him in writing a simple chess-playing algorithm.

Jack Good

Jack Good in 1998 ^[21]:

In letters to Turing, on September 16 and October 3, 1948, I mentioned the idea of resonance circuits in the brain; especially as a method for noticing analogies... In the postscript I discussed chess-playing machines, which he and I had discussed in 1941, and gave a reasonable definition of a forced variation. I took for granted the need to distinguish between quiescent and non-quiescent positions. Shannon's paper on chess appeared in 1950.

Punishment and Death

Turing was just 41 years old when he committed suicide, two years after undergoing a court-ordered chemical castration. He had been found guilty of gross indecency for having a homosexual relationship. The punishment in 1952 was either a prison sentence or chemical castration. Turing chose the latter. In September 2009 the British government has issued a formal apology for the way Alan Turning was treated ^[22] ^[23] .

Selected Publications

^[24]

1936 ...

Alan Turing (1936). On computable numbers, with an application to the Entscheidungsproblem. pdf

1940 ...

Alan Turing (1949). Alan Turing's Manual for the Ferranti Mk. I. transcribed in 2000 by Robert Thau, pdf from The Computer History Museum

1950 ...

Alan Turing (1950). Computing Machinery and Intelligence. Mind, 59, 433-460. pdf from The Computer History Museum
Alan Turing (1951). Programmers' Handbook for the Manchester Electronic Computer Mark II. 1st edition
Alan Turing (1952). Programmers' Handbook for the Manchester Electronic Computer Mark II. 2nd edition, revised by R.A. Brooker ^[25]
Alan Turing (1953). Chess. part of the collection Digital Computers Applied to Games. in Bertram Vivian Bowden (editor), Faster Than Thought, a symposium on digital computing machines, reprinted 1988 in Computer Chess Compendium, reprinted 2004 in Chapter 16 of The Essential Turing ... ^[26]

1990 ...

Edward Feigenbaum (1996). How the “What“ Becomes the “How“. Communications of the ACM, Vol. 39, No. 5, pdf hosted by The Computer History Museum

2000 ...

Jack Good (2000). Turing’s anticipation of emprical Bayes in connection with the cryptanalysis of the naval enigma. Journal of Statistical Computation and Simulation, Vol. 66, No. 2 ^[27] ^[28] ^[29]
Alan Turing, B. Jack Copeland (editor) (2004). The Essential Turing, Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma. Oxford University Press, amazon, google books

2010 ...

B. Jack Copeland, Diane Proudfoot (2011-2012). Turing, Father of the Modern Computer. The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology, Vol. 4 » with photos of Alan Turing, John von Neumann, Dietrich Prinz, Christopher Strachey, Jack Good, Arthur Samuel, Herbert Simon, Allen Newell, ...
Andrew Appel (ed.) (2012). Alan Turing's Systems of Logic: The Princeton Thesis. Princeton University Press
Guy McCrossan Haworth (2013). Turing, Kasparov and the Future. ICGA Journal, Vol. 36, No. 1 » Turochamp
Kieran Greer (2014). Turing: Then, Now and Still Key. arXiv:1403.2541

Forum Posts

How did Alan Turing's program work? by Pete Galati, CCC, April 20, 2000
Finally Science Meets Computer Chess XI (Turing) by Phil Innes, rgcc, November 11, 2001

External Links

Alan Turing from Wikipedia
Alan Turing - Wikiquote
Turing Award from Wikipedia by the ACM
Alan Turing from enigma wiki
The Mind and the Computing Machine edited by B. Jack Copeland, from The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology
Alan Turing by Jürgen Schmidhuber
Turing letter to W. Ross Ashby from William Ross Ashby's Digital Archive
Alan Turing from The Computer History Museum
Computer und Schach: "Die goldene Gans, die niemals schnattert" by André Schulz, Spiegel Online, November 12, 2003 (German) ^[30]
Alan Turing by André Schulz, June 07, 2004, ChessBase Nachrichten (German)
Alan Turing: "I am building a brain." Half a century later, its successor beat Kasparov by Professor S. Barry Cooper, The Northerner | UK news, guardian.co.uk
Alan Turing: why the tech world's hero should be a household name by Vint Cerf, BBC News, June 18, 2012
Alan Turing: Inquest's suicide verdict 'not supportable' by Roland Pease, BBC News, June 23, 2012
Spies and Spymasters > Second World War > Alan Turing from Spartacus Educational
Chess and the Code-Breakers by Edward Winter

Turing Machine

Devices and Computers

Turing Test

Turing Archive

Andrew Hodges

Alan Turing: Primary Sources, notes by Andrew Hodges, author of Alan Turing: the Enigma
Alan Turing - Home Page maintained by Andrew Hodges, author of Alan Turing: the Enigma
The Alan Turing Internet Scrapbook maintained by Andrew Hodges, author of Alan Turing: the Enigma

Literature

Turing Year 2012

Alan Turing Year from Wikipedia
The Alan Turing Year - 2012 Turing Centenary
Eminent & enigmatic - 10 aspects of Alan Turing, the Heinz Nixdorf MuseumsForum, Flyer as pdf including abstracts of lectures
Jürg Nievergelt Known or wanted: chess matches between Man and machine.
Raúl Rojas Turing and Zuse.
Turing Jahr 2012 - Alan Turing Year 2012, Gesellschaft für Informatik e.V (German)
Donald Knuth in Alan Turing Year from I Programmer - programming, reviews and projects, January 10, 2012 » Donald Knuth
Alan Turing Year (alanturingyear) at Twitter
ACM A.M. Turing Centenary Celebration
The Alan Turing Centenary Conference Manchester UK, June 22-25, 2012, hosted by the University in Manchester

Movies

The Strange Life and Death of Dr Turing, BBC TV science series Horizon (1992), YouTube Videos ^[31]
featuring Marvin Minsky, Andrew Hodges, Norman Routledge ^[32], Jack Good, Shaun Wylie, Joan Clarke, Robin Gandy et al.
Breaking the Code (1996) (TV)
Codebreaker (2011) - Channel 4, Official Site
The Imitation Game (2014) - Official Trailer - The Weinstein Company, YouTube Video

References

^ Bletchley Park Museum
^ The plugboard-equipped Enigma machine was already solved in 1932 by Marian Rejewski at Biuro Szyfrów, the Polish General Staff's agency, ongoing development of methods and equipment to exploit Enigma decryption was continued before and during World War II by Jerzy Różycki and Henryk Zygalski
^ Marian Rejewski (1981). How Polish Mathematicians Deciphered the Enigma. IEEE Annals of the History of Computing, pdf
^ Polish Enigma double from Wikipedia
^ Alan Turing - Cryptanalysis from Wikipedia
^ Cryptanalysis of the Enigma from Wikipedia
^ Jack Good, Donald Michie, Geoffrey Timms (1945). General Report on Tunny from The Turing Archive for the History of Computing
^ Alan Turing from Wikipedia
^ © National Portrait Gallery - Portrait - NPG x27078; Alan Mathison Turing by Elliott & Fry, March 29, 1951, Given by Ethel Sara Turing (née Stoney), 1956, Alan Turing from Wikipedia
^ Giles Brindley, Part 2 More To Know About Someone You Should Know, November 01, 2006
^ Alan Turing (1936). On computable numbers, with an application to the Entscheidungsproblem. pdf
^ Busy Beaver by Heiner Marxen
^ Alan Turing (1950). Computing Machinery and Intelligence. Mind, 59, 433-460. pdf from The Computer History Museum
^ James H. Moor (2003). The Turing Test: The Elusive Standard of Artificial Intelligence. Kluwer Academic Publishers
^ A short history of computer chess from ChessBase
^ Chronology of Computing compiled by David Singmaster
^ Alan Turing (1953). Chess. part of the collection Digital Computers Applied to Games. in Bertram Vivian Bowden (editor), Faster Than Thought, a symposium on digital computing machines, reprinted 1988 in Computer Chess Compendium, reprinted 2004 in Chapter 16 of Alan Turing, B. Jack Copeland (editor) (2004). The Essential Turing, Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma. Oxford University Press, amazon, google books
^ Anmerkungen zur Programmierung der Turing-Engine by Mathias Feist, ChessBase Spotlights (German, with original article 'Chess' by Alan Turing)
^ Re: How did Alan Turing's program work? by Frederic Friedel, CCC, April 22, 2000
^ Alan Turing Scrapbook - the Origins of Artificial Intelligence by Andrew Hodges
^ Excerpts from Acceptance Speech for the 1998 Computer Pioneers Award from the IEEE - Jack Good hosted by Atlas Computer Laboratory
^ Thousands call for Turing apology, BBC NEWS August 31, 2009
^ Treatment of Alan Turing was “appalling” - PM, Gordon Brown’s statement from Number10.gov.uk, September 10, 2009
^ Janus: The Papers of Alan Mathison Turing
^ Mark 1 Documents from Computer 50 - The University of Manchester Celebrates the Birth of the Modern Computer
^ Anmerkungen zur Programmierung der Turing-Engine by Mathias Feist, ChessBase Spotlights (German, with original article 'Chess' by Alan Turing)
^ Banburismus from Wikipedia
^ Good–Turing frequency estimation from Wikipedia
^ David McAllester, Robert Schapire (2000). On the Convergence Rate of Good-Turing Estimators. COLT 2000, CiteSeerX
^ New Chessbase Engine called "Turing" by Ingo Bauer, CCC, November 12, 2003
^ The Strange Life and Death of Dr Turing from The Computer History Museum
^ Mathematician Norman Routledge on Alan Turing, Scientific Computing, July 09, 2012

What links here?

Page	Date Edited
Alan Turing	Feb 8, 2017
Andrew Appel	Feb 9, 2017
Arthur Guez	Dec 6, 2017
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Barbara Liskov	Oct 30, 2014
BitScan	Sep 10, 2017
Chess	Jan 21, 2018
Christopher Strachey	May 8, 2017
Computer Chess Compendium	Dec 29, 2015
David Champernowne	Mar 29, 2016
Dietrich Prinz	Oct 14, 2016
Donald Knuth	Aug 29, 2016
Donald Michie	Dec 23, 2017
Edward Feigenbaum	Jan 3, 2016
Eliot Slater	Aug 6, 2016
Enigma	Feb 9, 2015
Evaluation	Feb 1, 2018
Ferranti Mark 1	Jun 2, 2015
Frédéric Prost	Oct 16, 2014
Games	Feb 20, 2018
Georgy Adelson-Velsky	Apr 9, 2018
Guy Haworth	Nov 20, 2017
Heinz Nixdorf MuseumsForum	Sep 6, 2015
History	Jan 2, 2018
ICGA Journal	Dec 21, 2017
Jack Good	Dec 22, 2017
John von Neumann	May 8, 2017
Jos Uiterwijk	Aug 11, 2017
Jürgen Schmidhuber	Feb 3, 2018
Kaissa	Apr 9, 2018
Kathe Spracklen	Dec 25, 2017
Kieran Greer	Nov 7, 2014
Konrad Zuse	Apr 30, 2015
La Dame Blanche	Oct 15, 2015
Learning	Feb 20, 2018
Machiavelli	Jun 2, 2015
Manuela Veloso	Aug 5, 2015
Match Statistics	Mar 31, 2018
Material	Mar 31, 2018
Mathematician	Apr 9, 2018
Mobility	Jan 17, 2018
Neural Networks	Mar 12, 2018
People	Feb 28, 2018
Point Value	Mar 31, 2018
Population Count	Sep 3, 2017
Quote McCarthy	Sep 10, 2013
Shaun Wylie	Jun 2, 2015
SOMA	Mar 25, 2015
Turochamp	Dec 14, 2017
University of Manchester	May 24, 2017

Up one level

Alex Bernstein

GerdIsenberg — Sat, 02 Jan 2016 15:53:00 GMT

Home * People * Alex Bernstein

		Alex Bernstein, an American mathematician, chess player and IBM employee. Along with his colleagues Michael de V. Roberts, Timothy Arbuckle and Martin Belsky, Alex Bernstein was primary author of the Bernstein Chess Program for the IBM 704.
Alex Bernstein ^[1]

Quotes

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 ^[2]:

Chess programs catch some of the human chess playing abilities but rely on the limited effective branching of the chess move tree. The ideas that work for chess are inadequate for go. Alpha-beta pruning characterizes human play, but it wasn't noticed by early chess programmers - Turing, Shannon, Pasta and Ulam, and Bernstein. We humans are not very good at identifying the heuristics we ourselves use. Approximations to alpha-beta used by Samuel, Newell and Simon, McCarthy. Proved equivalent to minimax by Hart and Levin, independently by Brudno. Knuth gives details.

Publications

Alex Bernstein, Michael de V. Roberts (1958). Computer vs. Chess-Player. Scientific American, Vol. 198, pp. 96-105. pdf from The Computer History Museum, reprinted 1988 in Computer Chess Compendium
Alex Bernstein (1958). A Chess Playing Program for the IBM 704. Chess Review July 1958, pdf from The Computer History Museum
Alex Bernstein, Michael de V. Roberts, Timothy Arbuckle, Martin Belsky (1958). A chess playing program for the IBM 704. Proceedings of the 1958 Western Joint Computer Conference, pp. 157-159, Los Angeles, California. pdf from The Computer History Museum

External Links

Alex Bernstein from The Computer History Museum
Photos by Andreas Feininger, Getty Images
Chess Pieces - IBM Research the Deep Blue site
Alex Bernstein: juega al ajedrez con un IBM 704 (Thinking Machines) YouTube Video

References

^ Image captured from Alex Bernstein: juega al ajedrez con un IBM 704 (Thinking Machines) YouTube Video at 0:13
^ John McCarthy Human-Level AI is harder than it seemed in 1955

What links here?

Page	Date Edited
Alex Bernstein	Jan 2, 2016
Chess	Jan 21, 2018
Computer Chess Compendium	Dec 29, 2015
Entering Moves	Sep 7, 2017
History	Jan 2, 2018
IBM 704	Jan 2, 2016
Martin Belsky	Jul 25, 2016
Michael de V. Roberts	Jan 2, 2016
Nathaniel Rochester	Oct 26, 2016
People	Feb 28, 2018
Quote McCarthy	Sep 10, 2013
Scientific American	Jun 5, 2017
The Bernstein Chess Program	Jan 2, 2016
Timothy Arbuckle	Oct 30, 2013
Type B Strategy	Jul 19, 2016

Up one level

Alexander Brudno

GerdIsenberg — Mon, 09 Apr 2018 18:46:59 GMT

Home * People * Alexander Brudno

		Alexander L'vovich Brudno, (Александр Львович Брудно, January 10, 1918 – December 1, 2009) was a Russian Jewish mathematician, computer scientist and computer chess pioneer. He received his Ph.D. on Real functions at Moscow State University under advisor Dmitrii Menshov ^[1]. Brudno independently discovered the alpha-beta algorithm, published 1963 in Problemy Kibernetiki ^[2] . The algorithm was implemented inside the ITEP Chess Program ^[3], which was written by Georgy Adelson-Velsky and others at Alexander Kronrod's laboratory at Moscow’s Institute of Theoretical and Experimental Physics (ITEF or ITEP). Brudno, also at ITEP at that time was a personal and likeminded friend of Kronrod ^[4]. According to Monroe Newborn, Alexander Brudno led the team that created the chess program Kaissa at Moscow’s Institute of Control Sciences ^[5]. From 1991 until his death he lived in Israel ^[6].
Alexander Brudno ^[7]

Photos

Quotes

John McCarthy

Ershov and Shura-Bura

Landis and Yaglom

Mikhail Donskoy

See also

Selected Publications

External Links

References

What links here?

Photos

Alexander Brudno in Moscow, 1980 ^[8]

Quotes

John McCarthy

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 ^[9]:

Ershov and Shura-Bura

Quote from The Early Development of Programming in the USSR by Andrey Ershov, Mikhail R. Shura-Bura ^[10]

At the end of the 1950's a group of Moscow mathematicians began a study of computerized chess. Sixteen years later, the studies would lead to victory in the first world chess tournament for computer programs held in Stockholm during the 1974 IFIP Congress. An important component of this success was a deep study of the problems of information organization in computer memory and of various search heuristics. G. M. Adelson-Velsky and E. M. Landis invented the binary search tree ("dichotomic inquiry") and A. L. Brudno, independent of J. McCarthy, discovered the (α,β)-heuristic for reducing search times on a game tree.

Landis and Yaglom

Quote from Remembering A.S. Kronrod by Evgenii Landis and Isaak Yaglom ^[11]:

Only in 1955 did a real opportunity arise for A.S. Kronrod to work with an electronic computer. It was the M2 computer constructed by I.S. Bruk, M.A. Kartsev, and N.Ya. Matyukhin in the laboratory of the Institute of Energy named after Krzhizhanovsky and directed by I.S. Bruk. This laboratory later became the to Institute for Electronic Control Machines. The mathematics/machine interface was developed by A.L. Brudno, a great personal and likeminded friend of A.S. Kronrod.

When he started with enthusiasm to program the M2 machine, A.S. Kronrod quickly came to the conclusion that computing is not the main application of computers. The main goal is to teach the computer to think, i.e., what is now called "artificial intelligence" and in those days "heuristic programming".

A.S. Kronrod captivated a large group of mathematicians and physicists (G.M. Adelson Velsky, A.L. Brudno, M.M. Bongard, E.M. Landis, N.N. Konstantinov, and others). Although some of them had arrived at this kind of problems on their own, they unconditionally accepted his leadership. In the room next to the one housing the M2 machine the work of the new Kronrod seminar started. At the gatherings there were heated discussions on pattern recognition problems (this work was led by M.M. Bongard; versions of his program "Kora" are still functioning), transportation problems (the problem was introduced to the seminar and actively worked on by A.L. Brudno), problems of automata theory, and many other problems.

Mikhail Donskoy

Quote from Mikhail Donskoy's life cycle of a programmer ^[12]:

When I was in high school I learned to program on the M-20 ... In the group of programmers at Institute of Theoretical and Experimental Physics, where computing work was done on nuclear physics on the M-20, they came up with arrays, lists, the need for subroutines and more. One of my teachers, Georgy Adelson-Velsky came up with a hash memory. Details can be found in another of my teachers - Alexander Kronrod "Conversations about programming". Even before Dijkstra's basic principles of structured programming was known, Alexander Brudno published the book "Programming in meaningful notation." There was also created the first chess program ... The chess program ITEP, the predecessor of Kaissa fit in memory of M-20, namely in 4096 cells, each of which has a 48-bit ...

Selected Publications

Alexander Brudno (1963). Bounds and valuations for shortening the search of estimates. Problemy Kibernetiki (10) 141–150 and Problems of Cybernetics (10) 225–241
Alexander Brudno (1968). Programming in meaningful notation. Second edition, revised (Программирование в содержательных обозначениях) ^[13]
Alexander Brudno, L.I. Kaplan (1990). Moscow Programming Contest. (Московские олимпиады по программированию) Popular scientific publication

External Links

References

^ The Mathematics Genealogy Project - Aleksandr Brudno
^ Alexander Brudno (1963). Bounds and valuations for shortening the search of estimates. Problemy Kibernetiki (10) 141–150 and Problems of Cybernetics (10) 225–241
^ The Fast Universal Digital Computer M-2 from the Russian Virtual Computer Museum
^ Evgenii Landis, Isaak Yaglom (1987). Remembering A.S. Kronrod. (2002). Translation by Viola Brudno, Edited by Walter Gautschi, ps
^ Brudno in Moscow, Photo and text by Monroe Newborn 1980, History of Computer Chess from The Computer History Museum
^ Alexander Brudno from Wikipedia
^ Alexander Brudno from Wikipedia
^ Brudno in Moscow, Photo by Monroe Newborn 1980, History of Computer Chess from The Computer History Museum
^ John McCarthy Human-Level AI is harder than it seemed in 1955
^ Andrey Ershov, Mikhail R. Shura-Bura (1980). The Early Development of Programming in the USSR. in Nicholas C. Metropolis (ed.) A History of Computing in the Twentieth Century. Academic Press, preprint pp. 44
^ Evgenii Landis, Isaak Yaglom (1987). Remembering A.S. Kronrod. (2002). Translation by Viola Brudno, Edited by Walter Gautschi, ps
^ Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ (Russian) Mikhail Donskoy - The life cycle of a programmer translated by Google Translate, polit.ru August 20, 2008
^ Брудно Александр Львович (Russian, Alexander L. Brudno translated by Google Translate

What links here?

Page	Date Edited
Alexander Brudno	Apr 9, 2018
Alexander Kronrod	Apr 9, 2018
Allen Newell	Jun 12, 2017
Alpha-Beta	Jan 28, 2018
Arthur Samuel	May 29, 2016
David Bronstein	Oct 28, 2014
Georgy Adelson-Velsky	Apr 9, 2018
Herbert Simon	Feb 11, 2016
Institute of Control Sciences	Jun 2, 2015
Institute of Theoretical and Experimental Physics	Sep 8, 2015
ITEP Chess Program	Apr 2, 2014
John McCarthy	Jan 5, 2017
Kaissa	Apr 9, 2018
Mathematician	Apr 9, 2018
Moscow State University	May 20, 2016
People	Feb 28, 2018
Quote Donskoy	Dec 2, 2013
Quote McCarthy	Sep 10, 2013
Quote Remembering Kronrod	Dec 2, 2013
Quote Shura-Bura	Dec 2, 2013
Search	Feb 1, 2018

Up one level

Alexander Kronrod

GerdIsenberg — Mon, 09 Apr 2018 18:45:33 GMT

Home * People * Alexander Kronrod

			Aleksandr (Alexander) Semenovich Kronrod, (October 22, 1921 – October 6, 1986) was a Russian mathematician and computer scientist. Kronrod and his fellow Georgy Adelson-Velsky were the last students of Nikolai Luzin at Moscow State University. In the 50s and 60s Kronrod was professor and head of the Computational Laboratory at Moscows Institute of Theoretical and Experimental Physics (ITEF or ITEP). He was involved in developing the ITEP Chess Program in motivating his friends Georgy Adelson-Velsky and Alexander Brudno, as well in his proposal of a "general recursive search scheme". Kronrod is well known for saying, "chess is the Drosophila of artificial intelligence" ^[1]. In 1965, while John McCarthy visited the Soviet Union, he was challenged by Kronrod, who considered the Kotok-McCarthy-Program to be the best program in the United States at the time. At the end of 1966 the four game match was arranged between Kotok-McCarthy, running on a IBM 7090 computer, and the ITEP Program on a Soviet M-2 ^[2]. The match played over nine months was won 3-1 by the ITEP Program.
	Alexander Kronrod ^[3]

Quotes

Remembering A.S. Kronrod

Intellectual Foundations

Competitions, Controversies, and Computer Chess

What is AI?

Selected Publications

External Links

References

What links here?

Quotes

Remembering A.S. Kronrod

Quote from Remembering A.S. Kronrod by Evgenii Landis and Isaak Yaglom ^[4]:

Intellectual Foundations

Quote from Biography AS Kronrod by Alexander Yershov ^[5]

In 1958, Kronrod, Adelson-Velsky, and Landis selected "Snap" ("подкидного дурака") as the intellectual foundations for the development of the game heuristic programming. The program itself was a fiasco - but the basic principles (board games, search techniques and limited depth) were formulated. Further research laboratories in the field of game theory culminated in the first ever chess duel between the program of the Institute of Soviet and American best program developed at Stanford University under the direction of J. McCarthy. By telegraph match was played in four games ended 3-1 in favor of our institute. At the time, chess became a guinea pig for all programmers interested in artificial intelligence.

Competitions, Controversies, and Computer Chess

Quote from Competitions, Controversies, and Computer Chess ^[6]:

This match has a very sad postscript: Alexander Kronrod, the head of the Computational lab at ITEP, was a highly principled person who, among with many other mathematicians, signed a letter in defense of Esenin-Volpin, a mathematician who was placed in an insane asylum for anti-Communist views. For his signature of the letter Kronrod was reprimanded by the Communist Party. The physicists at ITEP, who were irritated because computer time was “wasted” on game playing instead of their problems used the reprimand as an excuse to oust Kronrod from his position. At the same time Kronrod was fired from his professorship at the Moscow Pedagogical Institute. These actions effectively ended the career of this brilliant mathematician.

What is AI?

Quote by John McCarthy from What is Artificial Intelligence? ^[7] ^[8] ^[9]:

Alexander Kronrod, a Russian AI researcher, said 'Chess is the Drosophila of AI.' He was making an analogy with geneticists' use of that fruit fly to study inheritance. Playing chess requires certain intellectual mechanisms and not others. Chess programs now play at grandmaster level, but they do it with limited intellectual mechanisms compared to those used by a human chess player, substituting large amounts of computation for understanding. Once we understand these mechanisms better, we can build human-level chess programs that do far less computation than do present programs. Unfortunately, the competitive and commercial aspects of making computers play chess have taken precedence over using chess as a scientific domain. It is as if the geneticists after 1910 had organized fruit fly races and concentrated their efforts on breeding fruit flies that could win these races.

Selected Publications

Alexander Kronrod (1965). Nodes and weights of quadrature formulas. Sixteen-place tables. New York: Consultants Bureau ^[10]
Alexander Kronrod (196?). Conversations on Programming.

External Links

References

^ Alexander Kronrod from Wikiquote
^ The Fast Universal Digital Computer M-2 from the Russian Virtual Computer Museum
^ Alexander Kronrod from Wikipedia
^ Evgenii Landis, Isaak Yaglom (1987). Remembering A.S. Kronrod. (2002). Translation by Viola Brudno, Edited by Walter Gautschi, ps
^ Биография А.С. Кронрода, Biography AS Kronrod by Alexander Yershov (translated by Google Translate)
^ Michael Brudno (2000). Competitions, Controversies, and Computer Chess, pdf
^ What is Artificial Intelligence? by John McCarthy
^ John McCarthy (1989). The Fruitfly on the Fly. ICCA Journal, Vol. 12, No. 4
^ John McCarthy (1990). Chess as the Drosophila of AI. Computers, Chess, and Cognition, pp. 227-237
^ Gauss–Kronrod quadrature formula - Wikipedia

What links here?

Page	Date Edited
Alexander Bitman	Jun 2, 2015
Alexander Brudno	Apr 9, 2018
Alexander Kronrod	Apr 9, 2018
Alexander Zhivotovsky	Sep 10, 2013
Anatoly Uskov	Jan 7, 2016
David Bronstein	Oct 28, 2014
Georgy Adelson-Velsky	Apr 9, 2018
Institute of Theoretical and Experimental Physics	Sep 8, 2015
ITEP Chess Program	Apr 2, 2014
John McCarthy	Jan 5, 2017
Kaissa	Apr 9, 2018
M-2	Sep 10, 2013
M-20	Oct 9, 2013
Mathematician	Apr 9, 2018
Mikhail Donskoy	Dec 23, 2017
Moscow State University	May 20, 2016
People	Feb 28, 2018
Quote Donskoy	Dec 2, 2013
Quote McCarthy on AI	Sep 10, 2013
Quote Remembering Kronrod	Dec 2, 2013
Quote Yershov	Dec 2, 2013
Stanford-ITEP Match	Apr 9, 2018
Vladimir Arlazarov	May 20, 2016
WCCC 1989	Dec 5, 2017

Up one level

Allen Newell

GerdIsenberg — Mon, 12 Jun 2017 12:10:17 GMT

Home * People * Allen Newell

		Allen Newell, (March 19, 1927 - July 19, 1992) was a American researcher in computer science and pioneer in the field of artificial intelligence and chess software ^[1] at the Carnegie Mellon University, Pittsburgh, Pennsylvania. In 1958, Allen Newell, Cliff Shaw, and Herbert Simon developed the chess program NSS ^[2]. 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 ^[3]. 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.
Allen Newell ^[4]

See also

Selected Publications

Selected Publications

^[5] ^[6]

1955 ...

Allen Newell (1955). The Chess Machine: An Example of Dealing with a Complex Task by Adaptation. Proceedings Western Joint Computer Conference, pp. 101-108. Reprinted (1988) in Computer Chess Compendium
Allen Newell, Herbert Simon (1956). The logic theory machine-A complex information processing system. IRE Transactions on Information Theory, Vol. 2, No. 3
Allen Newell, Cliff Shaw, Herbert Simon (1958). Chess Playing Programs and the Problem of Complexity. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335. Reprinted (1963) in Computers and Thought (eds. Edward Feigenbaum and Julian Feldman), pp. 39-70. McGraw-Hill, New York, N.Y. pdf
Allen Newell, Cliff Shaw, Herbert Simon (1959). Report on a general problem-solving program. Proceedings of the International Conference on Information Processing, pp. 256-264 ^[7]

1960 ...

Allen Newell, Fred M. Tonge (1960). An Introduction to Information Processing Language V. Communications of the ACM, Vol. 3, No 4 ^[8]
Allen Newell, N. S. Prasad (1963). IPL-V Chess Position Program. Internal Memo No. 63, Carnegie Mellon University
Allen Newell (1963). Learning, Generality and Problem Solving. Memorandum RM-3285-1-PR pdf
Allen Newell, Herbert Simon (1965). An Example of Human Chess Play in Light of Chess Playing Programs. In Norbert Wiener, J. P. Schadé (eds.) Progress in Biocybernetics. Vol. 2, Elsevier

1970 ...

Gordon Bell, Allen Newell (1971). Computer Structures: Readings and Examples. McGraw-Hill, ISBN-13: 978-0070043572, amazon
Allen Newell, Herbert Simon (1972). Human Problem Solving. Prentice-Hall
Allen Newell, Herbert Simon (1976). Computer Science as Empirical Inquiry: Symbols and Search. Communications of the ACM, Vol. 19, No. 3, ACM Turing Award Lecture, pdf from The Computer History Museum ^[9]

1980 ...

Allen Newell (1980). Physical Symbol Systems. Cognitive Science, Vol. 4, No. 2
Allen Newell (1982). The Knowledge Level. Artificial Intelligence, Vol. 18, No. 1
John E. Laird, Paul S. Rosenbloom, Allen Newell (1984). Towards Chunking as a General Learning Mechanism. AAAI 1984
John E. Laird, Allen Newell, Paul S. Rosenbloom (1987). SOAR: An Architecture for General Intelligence. Artificial Intelligence, Vol. 33, No. 1

1990 ...

Allen Newell (1990). Unified Theories of Cognition. Harvard University Press
Hans Berliner (1992). Allen Newell 1927-1992, In Memoriam. ICCA Journal, Vol. 15, No. 3
Adriaan de Groot (1992). Allen Newell: An Adieu. ICCA Journal, Vol. 15, No. 3
John E. Laird, Paul S. Rosenbloom (1992). In Pursuit of Mind: The Research of Allen Newell. AI Magazine, Vol. 13, No. 4

External Links

Allen Newell from Wikipedia
The AI Genealogy Project :: Allen Newell
The Mathematics Genealogy Project - Allen Newell
Allen Newell Collection
Allen Newell - Biographical Memoirs from The National Academy Press
Allen Newell from The Computer History Museum
Evolutionary Portrait Art by Günter Bachelier: Alan Newell

References

^ Allen Newell (1955). The Chess Machine: An Example of Dealing with a Complex Task by Adaptation. Proceedings Western Joint Computer Conference, pp. 101-108.
^ Allen Newell, Cliff Shaw, Herbert Simon (1958). Chess Playing Programs and the Problem of Complexity. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335. Reprinted (1963) in Computers and Thought (eds. Edward A. Feigenbaum and Julian Feldman), pp. 39-70. McGraw-Hill, New York, N.Y., pdf
^ John McCarthy Human-Level AI is harder than it seemed in 1955
^ Allen Newell Collection
^ ICGA Reference Database (pdf)
^ dblp: Allen Newell
^ General Problem Solver from Wikipedia
^ Information Processing Language - Wikipedia
^ Physical symbol system from Wikipedia

What links here?

Page	Date Edited
AAAI	Mar 21, 2017
ACM	May 7, 2017
Adriaan de Groot	Oct 6, 2014
Alan Turing	Feb 8, 2017
Allen Newell	Jun 12, 2017
Alpha-Beta	Jan 28, 2018
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Carnegie Mellon University	Feb 12, 2018
Chess	Jan 21, 2018
Christopher Strachey	May 8, 2017
Chunking	Jun 12, 2017
Cliff Shaw	Apr 4, 2014
CMU Chess Program	Oct 6, 2014
Cognition	Dec 8, 2017
Computer Chess Compendium	Dec 29, 2015
Dietrich Prinz	Oct 14, 2016
EPAM	Jul 15, 2017
Games	Feb 20, 2018
George Baylor	Sep 22, 2014
Hans Berliner	Jun 10, 2017
Hardware	Jan 20, 2018
Herbert Simon	Feb 11, 2016
History	Jan 2, 2018
ICGA Journal	Dec 21, 2017
J. Biit	Jan 17, 2017
Jaime Carbonell	May 5, 2015
James Gillogly	Jan 7, 2016
John McCarthy	Jan 5, 2017
John von Neumann	May 8, 2017
Joseph S. Rubenfeld	Oct 6, 2014
Kasparov versus Deep Thought 1989	Mar 26, 2017
Knowledge	Jul 22, 2017
L. Stephen Coles	Jan 5, 2017
Learning	Feb 20, 2018
Mac Hack	Apr 20, 2018
MANIAC I	Nov 17, 2016
Mater	Apr 26, 2016
Mathematician	Apr 9, 2018
NSS	Jul 14, 2015
Paul Rushton	Jan 12, 2015
Paul S. Rosenbloom	Jun 13, 2017
People	Feb 28, 2018
Quote McCarthy	Sep 10, 2013
Richard Fikes	May 23, 2016
Tech	Apr 20, 2018

Up one level

Arthur Samuel

GerdIsenberg — Sun, 29 May 2016 08:23:46 GMT

Home * People * Arthur Samuel

		Arthur Lee Samuel, (1901 - July 29, 1990 ^[1]) an American computer game pioneer, who developed a Checkers program in the 50s, which appeared to be the world's first self-learning program. He already implemented a variation of alpha-beta pruning, which appeared to have been reinvented a number of times by John McCarthy, Allen Newell with Herbert Simon, Alexander Brudno and others. Samuel's program already used bitboards to represent the checkers board state. Arthur Samuel further was pioneer in machine learning, and first used the reinforcement learning technique later dubbed TDLeaf(λ), and, a few years later, supervised move adaption to tune the evaluation of his program ^[2], where a structure of stacked linear evaluation functions was trained by computing a correlation measure based on the number of times the feature rated an alternative move higher than the desired move played by an expert ^[3].
Arthur Samuel (standing) ^[4]

Photos

Quotes

See also

Selected Publications

External Links

References

What links here?

Photos

Playing checkers at SAIL, ~1970 ^[5] ^[6]

Quotes

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 ^[7]:

Selected Publications

Arthur Samuel (1959). Some Studies in Machine Learning Using the Game of Checkers. IBM Journal July 1959, reprinted in David Levy (ed.) (1988). Computer Games I. ^[8] ^[9]
Arthur Samuel (1960). Programming Computers to Play Games. Advances in Computers, Vol. 1, pp. 165-192
Arthur Samuel (1967). Some Studies in Machine Learning. Using the Game of Checkers. II-Recent Progress. pdf
Hans Berliner, Richard Greenblatt, Jacques Pitrat, Arthur Samuel, David Slate (1977). Panel on Computer Game Playing. IJCAI 1977, pdf
Gio Wiederhold, John McCarthy, Edward Feigenbaum (1990). Memorial Resolution: Arthur L. Samuel (1901 - 1990). pdf
Jonathan Schaeffer (1997, 2009). One Jump Ahead Challenging Human Supremacy in Checkers, Springer, ISBN 0-387-94930-5, ISBN 978-0-387-76575-4, Didn't Samuel Solve That Game?

External Links

References

^ Gio Wiederhold, John McCarthy, Ed Feigenbaum (1990). Memorial Resolution: Arthur L. Samuel (1901 - 1990). pdf
^ Arthur Samuel (1967). Some Studies in Machine Learning. Using the Game of Checkers. II-Recent Progress. pdf
^ Johannes Fürnkranz (2000). Machine Learning in Games: A Survey. Austrian Research Institute for Artificial Intelligence, OEFAI-TR-2000-3, pdf
^ Photo and Description from Chinook - Arthur Samuel's Legacy
“Arthur Samuel (standing), IBM investigator of machines that learn, watches a checker game between a human player and an electronic player - a large computer. The computer is about to win this game and type out: `Sorry, you lose.’” John Pfeiffer, The Thinking Machine, J.B. Lippincott Company, Philadelphia & NY, 1962
^ Arthur Samuel: Pioneer in Machine Learning by John McCarthy from Stanford Computer History Exhibits
^ B. Jack Copeland, Diane Proudfoot (2011-2012). Turing, Father of the Modern Computer. The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology, Vol. 4 » with photos of Alan Turing, John von Neumann, Dietrich Prinz, Christopher Strachey, Jack Good, Arthur Samuel, Herbert Simon, Allen Newell, ...
^ John McCarthy Human-Level AI is harder than it seemed in 1955
^ Some studies in machine learning using the game of checkers by Arthur Lee Samuel from Jeremy Norman's Historyofscience.com - Used Book - Paperback - First Edition
^ Norbert Wiener (1964). God & Golem, Inc.: A Comment on Certain Points Where Cybernetics Impinges on Religion - MIT Press, Cambridge, MA - pdf, refers Samuel's Checkers at pp. 11
^ Richard Sutton and Andrew Barto (1998). Reinforcement Learning: An Introduction. MIT Press, Cambridge, Mass. ISBN 0-2621-9398-1.

What links here?

Page	Date Edited
A. Harry Klopf	Dec 29, 2017
Alan Biermann	Dec 21, 2017
Alan Turing	Feb 8, 2017
Allen Newell	Jun 12, 2017
Alpha-Beta	Jan 28, 2018
Arnold K. Griffith	Oct 4, 2015
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Automated Tuning	Feb 27, 2018
B*	Nov 27, 2017
Bitboards	Nov 14, 2017
Book Learning	Jan 1, 2017
CAPS	Dec 23, 2017
Checkers	Dec 23, 2017
Christopher Strachey	May 8, 2017
David Slate	Jul 19, 2016
Dietrich Prinz	Oct 14, 2016
Edward Feigenbaum	Jan 3, 2016
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
Eric Jensen	Jan 7, 2016
Games	Feb 20, 2018
Hans Berliner	Jun 10, 2017
Herbert Simon	Feb 11, 2016
ICGA Journal	Dec 21, 2017
Jacques Pitrat	Aug 7, 2015
John McCarthy	Jan 5, 2017
John von Neumann	May 8, 2017
Learning	Feb 20, 2018
Nathaniel Rochester	Oct 26, 2016
People	Feb 28, 2018
Persistent Hash Table	Dec 31, 2017
Quote McCarthy	Sep 10, 2013
Reinforcement Learning	Feb 12, 2018
Richard Greenblatt	Jan 19, 2016
Stanford University	Dec 7, 2017
Temporal Difference Learning	Feb 20, 2018
Tom Truscott	Dec 22, 2017

Up one level

Christopher Strachey

GerdIsenberg — Mon, 08 May 2017 12:21:53 GMT

Home * People * Christopher Strachey

		Christopher Strachey, (November 16, 1916 – May 18, 1975) was a British computer scientist and pioneer in computer and programming language design, between 1952 and 1959 ‎technical officer in the National Research Development Corporation, between 1962 and 1965 fellow of Churchill College, Cambridge, and from 1966 ‎leader of the Programming Research Group, Oxford University ^[1], where he worked with Dana Scott and Joe Stoy, constituting the Scott-Strachey approach to denotational semantics ^[2]. Strachey had a major role in the development of the Elliot 401 and Ferranti Pegasus computers, being responsible for its logical design. In the early 1960s, along with Maurice Wilkes at the University of Cambridge Computer Laboratory, he was involved in the development of the Titan or Atlas 2 ^[3] , and developed the Combined Programming Language (CPL) ^[4] . His influential fundamental concepts in programming languages formalized the distinction between L- and R- values ^[5] . In 1959, Strachey wrote one of the first seminal papers on Time-sharing ^[6] ^[7] ^[8]. In his 1961 paper Bitwise operations ^[9] he already proposed a parallel prefix bit reversal algorithm ^[10].
Christopher Strachey ^[11]

Checkers

Love Letters

Selected Publications

External Links

References

What links here?

Checkers

Strachey wrote the first successful AI program, his checkers (draughts) program for the Ferranti Mark 1 at the University of Manchester, after first trials on Turing's Pilot ACE at National Physical Laboratory in 1950/1951 exhausted its memory. By the summer of 1952 the program could play a complete game of checkers at a reasonable speed ^[12] ^[13] ^[14], and also played “God Save the King” on completion ^[15] ^[16], and already featured Bitboards for White, Black and Kings to represent the board ^[17]. His checkers program from 1966 ^[18] written in CPL is available on-line, in a corrected version with courtesy of Peter Norvig ^[19] ^[20].

Love Letters

		In 1952, Christopher Strachey used the built-in random number generator of the Ferranti Mark 1 ^[21] to generate texts that are intended to express and arouse emotions, the Strachey love letters by M.U.C. (Manchester University Computer), recently broached by David Link ^[22] ^[23] ^[24]. One sample from Matt Sephton's ^[25] Loveletter Generator, a reimplementation of Strachey 's algorithm from 1952 ^[26]: `Beloved Dear,` `My anxious rapture clings to your craving` `infatuation. My unsatisfied hunger impatiently longs` `for your winning ardour. You are my anxious heart, my` `burning rapture, my tender little liking.` `Yours curiously,` `M.U.C.`
Love's Messenger ^[27]

In 1952, Christopher Strachey used the built-in random number generator of the Ferranti Mark 1 ^[21] to generate texts that are intended to express and arouse emotions, the Strachey love letters by M.U.C. (Manchester University Computer), recently broached by David Link ^[22] ^[23] ^[24]. One sample from Matt Sephton's ^[25] Loveletter Generator, a reimplementation of Strachey 's algorithm from 1952 ^[26]:

Beloved Dear,

My anxious rapture clings to your craving

infatuation. My unsatisfied hunger impatiently longs
for your winning ardour. You are my anxious heart, my
burning rapture, my tender little liking.

Yours curiously,
M.U.C.

Love's Messenger ^[27]

Selected Publications

^[28] ^[29]

Christopher Strachey (1952). Logical or non-mathematical Programs. Proceedings of the ACM Conference, Toronto, reprinted in David Levy (ed.) (1988). Computer Games I.
Christopher Strachey (1959). Time sharing in large, fast computers. IFIP Congress 1959
Christopher Strachey (1961). Bitwise operations. Communications of the ACM, Vol. 4, No. 3 ^[30]
Christopher Strachey, Maurice Wilkes (1961). Some Proposals for Improving the Efficiency of ALGOL 60. Communications of the ACM, Vol. 4, No. 11
David W. Barron, John Buxton ^[31] , David Hartley, Eric Nixon, Christopher Strachey (1963). The main features of CPL. The Computer Journal, Vol. 6, No. 2
Christopher Strachey (1965). An impossible program (Correspondence). The Computer Journal, Vol. 7, No. 4
Christopher Strachey (1965). A General Purpose Macrogenerator. The Computer Journal, Vol. 8, No. 3
Christopher Strachey (1966). Towards a Formal Semantics. North-Holland
Christopher Strachey (1966). System Analysis and Programming. Scientific American, September 1966, republished August 23, 2011
Christopher Strachey (1967, 2000). Fundamental Concepts in Programming Languages. Higher-Order and Symbolic Computation, Vol. 13: 11–49
Dana Scott, Christopher Strachey (1971). Toward an Mathematical Semantics for Computer Languages. pdf
Robert Milne, Christopher Strachey (1977). Theory of Programming Language Semantics. Part A & B. Chapman & Hall, ISBN-13: 978-0412142604, amazon.com, oldcomputerbooks.com

External Links

References

^ Christopher Strachey - I13799 - Individual Information - PhpGedView
^ Joe Stoy (1981). Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, ISBN 978-0262690768
^ Ferranti Computing Systems Atlas 2 Brochure: August 1963 from Atlas Computer Laboratory, Chilton: 1961-1975
^ CPL also dubbed as Cambridge + London or Christopher's (Strachey) Private Language, London Atlas, Additional Material from Atlas Computer Laboratory
^ Christopher Strachey (1967, 2000). Fundamental Concepts in Programming Languages. Higher-Order and Symbolic Computation, Vol. 13: 11–49
^ Christopher Strachey (1959). Time sharing in large, fast computers. IFIP Congress 1959
^ Reminiscences on the History of Time Sharing by John McCarthy, 1983
^ Origins of Timesharing by Bob Bemer
^ Christopher Strachey (1961). Bitwise operations. Communications of the ACM, Vol. 4, No. 3
^ reverse.c from C code for most of the programs that appear in Hacker's Delight by Henry S. Warren, Jr.
^ Pioneer Profiles - Christopher Strachey by David Barron, Resurrection - The Bulletin of the Computer Conservation Society
^ B. Jack Copeland, Diane Proudfoot (2011-2012). Turing, Father of the Modern Computer. The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology, Vol. 4 » with photos of Alan Turing, John von Neumann, Dietrich Prinz, Christopher Strachey, Jack Good, Arthur Samuel, Herbert Simon, Allen Newell, ...
^ artificial intelligence (AI) :: Early milestones in AI from Britannica Online Encyclopedia
^ The “Modern” History of Artificial Intelligence and Programs from Neuroscience Of Intelligence
^ Pioneer Profiles - Christopher Strachey by David Barron, Resurrection - The Bulletin of the Computer Conservation Society
^ Oldest' computer music unveiled by Jonathan Fildes, BBC News, June 17, 2008
^ On Bitboards for White, Black and Kings to represent the checkers board, see David Link Video at 1:04:02
^ Christopher Strachey (1966). System Analysis and Programming. Scientific American, September 1966, republished August 23, 2011
^ Complete Annotated Strachey Checkers Program by Peter Norvig
^ Prescient but Not Perfect: A Look Back at a 1966 Scientific American Article on Systems Analysis by Peter Norvig, August 23, 2011
^ The function /W puts random digits into the twenty least significant digits of the accumulator. (The randomness is derived from a resistance noise generator) - Alan Turing (1952). Programmers' Handbook for the Manchester Electronic Computer Mark II. 2nd edition, revised by R.A. Brooker
^ The Archaeology of Very Early Algorithms, 1948-58 - Christopher Strachey's Love Letter Generator by David Link, Computer Conservation Society, March 12, 2009
^ LoveLetters_1.0, 2009—...: by David Link
^ Strachey Love Letters from Gnoetry Daily
^ Websites, widgets and other wonderful things. By Matt Sephton
^ Christopher Strachey "Loveletters" (1952)
^ Love's Messenger, by Marie Spartali Stillman c. 1885, at Delaware Art Museum, Love letter from Wikipedia
^ The National Archives - Catalogue of the papers and correspondence of Christopher Strachey (1916 - 1975)
^ DBLP: Christopher Strachey
^ reverse.c from C code for most of the programs that appear in Hacker's Delight by Henry S. Warren, Jr.
^ J.N. Buxton: Software Engineering Techniques 1969

What links here?

Page	Date Edited
Alan Turing	Feb 8, 2017
Algol	Feb 1, 2014
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Bitboards	Nov 14, 2017
Checkers	Dec 23, 2017
Christopher Strachey	May 8, 2017
Dietrich Prinz	Oct 14, 2016
Ferranti Mark 1	Jun 2, 2015
Flipping Mirroring and Rotating	Oct 14, 2016
General Setwise Operations	Feb 25, 2018
John von Neumann	May 8, 2017
Languages	Nov 26, 2017
Mathematician	Apr 9, 2018
People	Feb 28, 2018
Peter Norvig	Jun 7, 2016
Programming	Dec 16, 2017
Scientific American	Jun 5, 2017

Up one level

Claude Shannon

GerdIsenberg — Sat, 30 Apr 2016 18:23:39 GMT

Home * People * Claude Shannon

		Claude Elwood Shannon, (April 30, 1916 – February 24, 2001) was an American electrical engineer, mathematician and researcher from MIT and since 1941 Bell Laboratories. One of the pioneers of the information theory . In 1949 Shannon published a groundbreaking paper on computer chess entitled Programming a Computer for Playing Chess ^[1] . 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.
Claude Shannon ^[2]

Selected Publications

Photos

Chess Automation

Quote of the text on the back on the photo, as given in ICCA Journal, Vol. 12, No. 4: ^[3] :

Dr. Claude E. Shannon demonstrating to Chessmaster Edward Lasker his (home-made) electric chess automation, build in 1949. The machine could handle up to six pieces, and was designed to test various programming methods. With one hundred and fifty relay operations required to complete a move, it arrived at the reply to an opponent's play in ten to fifteen seconds. It had built into it a random element, and as a result did not necessarily always make the same move when faced with the same position.

Computer pioneer Claude Shannon and chess champion Edward Lasker at MIT,
ponder the computational aspects of playing chess at Shannon's early relay-based
chess machine ^[4]

WCCC 1980



WCCC 1980, Linz, Austria, Special guest Claude Shannon, David Levy left ^[5]

Chess pioneers in Sacher Hotel Vienna, Austria 1980: Ben Mittman, Monty Newborn, Tony Marsland, Dave Slate, David Levy, Claude Shannon, Ken Thompson, Betty Shannon, Tom Truscott ^[6]

WCCC 1989



Thompson, Shannon, and Slate at the 6th WCCC Edmonton 1989 ^[7]

Claude Shannon awards Feng-Hsiung Hsu, first prize for Deep Thought, Edmonton 1989 ^[8]

Shannon's Types

Claude Shannon categorized two types of search ^[9] :

Type A - a brute-force search looking at every variation to a given depth
Type B - a selective search looking at "important" branches only

Without the sense of alpha-beta, and inspired by the experiments of Adriaan de Groot ^[10] , Shannon and early programmers favored Type B strategy. Type B searches use some type of static heuristics in order to only look at branches that look important - with some risk to oversee some serious tactics not covered by the plausible move selector. Type B was most popular until the 1970's, when Type A programs had enough processing power and more efficient brute force algorithms to become stronger. Today most programs are closer to Type A, but have some characteristics of a Type B as mentioned in selectivity.

Selected Publications

Claude Shannon (1938). A Symbolic Analysis of Relay and Switching Circuits. Transactions of the AIEE, Vol. 57, No 12, Master's thesis 1940, Massachusetts Institute of Technology
Claude Shannon (1948). A Mathematical Theory of Communication. pdf
Claude Shannon (1949). Programming a Computer for Playing Chess. pdf from The Computer History Museum
Claude Shannon (1950). A Chess-Playing Machine. Scientific American, Vol. 182 (No. 2, February 1950), pp. 48-51. Reprinted in The World of Mathematics, edited by James R. Newman, Simon & Schuster, NY, Vol. 4, 1956, pp. 2124-2133. Included in Part B
Claude Shannon (1953). Computers and Automata. Proceedings of the Institute of Radio Engineers Vol. 41, No. 10 ^[11] ^[12] ^[13]
John McCarthy, Marvin Minsky, Nathaniel Rochester, Claude Shannon (1955). A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence.
Claude Shannon, John McCarthy (eds.) (1956). Automata Studies. Annals of Mathematics Studies Number 34, Google books, oldcomputerbooks.com
Jaap van den Herik (1989). An Interview with Claude Shannon, September 25, 1980 in Linz, Austria. ICCA Journal, Vol. 12, No. 4
Bob Herschberg, Jaap van den Herik (1989). Thank You, Dr. Shannon. ICCA Journal, Vol. 12, No. 4
Neil J. A. Sloane, Aaron D. Wyner (1993). Claude Shannon: Collected Papers. IEEE Press, ISBN 0-7803-0434-9
Ken Thompson (2001). CLAUDE SHANNON (1916-2001): FUNDAMENTAL CONTRIBUTIONS. ICGA Journal, Vol. 24, No. 1
Jaap van den Herik (2001). CLAUDE SHANNON (1916-2001): THANK YOU. ICGA Journal, Vol. 24, No. 1
Ben Mittman (2001). OBITUARY CLAUDE SHANNON (1916 – 2001): PERSONAL MEMORIES. ICGA Journal, Vol. 24, No. 2
David Mindell, Jérôme Segal, Slava Gerovitch (2003). Cybernetics and Information Theory in the United States, France and the Soviet Union. in Mark Walker, Science and Ideology: A Comparative History » Claude Shannon, Norbert Wiener, covers the 1951 Paris Cybernetic Congress

Forum Posts

One hundred years ago by Steven Edwards, CCC, April 30, 2016

External Links

Videos

Claude Shannon - Father of the Information Age, YouTube Video
Claude Shannon Juggling, YouTube Video

100th Birthday

References

^ Programming a Computer for Playing Chess (raw text)
^ Claude Shannon from Wikipedia
^ Photo of courtesy of Mrs. Shannon and Jos Uiterwijk, ICCA Journal, Vol. 12, No. 4, pp. 217. Quote of the text on the back on the photo
^ Shannon and Lasker at Shannon's chess machine, ca. 1950 Gift of Monroe Newborn from The Computer History Museum
^ Claude Shannon during the 3rd World Computer Chess Championship that was staged in the course of the Ars Electronica Festival 1980, credit: LIVA – Linzer Veranstaltungsgesellschaft mbH, Ars Electronica - Codes & Clowns (2010/2011) – Flickr
^ Chess pioneers in Sacher Hotel Vienna, Austria, Gift of Benjamin Mittman, The Computer History Museum
^ Thompson, Shannon, and Slate Photo by Monroe Newborn from A History of Computer Chess from The Computer History Museum
^ Claude Shannon awards Feng-Hsiung Hsu Photo from A History of Computer Chess from The Computer History Museum
^ Claude Shannon (1949). Programming a Computer for Playing Chess. pdf
^ Groot, A.D. de (1946). Het denken van den Schaker, een experimenteel-psychologische studie. Ph.D. thesis, University of Amsterdam; N.V. Noord-Hollandse Uitgevers Maatschappij, Amsterdam. Translated with the help of George Baylor, with additions (in 1965) as Thought and Choice in Chess. Mouton Publishers, The Hague. ISBN 90-279-7914-6. (amazon)
^ In Vadim Anshelevich (2002). A hierarchical approach to computer Hex. Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence, pdf, Vadim Anshelevich acknowledged Claude Shannon, who build an analogue Hex-playing machine using electrical resistor circuits, which was model in Anshelevich's program Hexy
^ Hex is a special case of the Shannon Switching Game, from Jack van Rijswijck (2003). Search and evaluation in Hex. Technical report, University of Alberta, pdf
^ Thomas Fischer (2009). Bridg-It – Beating Shannon’s Analog Heuristic. pdf

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
8x8 Board	Aug 29, 2017
Adriaan de Groot	Oct 6, 2014
Alan Turing	Feb 8, 2017
Alpha-Beta	Jan 28, 2018
Artificial Intelligence	Apr 9, 2018
Bell Laboratories	Jun 20, 2017
Ben Mittman	Jan 2, 2017
Bit	Oct 29, 2012
Board Representation	Dec 11, 2017
Bob Herschberg	Dec 13, 2016
Brute-Force	Jul 27, 2017
CC Sapiens	Oct 29, 2014
Chess	Jan 21, 2018
Chess (Program)	Dec 22, 2017
Chess Game	Mar 28, 2017
Claude Shannon	Apr 30, 2016
Claudia	Jun 1, 2016
Cognition	Dec 8, 2017
Complexity to include	Jun 16, 2011
Computer Chess Compendium	Dec 29, 2015
Connection Machine	Oct 12, 2016
Dartmouth College	Dec 16, 2016
David Levy	Jan 3, 2017
David Slate	Jul 19, 2016
Duchess	Dec 22, 2017
Edward Fredkin	Oct 27, 2013
El Ajedrecista	Feb 25, 2015
Electro-Mechanical	May 2, 2016
Elwyn Berlekamp	Jun 25, 2015
Evaluation	Feb 1, 2018
Feng-hsiung Hsu	Dec 27, 2016
Games	Feb 20, 2018
Hartmut Tanke	Sep 7, 2014
Heinz Nixdorf MuseumsForum	Sep 6, 2015
Hex	Dec 29, 2017
History	Jan 2, 2018
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Jack Good	Dec 22, 2017
James Gillogly	Jan 7, 2016
John McCarthy	Jan 5, 2017
John von Neumann	May 8, 2017
Jos Uiterwijk	Aug 11, 2017
Kaissa	Apr 9, 2018
Kches6	Jan 2, 2018
Ken Thompson	Sep 8, 2017
Learning	Feb 20, 2018
Leonardo Torres y Quevedo	Feb 25, 2015
Mailbox	Apr 14, 2018
Marvin Minsky	Jan 29, 2016
Massachusetts Institute of Technology	Jan 24, 2017
Master	Dec 28, 2017
Material	Mar 31, 2018
Mathematician	Apr 9, 2018
Mikhail Botvinnik	Jul 15, 2017
Minimax	Dec 29, 2017
Mobility	Jan 17, 2018
Monroe Newborn	Dec 23, 2017
Nathaniel Rochester	Oct 26, 2016
Neural Networks	Mar 12, 2018
Norbert Wiener	Oct 6, 2013
Opponent Model Search	Aug 14, 2017
People	Feb 28, 2018
Point Value	Mar 31, 2018
Point Value by Regression Analysis	Aug 26, 2017
Pruning	Jan 1, 2018
Quote McCarthy	Sep 10, 2013
Razoring	Oct 5, 2015
Robots	Feb 20, 2018
Santos Gerardo Lazzeri	Mar 19, 2016
Scientific American	Jun 5, 2017
Search	Feb 1, 2018
Shannon Trophy	Jul 7, 2017
Simplified evaluation function	Dec 2, 2014
Tech	Apr 20, 2018
The Fox	Feb 27, 2017
Tom Truscott	Dec 22, 2017
Tony Marsland	Nov 27, 2017
Type A Strategy	Jul 30, 2010
Type B Strategy	Jul 19, 2016
Vadim Anshelevich	Dec 22, 2016
WCCC 1980	Dec 25, 2017
WCCC 1989	Dec 5, 2017
World Computer Chess Championship	Mar 6, 2018

Up one level

Cliff Shaw

GerdIsenberg — Fri, 04 Apr 2014 19:47:09 GMT

Home * People * Cliff Shaw

		John Clifford (Cliff ) Shaw, (1922–1991) ^[1] 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. In the 1950s, he collaborated with the Carnegie Mellon University researchers Herbert Simon and Allen Newell on developing computer programs that attempted to simulate human decision-making. Shaw wrote the programming language known as Information Processing Language (IPL) for the Chess program NSS (and other programs) for a Johnniac computer.
Cliff Shaw ^[2]

Selected Publications

External Links

References

What links here?

Selected Publications

Allen Newell, Cliff Shaw, Herbert Simon (1958). Chess Playing Programs and the Problem of Complexity. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335. Reprinted (1963) in Computers and Thought (eds. Edward Feigenbaum and Julian Feldman), pp. 39-70. McGraw-Hill, New York, N.Y. pdf
Allen Newell, Cliff Shaw, Herbert Simon (1959). Report on a general problem-solving program. Proceedings of the International Conference on Information Processing, pp. 256-264 ^[3]

External Links

References

What links here?

Page	Date Edited
Allen Newell	Jun 12, 2017
Alpha-Beta	Jan 28, 2018
Artificial Intelligence	Apr 9, 2018
Carnegie Mellon University	Feb 12, 2018
Chess	Jan 21, 2018
Cliff Shaw	Apr 4, 2014
Computer Chess Compendium	Dec 29, 2015
Games	Feb 20, 2018
Herbert Simon	Feb 11, 2016
History	Jan 2, 2018
MANIAC I	Nov 17, 2016
NSS	Jul 14, 2015
Paul Rushton	Jan 12, 2015
People	Feb 28, 2018

Up one level

Dietrich Prinz

GerdIsenberg — Fri, 14 Oct 2016 08:21:36 GMT

Home * People * Dietrich Prinz

		Dietrich G. Prinz, (March 29, 1903 - December 1989) was a German computer scientist and pioneer, who developed the first limited chess program in England 1951 ^[1]. 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 ^[2] and settled in England ^[3]. 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 ^[4] ^[5], and like Michie, Strachey, and others, by an important article published in 1950 by Donald Davies, A Theory of Chess and Noughts and Crosses ^[6] ^[7] .
Dietrich Prinz ^[8]

Photos

See also

Selected Publications

External Links

References

What links here?

Photos

Germany, 1951, Nimrod ^[9] versus Ludwig Erhard, Prinz and Adenauer watching ^[10] ^[11] ^[12]

Selected Publications

^[13] ^[14]

Dietrich Prinz (1944). Contributions to the Theory of Automatic Controllers and Followers. Journal of Scientific Instruments
Dietrich Prinz (1951). Introduction to Programming on the Manchester Electronic Digital Computer.
Dietrich Prinz (1952). Robot Chess. Research, Vol. 6, reprinted 1988 in Computer Chess Compendium
Dietrich Prinz (1953). The Use of General Computers for Solving Logical Problems, in Bertram Vivian Bowden (editor), Faster Than Thought, a symposium on digital computing machines
Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227

External Links

Chess programs: Prinz from Alex Bell (1972). Games Playing with Computers. Allen & Unwin, ISBN-13: 978-0080212227
Dietrich Prinz from History of Computer Chess, The Computer History Museum
History of Computer Chess and Programmer Dietrich Prinz by Mary Bellis, About.com
Early AI Programs from AlanTuring.net by B. Jack Copeland
"Brilliant and barking mad": an interview with expat scientist Dr Jon Prinz, telegraph.co.uk, June 21, 2010
2012 The Alan Turing Year - TCAC Germany Subcommittee

References

^ B. Jack Copeland, Diane Proudfoot (2011-2012). Turing, Father of the Modern Computer. The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology, Vol. 4 » with photos of Alan Turing, John von Neumann, Dietrich Prinz, Christopher Strachey, Jack Good, Arthur Samuel, Herbert Simon, Allen Newell, ...
^ confirmed by Daniela Derbyshire, daughter of Dietrich Prinz, January 2012
^ History of Computer Chess and Programmer Dietrich Prinz by Mary Bellis, About.com
^ Dietrich Prinz from History of Computer Chess, The Computer History Museum
^ Early AI Programs from AlanTuring.net by B. Jack Copeland
^ Donald Davies (1950). A Theory of Chess and Noughts and Crosses. Science News, 16, 40
^ The First Working Chess Programme, Chapter 16 Chess, Introduction, in Alan Turing, B. Jack Copeland (editor) (2004). The Essential Turing, Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma. Oxford University Press, amazon, google books
^ Dr. Dietrich Prinz loading chess program into a Ferranti Mark I computer, 1955, Courtesy of Hulton-Deutsch Collection/CORBIS, Dietrich Prinz from History of Computer Chess, The Computer History Museum
^ Welcome to... NIMROD!
^ Heise News, June 23, 2006, (German) Question 3: Who is the man with the glasses?
^ Heise News, July 24, 2006, (German) Answer: Dietrich Prinz
^ Heise News, October 06, 2001, (German) The second photo shows Prinz left of Minister of Economics and later Chancellor of West Germany, Ludwig Erhard, playing a game of Nim against the special purpose machine Nimrod, Photo with Courtesy of the Heinz Nixdorf MuseumsForum
^ Papers of Dr Dietrich G. Prinz - ELGAR: Electronic Gateway to Archives at Rylands The John Rylands University Library The University of Manchester
^ UK National Archive for the History of Computing - Draft Catalogue Version 1.0, August 15, 2005 (pdf)

What links here?

Page	Date Edited
Alan Turing	Feb 8, 2017
Andre Adrian	Jan 16, 2012
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Checkmate	Apr 13, 2018
Christopher Strachey	May 8, 2017
Computer Chess Compendium	Dec 29, 2015
Dietrich Prinz	Oct 14, 2016
El Ajedrecista	Feb 25, 2015
Ferranti Mark 1	Jun 2, 2015
History	Jan 2, 2018
John von Neumann	May 8, 2017
Mailbox	Apr 14, 2018
Mate Search	Oct 22, 2016
Mate-in-two	Oct 14, 2016
Move Generation	Jan 29, 2018
People	Feb 28, 2018
Piece-Lists	Feb 13, 2017
Tihamér Nemes	Sep 11, 2014
University of Manchester	May 24, 2017

Up one level

Donald Knuth

GerdIsenberg — Mon, 29 Aug 2016 20:40:57 GMT

Home * People * Donald Knuth

		Donald Ervin Knuth, a renowned computer scientist, mathematician, writer, scholar, and Professor Emeritus at Stanford University, California, United States ^[1]. He is the author of the multi-volume work The Art of Computer Programming, and been called the "father" of the analysis of algorithms - in 1975 he analyzed Alpha-Beta along with Ronald W. Moore, first formulating its Node Types ^[2]. Beside his fundamental contributions to several branches of computer science and mathematics, Knuth is the creator of the TeX computer typesetting system.
Donald Knuth ^[3]

Selected Publications

Quotes

McCarthy

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 ^[4]:

Knuth

Selected quotes by Donald Knuth ^[5]

A mathematical formula should never be "owned" by anybody! Mathematics belong to God. ^[6]
Beware of bugs in the above code; I have only proved it correct, not tried it. ^[7]
We should forget about small efficiencies, say about 97% of the time: premature optimization is the root of all evil. ^[8]

Alpha-Beta

Alpha-Beta F2 and Iterative Solution ^[9]

Selected Publications

^[10]^[11]

1960 ...

Donald Knuth (1960). An Imaginary Number System. Communications of the ACM, Vol. 3, No. 4
Donald Knuth (1962). The calculation of Easter. Communications of the ACM, Vol. 5, No. 4
Donald Knuth (1964). backus normal form vs. Backus Naur form. Communications of the ACM, Vol. 7, No. 12 ^[12]
Donald Knuth (1968 ...). The Art of Computer Programming (TAOCP) ^[13]
Volume 1 - Fundamental Algorithms (1968)
Volume 2 - Seminumerical Algorithms (1969)
Volume 3 - Sorting and Searching (1973)
Volume 4A - Combinatorial Algorithms, Part 1 (2011)
- New material for Volume 4 will first appear in beta-test form as fascicles
- Volume 4 Fascicle 0, Introduction to Combinatorial Algorithms and Boolean Functions (2008)
- Volume 4 Fascicle 1, Bitwise Tricks & Techniques; Binary Decision Diagrams (2009)
- Volume 4 Fascicle 2, Generating All Tuples and Permutations (2005)
- Volume 4 Fascicle 3, Generating All Combinations and Partitions (2005)
- Volume 4 Fascicle 4, Generating All Trees; History of Combinatorial Generation (2006)
Volume 5 - Syntactic Algorithms, planned (estimated in 2020).

1970 ...

Donald Knuth (1970). Von Neumann's First Computer Program. ACM Computing Surveys, Vol. 2, No. 4
Donald Knuth (1974). Structured Programming with go to Statements. ACM Computing Surveys, Vol. 6, No. 4, pdf » goto
Ole Amble, Donald Knuth (1974). Ordered Hash Tables. The Computer Journal, Vol. 17
Donald Knuth (1974). Estimating efficiency of backtrack programs. STAN-CS-74-442, CS-Department, Stanford University ^[14]
Donald Knuth (1974). Surreal Numbers - How two ex-students turned on to pure mathematics and found total happiness. Addison-Wesley ^[15] ^[16]
Donald Knuth (1974). Computer Programming as an Art. Communications of the ACM, Vol. 17, No. 12
Donald Knuth (1974). Computer Programming as an Art. Turing Award Lecture, pdf
Donald Knuth (1975). Estimating the Efficiency of Backtrack Programs. Mathemathics of Computation, Vol. 29 » Backtracking
Donald Knuth, Ronald W. Moore (1975). An analysis of alpha-beta pruning. Artificial Intelligence, Vol. 6, No. 4, pp 293–326. Reprinted in Donald Knuth (2000). Selected Papers on Analysis of Algorithms. CSLI lecture notes series 102, ISBN 1-57586-212-3
Donald Knuth, James H. Morris, Jr., Vaughan R. Pratt (1977). Fast Pattern Matching in Strings. SIAM Journal on Computing, Vol. 6, No. 2 ^[17]

1980 ...

Andrei P. Ershov, Donald Knuth (Eds.) (1981). Algorithms in Modern Mathematics and Computer Science. Proceedings, Urgench, Uzbek SSR, September 16-22, 1979. Lecture Notes in Computer Science, Vol. 122, Springer » Ershov Archive
Donald Knuth (1985). An Analysis of Optimum Caching. Journal of Algorithms, Vol. 6
Donald Knuth (1986). TeX: The Program. Addison-Wesley ^[18]
Donald Knuth (1986, 1996). The TeXbook. Addison-Wesley, pdf
Ronald L. Graham, Donald Knuth, Oren Patashnik (1989, 1994). Concrete Mathematics. Second Edition, Addison-Wesley

1990 ...

Lee Sallows, Martin Gardner, Richard K. Guy, Donald Knuth (1991). Serial Isogons of 90 Degrees. Mathematics Magazine, Vol. 64, No. 5
Donald Knuth (1991). Textbook examples of recursion. arXiv:cs/9301113 » Recursion
Donald Knuth (1992). Literate Programming. CSLI lecture notes series 27 ^[19]
Donald Knuth (1996). Selected Papers on Computer Science. CSLI lecture notes series 59
Donald Knuth (1999). Digital Typography. CSLI lecture notes series 78

2000 ...

Donald Knuth (2000). Dancing Links arXiv:cs/0011047v1.
Donald Knuth (2000). Selected Papers on Analysis of Algorithms. CSLI lecture notes series 102
Donald Knuth (2001). Arithmetik. Springer, ISBN 978-3-540-66745-2
Donald Knuth (2003). Selected Papers on Discrete Mathematics. CSLI lecture notes series 106
Donald Knuth (2003). Selected Papers on Computer Languages. CSLI lecture notes series 139
Donald Knuth (2003). Things a Computer Scientist Rarely Talks About. CSLI lecture notes series 202

2010 ...

Donald Knuth (2010). Selected Papers on Design of Algorithms. CSLI lecture notes series 191, Cambridge University Press, ISBN 978-1-57586-582-9
Donald Knuth (2011). Selected Papers on Fun and Games. CSLI lecture notes series 192, Cambridge University Press, ISBN 978-1-57586-584-3
Donald Knuth (2012). Companion to the Papers of Donald Knuth. CSLI lecture notes series 202, Cambridge University Press, ISBN 978-1-57586-634-5
Donald Knuth (2012). Satisfiability and The Art of Computer Programming. SAT 2012, Lecture Notes in Computer Science, Vol. 7317, Springer

External Links

Donald Knuth

Don Knuth’s home page
Donald Knuth from Wikipedia
Donald Knuth - Wikiquote
The Mathematics Genealogy Project - Donald Knuth
Knuth biography - MacTutor
Donald E. Knuth - A.M. Turing Award Winner
Fellow Awards | Donald Knuth from The Computer History Museum
Donald Knuth - АдептИС: Под знаком Leonardo da Vinci (Russian)
Computer Musings by Professor Donald E. Knuth | Stanford University Online
The Programmer Dress Code | CodeThinked by Justin Etheredge, December 6, 2007
Donald Knuth's First Computer - good coders code, great reuse by Peteris Krumins, February 26, 2010
In praise of Knuth and Liskov from Bertrand Meyer's technology+ blog, May 22, 2011 » Barbara Liskov
Donald Knuth in Alan Turing Year from I Programmer - programming, reviews and projects, January 10, 2012 » Alan Turing

Ershov Archive

Algorithms in Modern Mathematics and Computer Science - 1979 Andrei Ershov Archive » Algorithms in Modern Mathematics and Computer Science - Proceedings
Dancing D. Knuth
Khiva, summer hall; dancers, D.Knuth
Andrey Ershov, Donald E. Knuth
Khiva, summer hall; A. van Wijngaarden, Zemaneks, D.Knuth. F.Strassen, B.Trakhtenbrot

Interviews

Donald Knuth - Computer Literacy Bookshops Interview, December 07, 1993
An interview with Donald Knuth (pdf) by Jack Woehr, Dr. Dobb's Journal, April 1996
Interview with Donald E. Knuth by Gianluca Pignalberi, Free Software Magazine, September 04, 2005
Interview with Donald Knuth by Donald Knuth and Andrew Binstock, https://en.wikipedia.org/wiki/InformIT, April 25, 2008 » Itanium

Topics

Videos

Vienna Gödel Lecture 2013: Donald E. Knuth, Vienna University of Technology, YouTube Video

References

^ Computer Musings by Professor Donald E. Knuth | Stanford University Online
^ Donald Knuth, Ronald W. Moore (1975). An analysis of alpha-beta pruning. Artificial Intelligence, Vol. 6, No. 4, pp 293–326. Reprinted in Donald Knuth (2000). Selected Papers on Analysis of Algorithms. CSLI lecture notes series 102, ISBN 1-57586-212-3
^ Don Knuth's Home Page
^ John McCarthy Human-Level AI is harder than it seemed in 1955
^ Donald Knuth - Wikiquote
^ Donald Knuth (1999). Digital Typography. CSLI lecture notes series 78
^ Knuth: Frequently Asked Questions - What's the exact citation of your oft-cited comment about bugs?
^ Donald Knuth (1974). Structured Programming with go to Statements. ACM Computing Surveys, Vol. 6, No. 4, pdf
^ Donald Knuth, Ronald W. Moore (1975). An Analysis of Alpha-Beta Pruning. Artificial Intelligence, Vol. 6, No. 4, pp 293–326. Reprinted in Donald Knuth (2000). Selected Papers on Analysis of Algorithms. CSLI lecture notes series 102, ISBN 1-57586-212-3, pdf
^ Preprints of Recent Papers including dancing links
^ dblp: Donald E. Knuth
^ Backus–Naur Form from Wikipedia
^ The Art of Computer Programming from Wikipedia
^ Re: Perft(15) estimate after averaging 800 MC samples by Daniel Shawul, CCC, November 21, 2013 » Perft
^ Surreal number from Wikipedia
^ John H. Conway (1976). On Numbers and Games. Academic Press
^ Knuth–Morris–Pratt algorithm from Wikipedia
^ TeX from Wikipedia
^ Literate programming from Wikipedia

What links here?

Page	Date Edited
More Links
ACM	May 7, 2017
Alan Turing	Feb 8, 2017
Algorithms	May 5, 2017
Alpha-Beta	Jan 28, 2018
Arts	Nov 5, 2017
Backtracking	Dec 16, 2017
Barbara Liskov	Oct 30, 2014
Bill Gosper	Aug 20, 2014
BitScan	Sep 10, 2017
C	Feb 19, 2018
David Eppstein	Oct 10, 2013
Donald Knuth	Aug 29, 2016
Flipping Mirroring and Rotating	Oct 14, 2016
Games	Feb 20, 2018
General Setwise Operations	Feb 25, 2018
Hash Table	Jan 1, 2018
Hashing Dictionaries	Mar 1, 2014
Iteration	May 5, 2017
Iterative Search	Oct 20, 2016
John H. Conway	Apr 6, 2017
Knuth Papers	Jul 9, 2008
Kohei Noshita	Aug 21, 2014
Languages	Nov 26, 2017
Martin Gardner	May 10, 2017
Mathematician	Apr 9, 2018
Node	Jul 20, 2015
Node Types	Oct 22, 2017
Optimization	Feb 28, 2018
People	Feb 28, 2018
Population Count	Sep 3, 2017
Programming	Dec 16, 2017
Pseudorandom number generator	May 11, 2017
Queue	Apr 4, 2017
Quote McCarthy	Sep 10, 2013
Recursion	Nov 18, 2017
Richard K. Guy	Jan 11, 2014
Search	Feb 1, 2018
Search Tree	Dec 23, 2016
Stack	Nov 18, 2016
Stanford University	Dec 7, 2017

Up one level

Donald Michie

GerdIsenberg — Sat, 23 Dec 2017 09:20:09 GMT

Home * People * Donald Michie

		Donald Michie, (November 11, 1923 – July 7, 2007 ^[1] ^[2] ^[3] ) 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 ^[4] ^[5]. In 1947-48, along with Wylie, Michie designed Machiavelli, a rival of Turing's Turochamp program ^[6] ^[7]. Michie was head of the University of Edinburgh's Department of Machine Intelligence from 1965 until 1985 ^[8] , when he left to found the Turing Institute in Glasgow ^[9]. 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 ^[10] , where Michie affirmed McCarthy to take the challenge by David Levy and even want to share the bet on McCarthy's site ^[11] .
Donald Michie ^[12]

Selected Publications

Photos



Jean Hayes Michie and Donald Michie, Edinburgh 1984 ^[13]

Donald Michie receiving his honorary degree from Stirling University in 2003 ^[14]

Machine Learning

Michie began his first experiments in machine learning in 1960. His tic-tac-toe machine MENACE (Machine Educable Noughts And Crosses Engine) demonstrated the basic principle of a self-reinforcing learning mechanism. MENACE employed Michie's conceptually simple general-purpose learning algorithm BOXES ^[15] ^[16] ^[17] ^[18] ^[19] which could also discover robust control strategies for the pole balancing problem ^[20] ^[21] , but was soon employed industrially to evolve strategies for automatic control, such as controlling a steel mill ^[22].

Self build MENACE by James Bridle ^[23]
in the traditions of Heath Robinson and Charles Babbage ^[24] ^[25]

The Need for Search

In King and Rook Against King: Historical Background and a Problem on the Infinite Board at the first Advances in Computer Chess conference ^[26] , Donald Michie shows two positions, that are identical except one pawn, to demonstrate the need for search ^[27] .

rn3rk1/p1q1nppp/bp2p3/2ppP3/P2P4/2PB1N2/2P2PPP/R1BQK2R w KQ - ; bm Bxh7

rn3rk1/p1q1nppp/bp2p3/2ppP3/P2P4/2PB1N2/1P3PPP/R1BQK2R w KQ - ; am Bxh7

Chess Endgames

Quote by Maarten van Emden in I remember Donald Michie ^[28]:

In 1980 I spent another summer in Edinburgh as a guest of Donald Michie. Since the low point of 1975, thanks to assiduous and inventive joint pursuit of funding possibilities by Donald and Jean, the Machine Intelligence Research Unit was alive with work focused on chess endgames. There were students, including Tim Niblett and Alen Shapiro. Danny Kopec was there, perhaps formally as a student, but de facto as the resident chess consultant. Ivan Bratko visited frequently. Alen was the administrator of the dream computing environment of that time: a small PDP-11 running Unix. ...

Donald Michie demonstrated the Human Window phenomenon with chess end games. He proposed a form of describing end-game knowledge that he called “advice” and described a formal language, Advice Language One ^[29] , for expressing such advice. The language could be translated into a form that guided a computer to play the end-game at the level of skill of a chess expert. Soei Tan, Ivan Bratko and Danny Kopec were chess experts who used this framework to implement specific end games.

Once again, I did not get it. I could not help acting in my then usual role of Prolog evangelist and wanted to demonstrate that the beauty of Prolog was that it rendered superfluous things like Advice Language One. Accordingly I wrote a Prolog program that played an end game using Advice in DM’s sense. DM generously allowed me my say in a paper in the Tenth Machine Intelligence workshop. It’s a nice paper, but it does not get it.

Solving Chess?

Quote by Kathleen Spracklen on Donald Michie and their experiments, excerpt from Oral History of Kathe and Dan Spracklen ^[30]:

One of the most thrilling times of my entire life was the month that Dr. Donald Michie spent with us in San Diego. And he, of course, is - was head of the computer science department at Oxford, I believe, for decades. He was on the original team with Turing that broke the Enigma code. And already he was quite an elderly gentleman when he came to work with us but that wasn't stopping him from having a very full schedule as the head of the I think it was the Turing Institute in Glasgow that headed up. Quite, totally an amazing human being.

Delightful and totally amazing. And he had this concept that he wanted to try out that he thought might possibly solve computer chess. And we spent a month exploring it. It was the idea of reaching a steady state. The idea was that you would establish a number of parameters of positional analysis and your program would score, independently score vast arrays of positions using this set of known parameters. And then the program would basically perform a cluster analysis and so you'd do it on a number of positions and on game after game after game of Grand Master Chess. You submitted we just we used hundreds of thousands of positions.

And then what it did was it took the evaluation that known chess theories said this position is worth this much. So we had an external evaluation because it came out of known Master Chess games. And then we had all of these parameters that our program was capable of evaluating and then you used this data to tune your weighing of the parameters. And you could also tune the weighting for different stages of the game. So at the opening, you could use a certain weight, mid-game, you could use a certain weight, in the midst of your king being attacked, could use a set of weights, when you're pressing an attack, you could use a set of weights, when they're past pawns on the board, you know, there were several different stages of the game that could have different weightings. And we used a program called Knowledge Seeker that helped you to determine these relative weightings. And so after a month of training the program, what you basically did was you take your total set of positions and you would use something like 80% of them as a training set and then the last 20 as the test set. And you'd find out, well, how did the program do in evaluating these positions it had never seen based on these that it had seen. And it did just a breathtaking job of determining the correct worth of the positions. And so we were so excited. We were going to turn it loose on its first play a game of chess. We were going to use this as the positional evaluator.

Yeah. It was, like, oh, it was breathtaking. And we watched the program play chess. It was- you could gasp for breath. No computer program ever played a game of chess like that. It looked like an incredibly promising seven-year-old. We lost the game in just a few moves but it lost it brilliantly. <laughter> It got its queen out there, it maneuvered its knight, it launched a king side attack, it sacrificed its queen. <laughter> Well, of course it sacrificed its queen. Do you realize, in every single Grand Master game of chess, when you sacrifice your queen, it's phenomenally brilliant. You are winning the game. So if you can find a way to get your queen out there and sacrifice her, well, you've won.

AI as Sport

Quote by John McCarthy from AI as Sport ^[31]^[32]:

Besides AI work aimed at tournament play, particular aspects of the game have illuminated the intellectual mechanisms involved. Barbara Liskov demonstrated that what chess books teach about how to win certain endgames is not a program but more like a predicate comparing two positions to see if one is an improvement on the other. Such qualitative comparisons are an important feature of human intelligence and are needed for AI. Donald Michie, Ivan Bratko, Alen Shapiro, David Wilkins, and others have also used chess as a Drosophila to study intelligence. Newborn ignores this work, because it is not oriented to tournament play.

Selected Publications

^[33] ^[34]

1945

Jack Good, Donald Michie, Geoffrey Timms (1945). General Report on Tunny from The Turing Archive for the History of Computing

1960 ...

Donald Michie (1961). Trial and Error. Penguin Science Survey
John Maynard Smith, Donald Michie (1961). Machines that play games. New Scientist, 12, 367-9. google books ^[35]
Jim Doran, Donald Michie (1966). Experiments with the Graph Traverser Program. Proc. Roy. Soc. (A), Vol. 294, pp. 235-259.
Donald Michie (1966). Game Playing and Game Learning Automata. Advances in Programming and Non-Numerical Computation, Leslie Fox (ed.), pp. 183-200. Oxford, Pergamon. » Includes Appendix: Rules of SOMAC by John Maynard Smith, introduces Expectiminimax tree ^[36]
Donald Michie, Roger A. Chambers (1968). Boxes: An experiment on adaptive control. In E. Dale and D. Michie, editors, Machine Intelligence 2, Edinburgh: Oliver & Boyd, pp. 137-152, pdf

1970 ...

Donald Michie (1974). On Machine Intelligence. Edinburgh: University Press, ISBN 10: 085224262X, ISBN 13: 9780852242629, abebooks.com, alibris.com, biblio.com
Donald Michie (1976). AL1: a package for generating strategies from tables. ACM SIGART Bulletin, Issue 59
Donald Michie (1976). An Advice-Taking System for Computer Chess. Computer Bulletin, Ser. 2, Vol. 10, pp. 12-14. ISSN 0010-4531.
Donald Michie (1977). King and Rook Against King: Historical Background and a Problem on the Infinite Board. Advances in Computer Chess 1
Donald Michie, Ivan Bratko (1978). Advice Table Representations of Chess End-Game Knowledge. Proceedings 3rd AISB/GI Conference, pp. 194-200.
Ivan Bratko, Danny Kopec, Donald Michie (1978). Pattern-Based Representation of Chess Endgame Knowledge. The Computer Journal, Vol. 21, No. 2, pp. 149-153. available as pdf reprint
Donald Michie (1979). The Computer Attacks Moravec Problem. Personal Computing, Vol. 3, No. 10, pp. 73 ^[37]

1980 ...

Donald Michie (1980). Chess with Computers. Interdisciplinary Science Reviews. Vol. 5, No. 3, pp. 215-227. ISSN 0308-0188.
Ivan Bratko, Donald Michie (1980). An Advice Program For a Complex Chess Programming Task. Computer Journal, Vol. 23, No. 4, pp. 350-353.
Ivan Bratko, Donald Michie (1980). A Representation of Pattern-Knowledge in Chess Endgames. Advances in Computer Chess 2
Donald Michie (1981). A Theory of Evaluative Comments in Chess with a Note on Minimaxing. The Computer Journal, Vol. 24, No. 3, pp. 278-286. reprinted in Computer Chess Compendium
Jaap van den Herik (1981). Computer Chess Today and Tomorrow: An Interview with Donald Michie. Advances in Computer Chess 3, Computer Chess Digest Annual 1984
Donald Michie (1982). Chess with computers. Machine Intelligence and Related Topics. Gordon and Breach Science Publishers.
Donald Michie (1982). Information and Complexity in Chess. Advances in Computer Chess 3
Danny Kopec, Donald Michie (1983). Mismatch between machine representations and human concepts: dangers and remedies. FAST series No. 9 report. European Community, Brussels.
Donald Michie (1986). The superarticulacy phenomenon in the context of software manufacture. Proc. Roy. Soc. (A).
Donald Michie (1986). Towards a Knowledge Accelerator. Advances in Computer Chess 4
Alen Shapiro, Donald Michie (1986). A Self-commenting Facility for Inductively Synthesised Endgame Expertise. Advances in Computer Chess 4
Donald Michie, Ivan Bratko (1987). Ideas on Knowledge Synthesis Stemming from the KBBKN Endgame. ICCA Journal, Vol. 10, No. 1
Donald Michie, Ivan Bratko (1987). Ideas on Knowledge Synthesis - a Correction. ICCA Journal, Vol. 10, No. 2
Donald Michie (1989). Automating the Discovery of Structure in Time-Varying Data. Workshop on New Directions in Game-Tree Search
Donald Michie (1989). Brute Force in Chess and Science. ICCA Journal, Vol. 12, No. 3
Donald Michie, Michael Bain (1989). Machines That Learn and Machines That Teach. SCAI 1989
Stephen Muggleton, Michael Bain, Jean Hayes Michie, Donald Michie (1989). An Experimental Comparison of Human and Machine Learning Formalisms. 6. ML 1989, pdf

1990 ...

Donald Michie (1990). Brute Force in Chess and Science. Computers, Chess, and Cognition
Donald Michie, Ivan Bratko (1991). Comments to `Chunking for Experience'. ICCA Journal, Vol. 14, No. 1
Jean Hayes Michie, Donald Michie (1998). Simulator-Mediated Acquisition of a Dynamic Control Skill. AI & Sociaty Vol. 12 No. 1

External Links

Donald Michie from Wikipedia
The Mathematics Genealogy Project - Donald Michie
Curriculum Vitae - Professor Donald Michie
The Machine Intelligence series
Turing Trust - Historical Note by Donald Michie
Turing 1990 - Final Reminder From: Turing Conference
Artificial Intelligence - Recollections of the Pioneers

References

^ Professor Donald Michie, Telegraph.co.uk July 09, 2007
^ Obituary - Donald Michie by Stephen Muggleton, The Guardian, Tuesday July 10 2007
^ David Levy (2007). Obituary Donald Michie (1923-2007). ICGA Journal, Vol. 30 No. 3
^ Jack Good, Donald Michie, Geoffrey Timms (1945). General Report on Tunny from The Turing Archive for the History of Computing
^ From Codebreaking to Computing - Video from The Computer History Museum
^ Maynard Smith, J., Michie D. (1961). Machines that play games. New Scientist, 12, 367-9.
^ Chronology of Computing compiled by David Singmaster
^ Artificial Intelligence at Edinburgh University : a Perspective
^ Turing Trust - Historical Note by Donald Michie: "In association with the University of Strathclyde, the Turing Institute hosted seven public lectures in the period 1985-93"
^ Machine Intelligence Volume 4
^ Oral History of David Levy from The Computer History Museum
^ Donald Michie Home Page
^ László Lindner, A SZÁMÍTÓGÉPES SAKK KÉPEKBEN című melléklete - The pictures of the Beginning of Chess Computers
^ Donald Michie Home Page
^ Donald Michie (1961). Trial and Error. Penguin Science Survey
^ Martin Gardner (1969, 1991). The Unexpected Hanging and Other Mathematical Diversions. Simon & Schuster, University Of Chicago Press, Chapter 8: A Matchbox Game-Learning Machine
^ Donald Michie, Roger A. Chambers (1968). Boxes: An experiment on adaptive control. In E. Dale and D. Michie, editors, Machine Intelligence 2, Edinburgh: Oliver & Boyd, pp. 137-152
^ Alex Bell (1972). Games Playing with Computers. 1.3 NOUGHTS AND CROSSES, Allen & Unwin
^ UU/IT/AI exercise: Implementing MENACE, Uppsala University
^ Controller-less Driver For the Cart-Pole Problem
^ Q-Learning Controller for the Cart-Pole Problem
^ D. Michie CV
^ A New Theory of Awesomeness and Miracles by James Bridle
^ Menace - Flickr Photo stream
^ Mechanical computer uses matchboxes and beans to learn Tic-Tac-Toe - Boing Boing
^ Donald Michie (1977). King and Rook Against King: Historical Background and a Problem on the Infinite Board. Advances in Computer Chess 1
^ Michael Gherrity (1993). A Game Learning Machine. Ph.D. Thesis, University of California, San Diego, available as zipped postscript, page 13, 14
^ I remember Donald Michie (1923 – 2007) « A Programmers Place by Maarten van Emden, June 12, 2009
^ Donald Michie (1976). AL1: a package for generating strategies from tables. ACM SIGART Bulletin, Issue 59
^ Gardner Hendrie (2005). Oral History of Kathe and Dan Spracklen. pdf from The Computer History Museum
^ John McCarthy (1997). AI as Sport. Science, Vol. 276, June 6, pp. 1518-1519.
^ AI as Sport by John McCarthy
^ ICGA Reference Database (pdf)
^ D. Michie publications
^ Publications of John Maynard Smith (pdf)
^ see Swap-off by Helmut Richter
^ www.arves.org - Moravec, Josef 1882-1969

What links here?

Page	Date Edited
Aaron L. Futer	Dec 23, 2014
ACM 1990	Jun 7, 2016
Advances in Computer Chess 1	Oct 22, 2015
Advances in Computer Chess 2	Dec 25, 2017
Advances in Computer Chess 3	Jul 23, 2015
Advances in Computer Chess 4	Jan 22, 2018
Alan Turing	Feb 8, 2017
Albrecht Heeffer	Sep 6, 2016
Alen Shapiro	May 3, 2015
Algorithms	May 5, 2017
Artificial Intelligence	Apr 9, 2018
Belle	Jan 18, 2018
Brute-Force	Jul 27, 2017
Chess	Jan 21, 2018
Chess Position	Sep 10, 2017
Chess Problems, Compositions and Studies	Feb 19, 2018
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Computer Chess Compendium	Dec 29, 2015
Computers, Chess, and Cognition	Dec 28, 2016
Conferences	Dec 18, 2017
Danny Kopec	Oct 1, 2016
Dart	Jan 19, 2018
Dartmouth College	Dec 16, 2016
Dartmouth CP	Jan 19, 2018
David Levy	Jan 3, 2017
Dietrich Prinz	Oct 14, 2016
Dinesh Gadwal	May 23, 2016
Donald Michie	Dec 23, 2017
Eduardo F. Morales	May 23, 2016
Edward Fredkin	Oct 27, 2013
El Ajedrecista	Feb 25, 2015
Endgame	Sep 18, 2017
Endgame Tablebases	Mar 6, 2018
Ferranti Mark 1	Jun 2, 2015
Games	Feb 20, 2018
Georgy Adelson-Velsky	Apr 9, 2018
Hal Terrie	Feb 19, 2015
Hardware	Jan 20, 2018
Helmut Richter	Nov 29, 2017
History	Jan 2, 2018
ICGA Journal	Dec 21, 2017
Iterative Deepening	Jun 23, 2017
Ivan Bratko	Aug 16, 2017
Jaap van den Herik	Sep 18, 2017
Jack Good	Dec 22, 2017
Jack Holloway	Nov 1, 2015
Jean Hayes Michie	Feb 9, 2016
Jim Doran	May 21, 2014
John J. Scott	Aug 30, 2016
John Maynard Smith	Nov 27, 2017
John Moussouris	Nov 1, 2015
Jürg Nievergelt	Dec 28, 2016
Kathe Spracklen	Dec 25, 2017
Knowledge	Jul 22, 2017
KRK	Nov 26, 2016
Lancaster	Aug 30, 2016
Languages	Nov 26, 2017
Larry Harris	Apr 3, 2013
Learning	Feb 20, 2018
Maarten van Emden	May 23, 2016
Mac Hack	Apr 20, 2018
Machiavelli	Jun 2, 2015
Martin Gardner	May 10, 2017
Mathematician	Apr 9, 2018
Michael Bain	Aug 8, 2013
Mikhail Donskoy	Dec 23, 2017
Minimax	Dec 29, 2017
Papers	Jan 11, 2017
Pattern Recognition	Sep 8, 2017
Pawn Structure	Oct 2, 2017
People	Feb 28, 2018
Periodical	Dec 22, 2017
Personal Computing	Dec 27, 2017
Reinforcement Learning	Feb 12, 2018
Retrograde Analysis	Mar 21, 2017
Richard Greenblatt	Jan 19, 2016
Search	Feb 1, 2018
Search Tree	Dec 23, 2016
Shaun Wylie	Jun 2, 2015
SOMA	Mar 25, 2015
Static Exchange Evaluation	Dec 14, 2017
Stephen Muggleton	May 23, 2016
Strategy	Jan 18, 2018
The Computer History Museum	Aug 9, 2017
Tim Niblett	May 22, 2014
Tony Marsland	Nov 27, 2017
Trial and Error	Feb 11, 2018
Turochamp	Dec 14, 2017
University of Edinburgh	Nov 26, 2017
Vladimir Arlazarov	May 20, 2016
WCCC 1989	Dec 5, 2017
WMCCC 1984	Dec 31, 2017

Up one level

Edward Feigenbaum

GerdIsenberg — Sun, 03 Jan 2016 13:56:20 GMT

Home * People * Edward Feigenbaum

		Edward Albert Feigenbaum, an American electrical engineer, computer scientist, professor emeritus of computer science at Stanford University, and pioneer in developing expert systems in artificial intelligence, notably the Dendral project ^[1]. He received his Ph.D., 1960, in electrical engineering from Carnegie Mellon University under supervision of Herbert Simon, describing an Elementary Perceiver and Memorizer, dubbed EPAM, one of the first computer models on how to learn ^[2], influential in formalizing the concept of a chunk, as for instance in Fernand Gobet's CHREST (Chunk Hierarchy and REtrieval STructures) architecture. In 1960 Feigenbaum went to the University of California, Berkeley, to teach in the School of Business Administration. He joined the Stanford faculty in 1965 where he was chairman of the CS Department from 1976 to 1981. As professor emeritus at Stanford, Feigenbaum has focused interest, as a Board of Trustees member of The Computer History Museum, on preserving the history of computer science, and with the Stanford Libraries on software for building and using digital archives ^[3]. In September 2005, along with Monty Newborn, Murray Campbell, David Levy and John McCarthy, he participated on the panel discussion The History of Computer Chess: An AI Perspective at The Computer History Museum, Mountain View, California.
Edward Feigenbaum ^[4]

Selected Publications

Selected Publications

^[5] ^[6]

1959

Edward Feigenbaum (1959). An Information Processing Theory of Verbal Learning. RAND Paper

1960 ...

Edward Feigenbaum (1960). Information Theories of Human Verbal Learning. Ph.D. thesis, Carnegie Mellon University, advisor Herbert Simon
Edward Feigenbaum (1961). The Simulation of Verbal Learning Behavior. Proceedings Western Joint Conference, Vol. 19
Edward Feigenbaum, Herbert Simon (1961). Performance of a Reading Task by an Elementary Perceiving and Memorizing Program. RAND Paper, pdf
Edward Feigenbaum, Herbert Simon (1961). Forgetting in an association memory. ACM '61
Edward Feigenbaum, Herbert Simon (1962). A Theory of the Serial Position Effect. British Journal of Psychology, Vol. 53, 307-32, pdf
Edward Feigenbaum, Julian Feldman (eds.) (1963). Computers and Thought. McGraw-Hill, New York, N.Y.
Edward Feigenbaum, Herbert Simon (1963). Elementary Perceiver and Memorizer: Review of Experiments. in Symposium on Simulation Models
Herbert Simon, Edward Feigenbaum (1964). An Information-processing Theory of Some Effects of Similarity, Familiarization, and Meaningfulness in Verbal Learning. Journal of Verbal Learning and Verbal Behavior, Vol. 3, No. 5, pdf

1970 ...

Edward Feigenbaum (1977). The Art of Artificial Intelligence: Themes and Case Studies of Knowledge Engineering. IJCAI 1977
Bruce Buchanan, Edward Feigenbaum (1978). Dendral and Meta-Dendral: Their Applications Dimension. Artificial Intelligence, Vol. 11, No. 1-2

1980 ...

Robert K. Lindsay, Bruce Buchanan, Edward Feigenbaum, Joshua Lederberg (1980). Applications of Artificial Intelligence for Organic Chemistry: The DENDRAL Project. McGraw-Hill, New York, N.Y.
Avron Barr, Edward Feigenbaum (eds.) (1981). The Handbook of Artificial Intelligence. Vol. 1, HeurisTech Press
Avron Barr, Edward Feigenbaum (eds). (1982). The Handbook of Artificial Intelligence. Vol. 2, HeurisTech Press
Paul Cohen, Edward Feigenbaum (eds.) (1982). The Handbook of Artificial Intelligence. Vol. 3, HeurisTech Press
Edward Feigenbaum, Pamela McCorduck (1983). The Fifth Generation: Artificial Intelligence & Japan's Computer Challenge to the World. Addison-Wesley
Edward Feigenbaum, Herbert Simon (1984). EPAMlike models of recognition and learning. Cognitive Science, Vol. 8, 305-336, pdf

1990 ...

John McCarthy, Edward Feigenbaum (1991). In Memoriam. Arthur L. Samuel: Pioneer in Machine Learning. ICCA Journal, Vol. 14, No. 1 » Arthur Samuel
Edward Feigenbaum, Julian Feldman (eds.) (1995). Computers and Thought. MIT Press, ISBN-13: 978-0-262-56092-4
Edward Feigenbaum (1996). How the “What“ Becomes the “How“. Communications of the ACM, Vol. 39, No. 5, pdf, The Computer History Museum » Alan Turing
David D. Clark, Edward Feigenbaum, Juris Hartmanis, Robert W. Lucky, Robert Metcalfe, Raj Reddy, Mary Shaw (1998). Innovation and Obstacles: The Future of Computing. pdf

2000 ...

Edward Feigenbaum (2003). Some Challenges and Grand Challenges for Computational Intelligence. Journal of the ACM, Vol. 50, No. 1
Edward Feigenbaum (2005). Stories of AAAI - Before the Beginning and After: A Love Letter. AI Magazine, Vol. 26, No. 4
Edward Feigenbaum (2007). Happy Silver Anniversary, AI! AI Magazine, Vol. 27, No. 4

External Links

Edward Feigenbaum Homepage
Edward Feigenbaum from Wikipedia
Edward A Feigenbaum - A.M. Turing Award Winner
Fellow Awards - Edward Feigenbaum, The Computer History Museum
The Mathematics Genealogy Project - Edward Feigenbaum
The AI Genealogy Project :: Edward Feigenbaum
Oral History of Edward Feigenbaum Interviewed by: Nils J. Nilsson, June 20 and June 27, 2007, Mountain View, California, pdf from The Computer History Museum
Ed Feigenbaum's Search for A.I., YouTube Video
In 2006, a group of scientists, colleagues, and friends gathered at Stanford University for a 70th birthday symposium to celebrate the contributions of Edward A. Feigenbaum, an interdisciplinary computer scientist known as the father of Expert Systems and knowledge-based approaches to artificial intelligence...

References

^ Robert K. Lindsay, Bruce Buchanan, Edward Feigenbaum, Joshua Lederberg (1980). Applications of Artificial Intelligence for Organic Chemistry: The DENDRAL Project. McGraw-Hill, New York, N.Y.
^ AI's Hall of Fame (pdf), July/August 2011, Published by the IEEE Computer Society
^ Stanford University Libraries
^ Fellow Awards - Edward Feigenbaum, The Computer History Museum
^ Edward Albert Feigenbaum - ACM author profile page
^ DBLP: Edward A. Feigenbaum

What links here?

Page	Date Edited
AAAI	Mar 21, 2017
ACM	May 7, 2017
Alan Turing	Feb 8, 2017
Allen Newell	Jun 12, 2017
Alpha-Beta	Jan 28, 2018
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Carnegie Mellon University	Feb 12, 2018
CHREST	May 6, 2016
Chunking	Jun 12, 2017
Cliff Shaw	Apr 4, 2014
Cognition	Dec 8, 2017
Edward Feigenbaum	Jan 3, 2016
EPAM	Jul 15, 2017
Herbert Simon	Feb 11, 2016
History	Jan 2, 2018
ICGA Journal	Dec 21, 2017
John McCarthy	Jan 5, 2017
Learning	Feb 20, 2018
MANIAC I	Nov 17, 2016
Mathematician	Apr 9, 2018
NSS	Jul 14, 2015
Paul Rushton	Jan 12, 2015
People	Feb 28, 2018
Stanford University	Dec 7, 2017
University of California, Berkeley	Sep 5, 2016

Up one level

Edward Fredkin

GerdIsenberg — Sun, 27 Oct 2013 10:22:54 GMT

Home * People * Edward Fredkin

		Edward (Ed) Fredkin, (born 1934) an American physicist, computer scientist, pioneer of digital physics and advocate of digital philosophy. He was full professor at Massachusetts Institute of Technology, from 1971 to 1974 Director of Project MAC and more recently a Distinguished Career Professor at Carnegie Mellon University, at Boston University and a Visiting Professor at MIT. Fredkin has been broadly interested in computation, hardware as well as software. In the early 1960s, he wrote the first PDP-1 assembler at BBN. He is inventor of the trie data structure ^[1], the Fredkin gate and the Billiard-Ball Computer Model for reversible computing. His primary contributions include his work on reversible computing and cellular automaton. While Konrad Zuse's book, Calculating Space, mentioned the importance of reversible computation, the Fredkin gate represented the essential breakthrough ^[2]. He has further been involved in computer vision, artificial intelligence research, and computer chess. Ed Fredkin instrumented the original conception and hardware design of the Chess-orientated Processing System CHEOPS, which was used by Baisley's Tech 2 and a brute force version of Greenblatt's Mac Hack at the end of the 70s ^[3].
Edward Fredkin ^[4]

Photos

The Fredkin Prize

Teams honored at AAAI 97

Quotes

Selected Publications

External Links

References

What links here?

Photos



Ed Fredkin working on PDP-1 (1960 ca.) ^[5]

Claude Shannon, John McCarthy, Ed Fredkin and Joseph Weizenbaum (1966) ^[6]

The Fredkin Prize

In 1980, Carnegie Mellon University has announced the establishment of a $100,000 prize for the first computer program to become World Chess Champion and the beginning of annual computer versus human competition. The prize called Fredkin Prize, has been established by the Fredkin Foundation of Cambridge, Massachusetts ^[7], to encourage continued research progress in computer chess. The prize was three-tiered ^[8]:

The first award of $5,000 was given to Ken Thompson and Joe Condon from Bell Laboratories, who in 1981 developed the first chess machine to achieve master status.
Seven years later, the intermediate prize of $10,000 for the first chess machine to reach international master status was awarded in 1989 to five Carnegie Mellon graduate students who built Deep Thought, the precursor to Deep Blue, at the university.
The $100,000 third tier of the prize was awarded at AAAI–97 to this IBM team, who built the first computer chess machine that beat a world chess champion.

Teams honored at AAAI 97

^[9]

Mac Hack 6, developed by Richard Greenblatt at the Massachusetts Institute of Technology, was the first computer program to play in a human chess tournament. It was the first program to play and win in a tournament game in 1967.
The Northwestern University computer chess program, developed by David Slate and Larry Atkin from the 1960s to the early 1980s, won several computer chess championships during the 1970s, including the computer world championship in 1977.
Belle, developed by Ken Thompson and Joe Condon at Bell Labs, was the first chess program to obtain the United States Chess Federation Master title in 1983. It was awarded the first Fredkin Prize of $5,000 for this achievement.
Hitech, developed at Carnegie Mellon by Hans Berliner, Carl Ebeling, Murray Campbell and Gordon Goetsch, was the first system to achieve a Senior Master’s level of performance in 1988.
Deep Thought, developed at Carnegie Mellon by Thomas Anantharaman, Murray Campbell, Feng-hsiung Hsu, Andreas Nowatzyk and Mike Browne, was the first system to play at the Grandmaster level. Deep Thought was awarded the $10,000 Fredkin Intermediate Prize for this achievement in 1989 ^[10].
Deep Blue, a parallel supercomputer that processes an average of 200 million chess positions per second, is the first chess machine to draw and beat a world chess champion in a regulation game, and the first chess machine to beat the world champion in a regulation match.

Quotes

“There has never been any doubt in my mind that a computer would ultimately beat a reigning world chess champion,” said Fredkin. “The question has always been when.”

Selected Publications

^[11] ^[12]

Edward Fredkin (1960). Trie Memory. Communications of the ACM, 3 (9): 490–499.
Edward Fredkin and Tommaso Toffoli (1978). Design principles for achieving high-performance submicron digital technologies. Proposal to DARPA, MIT Laboratory for Computer Science.
Edward Fredkin and Tommaso Toffoli (1982). Conservative logic. International Journal of Theoretical Physics, 21 :219–253, on Fredkin gate and Toffoli gate, pdf
Robert Wright (1989). Three Scientists and Their Gods: Looking for Meaning in an Age of Information. HarperCollins, ISBN 0-06-097257-2, amazon.com, profiles of Edward Fredkin, Edward O. Wilson, and Kenneth Boulding
Edward Fredkin (1990). Digital Mechanics - An Informational Process Based on Reversible Universal Cellular Automata. Department of Physics, Boston University
Edward Fredkin (1992). A New Cosmogony. Department of Physics, Boston University
Edward Fredkin (1992). Finite Nature. Department of Physics, Boston University
Edward Fredkin (2000). On the Soul. (2000 Draft)
Edward Fredkin (2004). Five big questions with pretty simple answers. IBM Journal of Research and Development 48(1): 31-46
Edward Fredkin (2005). A computing architecture for physics. Conf. Computing Frontiers 2005: 273-279
Daniel B. Miller, Edward Fredkin (2005). Two-state, Reversible, Universal Cellular Automata in Three Dimensions, Proceedings of the 2nd Conferece on Computing Frontiers, Ischia, Italy: ACM, pp. 45–51

External Links

Edward Fredkin from Wikipedia
Fredkin finite nature hypothesis from Wikipedia
Links & Resources in Philosophy & Physics
Digital Philosophy.org > Home
The Mouse That Roared: PDP-1 Celebration Event Lecture, May 15, 2006 (1:53:44) Mountain View, CA, USA: © 2006, The Computer History Museum. Panel discussion including Alan Kotok (53:50) and John McCarthy (1:27:20), moderated by Edward Fredkin from 17:40, YouTube Video

References

^ Edward Fredkin (1960). Trie Memory. Communications of the ACM, 3 (9): 490–499
^ Edward Fredkin from Wikipedia
^ John Moussouris, Jack Holloway and Richard Greenblatt (1979). CHEOPS: A Chess-orientated Processing System. Machine Intelligence 9 (Jean Hayes Michie, Donald Michie and L.I. Mikulich editors) Ellis Horwood, Chichester, 1979, pp. 351-360. Reprinted (1988) in Computer Chess Compendium
^ Robotics Institute: Visiting Research Professional Edward Fredkin, Carnegie Mellon University
^ Ed Fredkin working on PDP-1 (1960 ca.), from The Computer History Museum
^ Weizenbaum. Rebel at Work. A documentary by Peter Haas and Silvia Holzinger
^ Ben Mittman (1980). $100,000 Prize Established. ICCA Newsletter, Vol. 3, No. 1
^ Carol McKenna Hamilton and Sara Hedberg (1997). Modern Masters of an Ancient Game. AI Magazine Volume 18 Number 4, pdf
^ Sara Hedberg (1997). AAAI-97 Highlights - Developments in the AI Field. AI Magazine Volume 18 Number 4, pdf
^ Hans Berliner (1989). Deep Thought Wins Fredkin Intermediate Prize. AI Magazine Volume 10 Number 2, pdf
^ Digital Philosophy - Documents
^ DBLP: Edward Fredkin

What links here?

Page	Date Edited
Advances in Computer Chess 4	Jan 22, 2018
Alan Kotok	Sep 21, 2014
Andreas Nowatzyk	Feb 6, 2014
Belle	Jan 18, 2018
Ben Mittman	Jan 2, 2017
Carnegie Mellon University	Feb 12, 2018
CHEOPS	Apr 18, 2015
Combinatorial Logic	Apr 6, 2017
Deep Thought	Dec 5, 2016
Edward Fredkin	Oct 27, 2013
General Setwise Operations	Feb 25, 2018
HiTech	Mar 31, 2018
ICGA Journal	Dec 21, 2017
John McCarthy	Jan 5, 2017
Konrad Zuse	Apr 30, 2015
Mac Hack	Apr 20, 2018
Marvin Minsky	Jan 29, 2016
Massachusetts Institute of Technology	Jan 24, 2017
Mike Browne	May 7, 2013
Murray Campbell	Jun 2, 2017
PDP-1	Oct 27, 2013
People	Feb 28, 2018
Personal Computing	Dec 27, 2017
Thomas Anantharaman	Jan 27, 2016
Tom Mitchell	May 23, 2016
Tony Marsland	Nov 27, 2017

Up one level

Ernst Zermelo

GerdIsenberg — Mon, 08 Sep 2014 09:45:04 GMT

Home * People * Ernst Zermelo

		Ernst Friedrich Ferdinand Zermelo, (July 27, 1871 – May 21, 1953) a German mathematician and pioneer in set- and game theory. His university bibliography includes the Humboldt University of Berlin 1894, the University of Göttingen 1899, honorary professorship in Zürich 1910, and the University of Freiburg since 1926. During the Third Reich, in 1935 disciplinary actions were initiated against him, because he refused the Hitler salute. To preempt of his dismissal, as a result he withdrew voluntarily. In 1946 he was reinstated in Freiburg ^[1] .
Ernst Zermelo ^[2]

Set Theory

In 1900, Zermelo proved the well-ordering theorem, which states that every set can be well ordered. This gave rise to the Zermelo axiom that every class can be well ordered. In 1904 Zermelo defined the axiom of choice ^[3] , the use of which had previously been unrecognized in mathematical reasoning. The first formulations of axioms for set theory - an axiom system for German mathematician Georg Cantor's theory of sets ^[4] - were made by Zermelo in 1908.

Game Theory

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 ^[5]. Zermelo's theorem is the mathematical justification for the retrograde analysis chess algorithm ^[6] ^[7] .

Tournament Results

Zermelo published a paper about "The calculation of the tournament results as a maximum problem of the probability calculus" in 1929 ^[8] .

Publications

Ernst Zermelo (1904). Beweis, daß jede Menge wohlgeordnet werden kann. Mathematische Annalen 59: 514–16 (German)
Ernst Zermelo (1908). Untersuchungen über die Grundlagen der Mengenlehre I. Mathematische Annalen 65: 261–81 (German)
Ernst Zermelo (1913). Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. Proc. Fifth Congress Mathematicians, (Cambridge 1912), Cambridge Univ. Press 1913, 501–504. Translation: On an Application of Set Theory to the Theory of the Game of Chess. ^[9]
Dénes Kőnig (1927). Über eine Schlussweise aus dem Endlichen ins Unendliche. Acta Scientiarum Mathematicarum (University of Szeged)
Ernst Zermelo (1929). Die Berechnung der Turnier-Ergebnisse als ein Maximumproblem der Wahrscheinlichkeitsrechnung. pdf (German)
Ulrich Schwalbe and Paul Walker (1997). Zermelo and the early history of game theory. pdf
Christoph Eichhorn ^[10] (2004). Der Beginn der Formalen Spieltheorie: Zermelo (1913). pdf (German)
Heinz-Dieter Ebbinghaus (2007). Ernst Zermelo: An Approach to his Life and Work. Springer, 1 edition, amazon
Dan Heisman (2009). Steinitz, Zermelo, and Elkies. pdf from ChessCafe.com, on Wilhelm Steinitz, Ernst Zermelo and Noam Elkies
Daniel Andersson (2009) Perfect-Information Games with Cycles. Ph.D. thesis, Aarhus University, advisor Peter Bro Miltersen, pdf

External Links

Ernst Zermelo from Wikipedia
Well-ordering theorem from Wikipedia
Zermelo's theorem (game theory) from Wikipedia
Zermelo–Fraenkel set theory from Wikipedia » Abraham Fraenkel
Zermelo, Ernst Friedrich Ferdinand from The Free Dictionary
Ernst Zermelo biography from JOC/EFR © February 1999
Ernst Zermelo from the Mathematics Genealogy Project
Details for Ernst Zermelo - Oberwolfach Photo Collection
Ernst Zermelo publiziert sein Axiomensystem der Mengenlehre (German)
15. Backward induction: chess, strategies, and credible threats, YouTube Video
Yale Course by Ben Polak, covers Zermelo's theorem

References

^ Seminar für überfachliche Grundlagen: Mathematiker in der NS-Zeit (German) Zermelo refuses Hitler salute
^ Ernst Zermelo Photos
^ Ernst Zermelo (1904). Beweis, daß jede Menge wohlgeordnet werden kann. Mathematische Annalen 59: 514–16 (German)
^ Controversy over Cantor's theory from Wikipedia
^ Ernst Zermelo (1913). Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. Proc. Fifth Congress Mathematicians, (Cambridge 1912), Cambridge Univ. Press 1913, 501–504. Translation: On an Application of Set Theory to the Theory of the Game of Chess.
^ Edward Komissarchik, Aaron L. Futer (1974). Ob Analize Ferzevogo Endshpilya pri Pomoshchi EVM. (Analysis of a queen endgame using an IBM computer) Problemy Kybernetiki, Vol. 29, pp. 211-220. English translation by Christian Posthoff, revised as Edward Komissarchik, Aaron L. Futer (1986). Computer Analysis of a Queen Endgame. ICCA Journal, Vol. 9, No. 4
^ Lewis Stiller (1995). Exploiting symmetry on parallel architectures. Ph.D. Thesis, pdf
^ Ernst Zermelo (1929). Die Berechnung der Turnier-Ergebnisse als ein Maximumproblem der Wahrscheinlichkeitsrechnung. pdf (German)
^ see Appendix in Ulrich Schwalbe and Paul Walker (1997). Zermelo and the early history of game theory. pdf
^ Artikel zur Vorlesung "Spieltheorie" (German)

What links here?

Page	Date Edited
Aaron L. Futer	Dec 23, 2014
Dan Heisman	Jun 12, 2013
Edward Komissarchik	May 20, 2016
Ernst Zermelo	Sep 8, 2014
Evaluation	Feb 1, 2018
Games	Feb 20, 2018
General Setwise Operations	Feb 25, 2018
History	Jan 2, 2018
Kaissa	Apr 9, 2018
Match Statistics	Mar 31, 2018
Mathematician	Apr 9, 2018
Noam Elkies	Apr 6, 2017
People	Feb 28, 2018
Point Value by Regression Analysis	Aug 26, 2017
Retrograde Analysis	Mar 21, 2017

Up one level

Georgy Adelson-Velsky

GerdIsenberg — Mon, 09 Apr 2018 18:49:26 GMT

Home * People * Georgy Adelson-Velsky

		Georgy Maximovich Adelson-Velsky, (Гео́ргий Макси́мович Адельсо́н-Ве́льский, January 8, 1922 - April 26, 2014) was a Soviet and Israeli mathematician, computer scientist and computer chess pioneer, most famous for inventing the AVL tree along with Evgenii Landis ^[1], 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 ^[2] ^[3]. In the 90s, Adelson-Velsky emigrated to Israel and lived in Ashdod ^[4], at times affiliated with the Technion, and Mathematics & Computer Science department of Bar-Ilan University ^[5]. Georgy Adelson-Velsky died on April 26, 2014, aged 92, in Giv'atayim, Israel ^[6] ^[7].
Adelson-Velsky in Moscow 1980 ^[8]

Computer Chess

Since the late 50s, at Kronrod's Institute of Theoretical and Experimental Physics, Georgy Adelson-Velsky worked along with Kronrod, Alexander Brudno, Mikhail Bongard, Evgenii Landis, Nikolay Konstantinov, Vladimir Arlazarov et al. on heuristic and game programming, where they elaborated on the foundations of computer chess. Since 1963 ^[9] at ITEP, Georgy Adelson-Velsky co-developed the ITEP Chess Program, along with Vladimir Arlazarov, Anatoly Uskov and Alexander Zhivotovsky, advised by Russian chess master Alexander Bitman and three-time world champion Mikhail Botvinnik ^[10].

At the end of 1966 a four game match began between the Kotok-McCarthy-Program, running on a IBM 7090 computer, and the ITEP Chess Program on a Soviet M-2 ^[11] computer. The match played over nine months was won 3-1 by the ITEP program. In 1971, along with Mikhail Donskoy and Vladimir Arlazarov, Georgy Adelson-Velsky became primary author of Kaissa, winner of the first computer chess championship 1974 in Stockholm.

Photos



Georgy Adelson-Velsky and John McCarthy playing chess, Soviet-American computer science conference, Urgench, 1979 ^[12]

Adelson-Velsky explaing his work on the analysis of the Minimax algorithm, Moscow 1980 ^[13] ^[14]

Quotes

Official Information

by Mikhail Donskoy (1999) on Kaissa ^[15]

Georgy Adelson-Velsky - one of the first Soviet programmers (together with Alexander Kronrod, Alexander Brudno, Evgenii Landis and others). He was occupied by the programs, connected with nuclear physics at ITEP, where he devised many algorithms which became classical. Especially the equilibrium binary trees, which in the entire world are called AVL trees after the names of the authors - Adelson-Velsky and Landis. After short-term teaching at MGU he worked at IPU and VNIISI (All-Union Scientific Research Institute of Sanitary Testing) on discrete algorithms, network planning and artificial intelligence. He now lives in Israel and works at Technion on NP problems of complete tasks.

Remembering A.S. Kronrod

Quote from Remembering A.S. Kronrod by Evgenii Landis and Isaak Yaglom ^[16]:

Intellectual Foundations

Quote from Biography AS Kronrod by Alexander Yershov ^[17]

Hashing

Quote from Mikhail Donskoy's life cycle of a programmer ^[18]:

AVL Trees

Dinitz

Anecdote by Yefim Dinitz from his talk at Shimon Even's retiring party, November 2003 ^[19], revised version in Dinitz' Algorithm: The Original Version and Even's Version ^[20] ^[21]:

The following anecdote sheds some light on how things were done in the USSR. Shortly after the "iron curtain" fell in 1990, an American and a Russian, who had both worked on the development of weapons, met. The American asked: "When you developed the Bomb, how were you able to perform such an enormous amount of computing with your weak computers?". The Russian responded: "We used better algorithms." This was really so. Russia had a long tradition of excellence in Mathematics. In addition, the usual Soviet method for attacking hard problems was to combine pressure from the authorities with people's enthusiasm. When Stalin decided to develop the Bomb, many bright mathematicians, e.g. Israel Gelfand and my first Math teacher, Alexander Kronrod, put aside their mathematical studies and delved deeply into the novel area of computing. They have assembled teams of talented people, and succeeded. The teams continued to grow and work on the theory of computing. The supervisor of my M.Sc. thesis was Georgy Adelson-Velsky, one of the fathers of Computer Science. Among the students in his group were M. Kronrod (one of the future "Four Russians", i.e. the four authors of ^[22]), A. Karzanov (the future author of the O(n3) network flow algorithm ^[23] ) and other talented school pupils of A. Kronrod. This was in 1968, long after the Bomb project completed. The work on the foundations of the chess program "Kaissa", created by members of A. Kronrod's team under guidance of Adelson-Velsky, was almost finished; "Kaissa" won the first world championship in 1974. Adelson-Velsky's new passion became discrete algorithms, which he felt had a great future. The fundamental contribution of Adelson-Velsky to Computer Science was AVL-trees. He (AV) and Evgenii Landis (L) published a paper about AVL-trees in early 60's, consisting of just a few pages. Besides solving an important problem, it presented a bright approach to data structure maintenance. While this approach became standard in the USSR, it was still not known in the West. No reaction followed their publication during a couple of years, until another paper, 15 pages long, was published by a researcher, which understood how AVL-trees work and explained this to the Western community, in its language. Since then, AVL-trees and the entire data structure maintenance approach became a corner-stone of Computer Science.

Ershov and Shura-Bura

Quote from The Early Development of Programming in the USSR by Andrey Ershov, Mikhail R. Shura-Bura ^[24]

Donskoy

Quote by Mikhail Donskoy from a Radio Liberty interview on an anecdote concerning Georgy Adelson-Velsky and AVL trees^[25] ^[26]:

One of my teachers, Georgy Adelson-Velsky, wrote an excellent report, "How did chess programs influence the development of programming". He lectured it in a strange way - at a congress in geophysics. In particular, the famous AVL trees were invented for chess programs at ITEP. I happened to be in Canada with Adelson-Velsky, at the University of Waterloo, where we were invited. There are three Faculties of Computational Mathematics, one way or another related to computer science and programming. One of them is, more or less, department of AVL trees. Can you imagine the scene when Adelson-Velsky himself (AVL stands for Adelson-Velsky and Evgenii Landis - two authors) comes to a department bearing his name, with a head of the department, three full professors, and six assistant professors, a myriad of graduate students and all who study his works. We were seated at a place of honor. Adelson-Velsky did not speak English and I translated. They asked the fundamental question: "How do you feel about the AVL-tree today?". This was 20, maybe 30 years after the invention. Then Adelson-Velsky, a typical scientist, small and hunchbacked with glasses, said with his high voice: "Yes, AVL-trees - this was a mistake of my youth". I replied to him "Georgy Maximovich, should I translate that directly?". His honesty has always distinguished the crystal. He said yes, and I translated. Soon the department head said "You know, our guests are tired from the journey and need to rest". God forbid again Adelson-Velsky says that AVL-trees are nonsense again - their monthly salary exceeds two or three years' of Adelson's income ...

The chronology of the events

Quotes by Mikhail Donskoy on the History of Kaissa ^[27]

1963 - beginning of the works on the first Soviet chess program in the Institute of Theoretical and Experimental Physics (ITEP) in the laboratory under Alexander Kronrod's management. The first authors - Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman, Alexander Zhivotovsky, Anatoly Uskov, A. Leman, M. Rozenfeld.

1967 - first international match of chess programs. Competed the program ITEP and the program of Stanford University, made under the management John McCarthy. McCarthy is famous fact that in 1952 on the beach in San Diego together with Alan Turing devised the word combination of "Artificial Intelligence", and fact that he is the author of the language Lisp - the first programming language, specially created for the tasks in the problems of artificial intelligence. Regulations of the match - four games. From the side of Stanford played one and the same version, from the ITEP side - two, which were being distinguished by the depth of search. Moves were transferred by the telegraph once a week (this to those- that times from "yadernogo" institute!). Match continued entire year and ended with the score the 3:1 in favor of ITEP.

1969 - a letter in support of mathematician Esenin-Volpin (son of poet) and his incorrect psychiatric confinement, among others signed by Alexander Kronrod and Georgy Adelson-Velsky. As a result, the laboratory was disbanded and its major portion under Vladimir Arlazarov's management, but without Kronrod, after a certain time he settled in Institute of Control Sciences (ICF).

1970 - the mechanic mathematical department of MGU finished the entire group of the students of Alexander Kronrod and Georgy Adelson-Velsky, that was being occupied in the famous seminar for discrete algorithms. Sums of the seminar:
For Georgy Adelson-Velsky it was forbidden to teach in MGU

Visit from Canada

Tony Marsland and Monty Newborn on Georgy Adelson-Velsky in their report of their USSR visit, December 1980 ^[28]:

Adelson-Velsky, an extremely capable and animated scientist and a real pleasure to meet, generally led our technical discussions. His eyes seemed to glisten with enthusiasm when he spoke. Discussions centered around probabilistic analyses of various aspects of the minimax algorithm and parallel search of chess trees. Our first joint seminar on alpha-beta analysis and the impact of computer technology was attended by about thirty people, including Leonid Kantorovich, winner of the 1975 Nobel Prize in Economics for his work on linear programming.

Selected Publications

^[29] ^[30] ^[31] ^[32] ^[33]

1957 ...

Georgy Adelson-Velsky, Yuli A. Shreider (1957). The Banach mean on groups. Uspekhi Matematicheskikh Nauk, Vol. 12, No. 6

1960 ...

Georgy Adelson-Velsky, Evgenii Landis (1962). An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences, 146: 263–266. (Russian) English translation by Myron J. Ricci in Soviet Mathematics Doklady, No. 3 ^[34]

1970 ...

Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman, Alexander Zhivotovsky, Anatoly Uskov (1970). Programming a Computer to Play Chess. Russian Mathematical Surveys, Vol. 25, pp. 221-262.
Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1975). Some Methods of Controlling the Tree Search in Chess Programs. Artificial Intelligence, Vol. 6, No. 4, pp. 361-371. ISSN 0004-3702. Reprinted (1988) in Computer Chess Compendium pp. 129-135. ^[35]
Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1977). On the Structure of an Important Class of Exhaustive Problems and Methods of Search Reduction for them. Advances in Computer Chess 1
Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1979). Algorithms of adaptive search. Machine Intelligence 9 (eds. Jean Hayes Michie, Donald Michie and L.I. Mikulich), pp. 373-384. Ellis Horwood, Chichester

1980 ...

Georgy Adelson-Velsky, V. P. Akimov, Vladimir Arlazarov (1981). On a probabilistic approach tо verification of the Shannon game model. Avtomatika i Telemekhanika, No. 9, 138–144
Г.М. Адельсон-Вельский, В.Л. Арлазаров, А.Р. Битман, М.В. Донской (1983). Машина играет в шахматы, pdf (book with detailed explanations of Kaissa algorithms, language: Russian)
Georgy Adelson-Velsky, V. P. Akimov (1987). On validity of Shannon's game model. Avtomatika i Telemekhanika, No. 1, 171–173
Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (1988). Algorithms for Games. Springer-Verlag, New York, NY. ISBN 3-540-96629-3. amazon.com

2000 ...

Georgy Adelson-Velsky, Eugene Levner (2002). Project scheduling in AND-OR graphs: a generalization of Dijkstra’s algorithm. Mathematics of Operations Research, Vol. 27, No. 3

Forum Posts

Early Reference on Bit-Boards by Tony Warnock, rgc, October 29, 1994
Kaissa & Botvinik by Shay Bushinsky, rgcc, October 16, 1997
Method of Analogies?? by Bruce Cleaver, CCC, May 29, 1998

External Links

Georgy Adelson-Velsky from Wikipedia
The Mathematics Genealogy Project - Georgiy Adelson-Velsky
Georgy M. Adelson-Velsky Biography, Dynkin Collection
Interview with Georgy Adelson-Velsky (pdf) by Eugene Dynkin, Moscow, September 1, 1990
Facts about Georgy Adelson-Velsky - Evi
Photos of Georgy M Adelson-Velsky (1922 - 2014) - ForeverMissed.com
Памяти Г. М. Адельсон-Вельского | Facebook
Адельсон Вельский Г.М. рассказывает 2002 год, YouTube Video

References

^ Georgy Adelson-Velsky, Evgenii Landis (1962). An algorithm for the organization of information. Proceedings of the USSR Academy of Sciences, 146: 263–266. (Russian) English translation by Myron J. Ricci in Soviet Mathematics Doklady, No. 3
^ The Mathematics Genealogy Project - Georgiy Adelson-Velsky
^ Interview with Georgy Adelson-Velsky (pdf) by Eugene Dynkin, Moscow, September 1, 1990
^ Georgi Maximowitsch Adelson-Welski - Wikipedia.de (German)
^ Kaissa & Botvinik by Shay Bushinsky, rgcc, October 16, 1997
^ Georgy Adelson-Velsky from Wikipedia
^ Misha Furman - RIP: Георгий Максимович Адельсон-Вельский, April 26, 2014
^ Photo by Monroe Newborn from History of Computer Chess from The Computer History Museum
^ История компьютерных игр. Виртуальный компьютерный музей. Англо-Русский компьютерный словарь. Вычисления в докомпьютерную эпоху. Технологии. Компьютерные игры. История развития электросвязи. История развития ПО. История вычислительной техники в России и за рубежом from the Russian Virtual Computer Museum
^ International Grandmaster and World Champion Mikhail Botvinnik in Moscow, 1980, Gift of Monroe Newborn, "Botvinnik served as a consultant to Soviet computer chess developers who developed an early program at ITEP which won a correspondence chess match against a Stanford University chess program led by John McCarthy in 1967. Later he advised the team that created the chess program Kaissa at Moscow’s Institute for Control Science"
^ The Fast Universal Digital Computer M-2 from the Russian Virtual Computer Museum
^ Photos of Georgy M Adelson-Velsky (1922 - 2014) - ForeverMissed.com, shared by: Семен Карпенко, June 01, 2014
^ Tony Marsland, Monty Newborn (1981). A brighter future for Soviet computer chess? ICCA Newsletter, Vol. 4, No. 1, pdf
^ Photo Computer chess pioneer Adelson-Velsky at chalkboard in Moscow 1980 by Monroe Newborn, History of Computer Chess from The Computer History Museum
^ История “Каиссы” Михаил Донской from Russian Virtual Computer Museum (no longer available) translated with the help of Babel Fish and promt translator
^ Evgenii Landis, Isaak Yaglom (1987). Remembering A.S. Kronrod. (2002). Translation by Viola Brudno, Edited by Walter Gautschi, ps
^ Биография А.С. Кронрода, Biography AS Kronrod by Alexander Yershov (translated by Google Translate)
^ Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ (Russian) Mikhail Donskoy - The life cycle of a programmer translated by Google Translate, polit.ru August 20, 2008
^ Yefim Dinitz talk at Shimon Even's Party (2003) hosted by Oded Goldreich
^ Yefim Dinitz (2006). Dinitz' Algorithm: The Original Version and Even's Version. Theoretical Computer Science, Springer, pdf, transliteration of names adapted
^ Dinic's algorithm from Wikipedia
^ Vladimir Arlazarov, E. A. Dinic, M. A. Kronrod, I. A. Faradzhev (1970). On economical construction of the transitive closure of a directed graph. Doklady Akademii Nauk (in English) 194, No. 11, 1209-1210
^ Alexander V. Karzanov (1974). Determining the maximal flow in a network by the method of preflows. Soviet Mathematics - Doklady, Vol. 15, No. 1
^ Andrey Ershov, Mikhail R. Shura-Bura (1980). The Early Development of Programming in the USSR. in Nicholas C. Metropolis (ed.) A History of Computing in the Twentieth Century. Academic Press, preprint pp. 44
^ Радио Свобода: Программы: Интернет - Not very serious about digital, Radio Liberty interview with Michael Schwartzman and Mikhail Donskoy, December 31, 2002, translated by Google Translate
^ Lecture Materials | Algorithms and Data Structures | University of Waterloo
^ "Каисса" - Историю программы рассказывает один из ее создателей Михаил Донской - Kaissa by Mikhail Donskoy, translated by Google Translate
^ Tony Marsland, Monty Newborn (1981). A brighter future for Soviet computer chess? ICCA Newsletter, Vol. 4, No. 1, pdf
^ Персоналии: Адельсон-Вельский Г М
^ zbMATH - Adelson-Velsky, George M.
^ dblp: George M. Adelson-Velsky
^ dblp: Georgii M. Adelson-Velsky
^ dblp: G. M. Adelson-Velskiy
^ AVL tree from Wikipedia
^ Method of Analogies?? by Bruce Cleaver, CCC, May 29, 1998

What links here?

Page	Date Edited
Alexander Bitman	Jun 2, 2015
Alexander Brudno	Apr 9, 2018
Alexander Kronrod	Apr 9, 2018
Alexander Zhivotovsky	Sep 10, 2013
Algorithms	May 5, 2017
Anatoly Uskov	Jan 7, 2016
Bar-Ilan University	Feb 15, 2017
Bitboards	Nov 14, 2017
CAPS	Dec 23, 2017
Chess	Jan 21, 2018
Computer Chess Compendium	Dec 29, 2015
Data	Nov 26, 2017
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
Evaluation Overlap	Jul 19, 2016
Games	Feb 20, 2018
Georgy Adelson-Velsky	Apr 9, 2018
Hartmut Tanke	Sep 7, 2014
Hex	Dec 29, 2017
History	Jan 2, 2018
Institute of Control Sciences	Jun 2, 2015
Institute of Theoretical and Experimental Physics	Sep 8, 2015
ITEP Chess Program	Apr 2, 2014
John McCarthy	Jan 5, 2017
Kaissa	Apr 9, 2018
M-2	Sep 10, 2013
M-20	Oct 9, 2013
Mathematician	Apr 9, 2018
Mikhail Botvinnik	Jul 15, 2017
Mikhail Donskoy	Dec 23, 2017
Moscow State University	May 20, 2016
Null Move Pruning	Dec 2, 2017
People	Feb 28, 2018
Pioneer	Dec 23, 2017
Point Value by Regression Analysis	Aug 26, 2017
Quote Donskoy	Dec 2, 2013
Quote Donskoy on AVL	Apr 2, 2014
Quote Remembering Kronrod	Dec 2, 2013
Quote Shura-Bura	Dec 2, 2013
Quote Yershov	Dec 2, 2013
Search	Feb 1, 2018
Search Tree	Dec 23, 2016
Sloppy	Sep 17, 2016
Stanford-ITEP Match	Apr 9, 2018
Trajectory	Jan 3, 2015
University of Waterloo	Jan 29, 2018
Vladimir Arlazarov	May 20, 2016
WCCC 1974	Jan 19, 2018
WCCC 1977	Dec 22, 2017
WCCC 1989	Dec 5, 2017

Up one level

Herbert Simon

GerdIsenberg — Thu, 11 Feb 2016 10:07:43 GMT

Home * People * Herbert Simon

		Herbert Alexander Simon, (June 15, 1916 – February 9, 2001) 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 ^[1] and the Nobel Memorial Prize in Economics for his pioneering research into the decision-making process within economic organizations (1978) ^[2].
Herbert A. Simon ^[3]

Selected Publications

Photos



Herbert Simon and Allen Newell, 1958 ^[4]

Herbert Simon ^[5]

NSS

In the late 50s, Allen Newell, Cliff Shaw, and Herbert Simon developed the chess program NSS. It was written in a high-level language. With Allen Newell, Herbert Simon was inventor of the alpha-beta algorithm - which was independently invented by John McCarthy, Arthur Samuel and Alexander Brudno. In 1957 Herbert Simon said that within 10 years, a digital computer would be the world's chess champion ^[6].

Quotes

John McCarthy

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 ^[7]:

Hans Berliner

Hans Berliner in A Life's Appraisal ^[8] :

Herbert Simon thought of himself as a Renaissance man. He was involved in many enterprises, and had a knack for appearing at or near the top in most of them. In 1978, he received a Nobel Prize in economics for nearly forgotten work he had done decades before, and he slept in unheated barracks in China and learned to read Chinese in order to acquaint himself with the Mainland way of doing things while offering what he could.

His detractors would say he dabbled a great deal, could always be counted on to be there at the finish line, could provide a reprint of any of the thousands of papers he had ever written at a moment's notice, and was arrogant in a very refined kind of way.

For me, Herb Simon was the guy who in 1956 at his inaugural address as President of the Operations Research Society of America predicted that within 10 years a computer would be World Chess Champion unless it were barred from the competition. I had seen the articles on the Rand Corp. chess program authored by Newell, Simon, and Shaw that this prediction was based upon, and I laughed, because I knew too much about chess, and did not see anything resembling the kind of play that was required to even play at the Master level. Here again was a situation typical of Herb's career. Many looked in wonder, and many looked with disdain. To make such a prediction was not a very scientific thing to do. The program had never played a tournament game. Even when playing against people who were touted as being champions of something-or-another it showed rather serious weaknesses. But Herb always liked being there first.

In later years when I discussed this prediction with him (he vehemently rooted for computers ever after, even if, as DEEP BLUE, they did not play chess in the style of Cognitive Psychology), he always said that it was important for science to make such predictions as they galvanized the field toward certain important goals. And he would point out DaVinci's drawings of man flight, and other things. To him it was important to push the ball along, and just how scientific it was, could be left for future appraisals. Yet Herb was one of the first members of the National Academy of Science to come from the ranks of the soft sciences rather than from Engineering, Physics and Chemistry. As such he opened the door for things that this nation (US) sorely needed to examine.

I first met Herb at a meeting in 1967, where he was an invited speaker. I chatted with him after his presentation, and was surprised to find that he knew who I was. I indicated that after the formidable work of Greenblatt, I had been encouraged to try to write a chess program on my own time at IBM, where I was then employed. He was very interested, and when I mentioned that I did not intend to stay at IBM too much longer, he was quick to suggest that I should visit Carnegie-Mellon University and see what they had to offer there. In due course I did visit, and in 1969 entered there as a first-year graduate student in Computer Science. He was on my committee when I did my thesis which demonstrated how a computer could do very complicated analytical things in the Human Style. But typical of Herb, he was not involved in the nuts and bolts, and the main credit for my guidance must be given to Allen Newell.

While a graduate student at CMU, I had ample opportunity of interact with Herb and Bill Chase who was a Post-Doc and later a professor in the Psychology Department there. It was there that I got involved in the Human Perception of chess which built on the work of the Russians in the 1930s and of De Groot in the 1940s. I was very impressed by the machinery that clearly existed in the human head and made it possible to remember positions almost perfectly even after having seen them for only 2 seconds. What was even more interesting, was that errors in reconstructing the position had a definite pattern to them. For instance, a Bishop may be misplaced in the reconstruction, but it would still be on the critical diagonal, and thus retain its function on that diagonal whatever the function was. This insight has been incredibly important in my career, and is seen clearly in the program CAPS, in my book The System, and in other writings presently under way.

Herb was excellent in pointing these things out and in developing the interpretation that allowed further progress into insights of what our brain machine was really doing. For me, it was very exciting to watch and wonder. Of course, what was missing at that time was a method of emulating human learning without which we would be faced with infinite twiddling of data by a human being who could just not grasp the complexity of all he was twiddling. Thus, until neural net learning came along, there was really no hope of building a program that could play in the human style. Yet, without people such as Herb, it is likely that no one would have tried. Now, with the success of the brute force method, it is doubtful anyone will ever try it. The fact that neural nets can be the difference is documented by the success of Tesauro's backgammon program that learned strategies that almost no one new, and became a top player by playing millions of games against itself. To do that in chess would have been much harder, but humans were doing it.

Herb Simon's role in all this is not at all clear. He was always there to discuss things with genuine interest, and had an amazing repetoire of facts that could be pertinent of the situation. One would come away from such a session with months of research leads to chase down. Not too many people could have done that. I will miss you, Herb.

George W. Baylor

George W. Baylor's Remembrance on Herbert A. Simon ^[9] :

Herb Simon has been such a towering influence and determining force in my life that it is hard to imagine what my life would have been like without him. It was in 1959-60, as a sophomore at Carnegie Institute of Technology, that I first met "Dr. Simon." I mainly played chess, but he and Allen Newell, were programming computers to play chess. I believe we played some games together and I beat him. He said that my "program" was better than his. Then he hired me as a summer research assistant to work on chess machines! A year or two later he sent me to Amsterdam to help translate Adriaan de Groot's book on the thought processes of the chess player. When I returned, he directed my master's thesis on a mating combinations program, which he had already begun with his son, Pete. Like a clever father, he subtly transformed me from an aspiring chess professional - though, more likely, impoverished chess bum - into a cognitive psychologist. He also directed my doctoral dissertation, a computer simulation of some visual mental imagery tasks, though I knew he would have preferred me to continue working on chess. He was stuck with his prediction that a computer would beat the world chess champion within ten years - it took 40. But sons must differentiate themselves from their fathers, mustn't they?

By then it was 1967-68 and the war in Vietnam was still raging. I went to Canada. Though Simon's views on the war were much less clear-cut than my own, he supported me. He even said that I could defend my thesis by teleconference. Though that proved unnecessary, you can imagine how much that meant to me. We continued to correspond and occasionally saw each other, but our lives diverged, as lives do.

Thirty years later, in 1997-98, I returned to Carnegie-Mellon University to do a sabbatical with Herb. It was as though I was his graduate student all over again: I presented my research problems and he helped me solve them; he presented his research and I struggled to understand it. I never really overcame my fear of his staggering intellect, but it mattered less because the love between us was so palpable. This was also the time when he had his major heart operation, and I felt privileged to be near him and Dorothea. He told me a dream he had while in the hospital, and I was thrilled to be able to offer an interpretation - my turn to give. I am so grateful for those months in Pittsburgh. Thank you, Herb. I am so grateful for the decade at C. I. T.: Thank you, Dr. Simon. It is hard to imagine a world without you. May you rest in peace.

Fernand Gobet

Fernand Gobet's Remembrance on Herbert A. Simon ^[10] :

"What new data do we have about chess today?" Herb would often ask at the beginning of our almost weekly meetings, which lasted from 1990 to 1995. He was immensely curious to learn about new phenomena, and had an obvious pleasure to analyse data, always looking for hidden patterns and better representations; as many of us have learned, Herb was outstanding at making sense out of complex data sets.

Herb’s curiosity was always present in our meetings, well beyond scientific data. For example, he had a passion for learning and improving his knowledge of foreign languages (he had translated scientific work from Russian and Dutch, and probably from other languages as well). When he volunteered to read the draft of my thesis in French, I expressed my worries about the time it would take. He reassured me: "Your French is much easier to read than Proust’s."

Herb was also very generous with his students and colleagues. When some arcane immigration regulation allowed me to be employed by Carnegie Mellon University, but not to be paid, Herb did not hesitate to support me financially for a couple of months.

Meetings with him were alternatively dense and relaxed, focused and wide-ranging. His informal style made you sometimes forget that you were talking to one of the greatest scholars and one of the last true humanists of the 20th century. While open to new ideas, he also had little patience for bad ideas. However, even then, he managed to refute them in a way that didn’t make you feel too bad.

He was exigent and expected his collaborators to share his passion for work. But of course, the results were highly rewarding. In a very elegant and efficient way, he taught many of us much about science, and mainly that scientific research can be an exciting voyage of discovery.

Chess Projects

Autobiography

Herbert A. Simon (1991). Models of my Life. Basic Books, New York, N.Y.
A Remarkable Autobiography of the Nobel Prize Winning Social Scientist and Father of Artificial Intelligence.

Selected Publications

^[11] ^[12] ^[13] ^[14] ^[15]

1956 ...

Allen Newell, Herbert Simon (1956). The logic theory machine-A complex information processing system. IRE Transactions on Information Theory, Vol. 2, No. 3
Allen Newell, Cliff Shaw, Herbert Simon (1958). Chess Playing Programs and the Problem of Complexity. IBM Journal of Research and Development, Vol. 4, No. 2, pp. 320-335. Reprinted (1963) in Computers and Thought (eds. Edward Feigenbaum and Julian Feldman), pp. 39-70. McGraw-Hill, New York, N.Y. pdf
Allen Newell, Cliff Shaw, Herbert Simon (1959). Report on a general problem-solving program. Proceedings of the International Conference on Information Processing, pp. 256-264 ^[16]

1960 ...

^[17]

Edward Feigenbaum, Herbert Simon (1961). Performance of a Reading Task by an Elementary Perceiving and Memorizing Program. RAND Paper, pdf
Edward Feigenbaum, Herbert Simon (1961). Forgetting in an association memory. ACM '61, pdf
Edward Feigenbaum, Herbert Simon (1962). A Theory of the Serial Position Effect. British Journal of Psychology, Vol. 53, 307-32, pdf
Herbert A. Simon, Peter A. Simon (1962). Trial and Error Search in Solving Difficult Problems: Evidence from the Game of Chess. Behavioral Science, Vol. 7, No. 4
Edward Feigenbaum, Herbert Simon (1963). Elementary Perceiver and Memorizer: Review of Experiments. in Symposium on Simulation Models
Herbert Simon, Edward Feigenbaum (1964). An Information-processing Theory of Some Effects of Similarity, Familiarization, and Meaningfulness in Verbal Learning. Journal of Verbal Learning and Verbal Behavior, Vol. 3, No. 5, pdf
Allen Newell, Herbert Simon (1965). An Example of Human Chess Play in Light of Chess Playing Programs. In Norbert Wiener, J. P. Schadé (eds.) Progress in Biocybernetics. Vol. 2, Elsevier
George W. Baylor, Herbert A. Simon (1966). A chess mating combinations program. AFIPS Joint Computer Conferences, reprinted in Herbert A. Simon (1979). Models of Thought. Yale University Press, pp. 181-200, in David Levy (ed.) (1988). Computer Chess Compendium.
Herbert Simon, Michael Barenfeld (1968). Information Processing in the Perception of Chess Positions. Carnegie Mellon University, Paper #127
Herbert Simon (1969). The Sciences of the Artificial. MIT Press, 1st Edition
Herbert Simon, Michael Barenfeld (1969). Information Processing-Analysis of Perceptual Processes in Problem Solving. Psychological Review, Vol. 76, No. 5, reprinted in Herbert A. Simon (1979). Models of Thought. Yale University Press, pdf

1970 ...

^[18]

Allen Newell, Herbert Simon (1972). Human Problem Solving. Prentice-Hall
Herbert Simon, Laurent Siklóssy (eds.) (1972). Representation and Meaning: Experiments with Information Processing Systems. Prentice-Hall
Herbert Simon (1973). Lessons from Perception for Chess-Playing Programs (and Vice Versa). Computer Science Research Review 1972-73, pdf
William Chase, Herbert Simon (1973). The Mind’s Eye in Chess. Visual Information Processing: Proceedings of the Eighth Annual Carnegie Psychology Symposium (ed. W. G. Chase), pp. 215-281. Academic Press, New York. Reprinted (1988) in Readings in Cognitive Science (ed. A.M. Collins). Morgan Kaufmann, San Mateo, CA.
William Chase, Herbert Simon (1973). Perception in chess. Cognitive Psychology, Vol. 4, No. 1, pdf ^[19]
Herbert Simon, William Chase (1973). Skill in Chess. American Scientist, Vol. 61, No. 4, Reprinted (1988) in Computer Chess Compendium, pdf
Herbert Simon, Kevin J. Gilmartin (1973). A Simulation of Memory for Chess Positions. Cognitive Psychology, Vol. 5, reprinted in Herbert Simon (1979). Models of Thought, Yale University Press, pdf
Herbert Simon (1974). How big is a chunk? Science, Vol. 183, pdf
Allen Newell, Herbert Simon (1976). Computer Science as Empirical Inquiry: Symbols and Search. Communications of the ACM, Vol. 19, No. 3, ACM Turing Award Lecture, pdf from The Computer History Museum ^[20]
Herbert A. Simon (1979). Models of Thought. Yale University Press

1980 ...

^[21]

Herbert Simon (1980). Cognitive Science: The Newest Science of the Artificial. Cognitive Science, Vol. 4, No. 1
Herbert Simon (1981). Prometheus or Pandora: The Influence of Automation on Society. IEEE Computer, Vol. 14, No. 11
Herbert Simon (1983). Search and Reasoning in Problem Solving. Artificial Intelligence, Vol. 21, Nos 1-2
Edward Feigenbaum, Herbert Simon (1984). EPAMlike models of recognition and learning. Cognitive Science, Vol. 8, 305-336, pdf
Herbert Simon (1985). Obituary: William G. Chase (1940–1983). American Psychologist, Vol. 40, No. 5 » William Chase
Herbert Simon (1986). Whether Software Engineering Needs to Be Artificially Intelligent. IEEE Transactions on Software Engineering, Vol. 12, No. 7
Herbert Simon (1988). Prospects for Cognitive Science. FGCS 1988

1990 ...

^[22]

Herbert Simon (1991). Artificial Intelligence: Where Has It Been, Where is it Going? IEEE Transactions on Knowledge and Data Engineering, Vol. 3, No. 2
Herbert A. Simon (1991). Models of my Life. Basic Books, New York, N.Y.
Herbert Simon, Jonathan Schaeffer (1992). The Game of Chess. in Handbook of Game Theory with Economic applications (eds. Robert J. Aumann and Sergiu Hart). North Holland, Amsterdam, The Netherlands. ISBN-13: 978-0-444-88098-7, ps
Herbert Simon (1995). Explaining the Ineffable: AI on the Topics of Intuition, Insight and Inspiration. IJCAI 1995, pdf
Herbert Simon (1995). Artificial Intelligence: An Empirical Science. Artificial Intelligence, Vol. 77, No. 1
Howard B. Richman, James J. Staszewski, Herbert Simon (1995). Simulation of Expert Memory with EPAM IV. Psychological Review, Vol. 102
Howard B. Richman, Fernand Gobet, James J. Staszewski, Herbert Simon (1995). Perceptual and Memory Processes in the Acquisition of Expert Performance: The EPAM Model. Complex Information Processing, Working Paper #528
Fernand Gobet, Herbert Simon (1996). Templates in Chess Memory: A Mechanism for Recalling Several Boards. Cognitive Psychology, Vol. 31, pp. 1-40.
Fernand Gobet, Herbert Simon (1996). Recall of random and distorted positions: Implications for the theory of expertise. Memory & Cognition, 24, 493-503.
Fernand Gobet, Herbert Simon (1996). Recall of rapidly presented random chess positions is a function of skill. Psychonomic Bulletin & Review, 3, 159-163, word reprint
Herbert Simon (1996). The Sciences of the Artificial. MIT Press, 3rd Edition 1996, amazon
Fernand Gobet, Howard B. Richman, James J. Staszewski, Herbert Simon (1997). Goals, Representations, and Strategies in a Concept Attainment Task: The EPAM model. The Psychology of Learning and Motivation, Vol. 37, pdf
Yasser Seirawan, Herbert Simon, Toshinori Munakata (1997). The Implications of Kasparov vs. Deep Blue. Communications of the ACM, Vol. 40, No. 8, pdf hosted from The Computer History Museum
Fernand Gobet, Herbert Simon (1998). Expert chess memory: Revisiting the chunking hypothesis. Memory, 6, 225-255
Fernand Gobet, Herbert Simon (1998). Pattern recognition makes search possible: Comments on Holding (1992). Psychological Research, Vol. 61, pdf ^[23]

2000 ...

^[24]

Fernand Gobet, Herbert Simon (2000). Five Seconds or Sixty? Presentation Time in Expert Memory. Cognitive Science, Vol. 24, No. 4
Hans Berliner (2001). HERBERT A. SIMON (1916-2001): A LIFE'S APPRAISAL, ICCA Journal, Vol. 24, No. 1
Fernand Gobet (2001). HERBERT A. SIMON (1916 - 2001): THE SCIENTIST OF THE ARTIFICIAL. ICCA Journal, Vol. 24, No. 1

External Links

References

^ Herbert A. Simon - A.M. Turing Award Winner
^ Herbert A. Simon - Biographical
^ Herbert Simon Collection - Contents [Carnegie Mellon Libraries]
^ Aritificial Intelligence pioneers Allen Newell (right) and Herbert Simon 1958 Courtesy of Carnegie Mellon University, The Computer History Museum
^ Herbert Simon 1958 ca. Courtesy of Carnegie Mellon University, The Computer History Museum
^ Computer Chess History by Bill Wall
^ John McCarthy Human-Level AI is harder than it seemed in 1955
^ Hans Berliner (2001). HERBERT A. SIMON (1916-2001): A LIFE'S APPRAISAL, ICCA Journal, Vol. 24, No. 1
^ All Remembrance of Herbert A. Simon
^ All Remembrance of Herbert A. Simon
^ ICGA Reference Database (pdf)
^ dblp: Herbert A. Simon
^ Herbert Simon - Google Scholar Citations
^ Bibliography of Herbert A. Simon -- 1930-1950's
^ dblp: Herbert A. Simon
^ General Problem Solver from Wikipedia
^ Bibliography of Herbert A. Simon - 1960's
^ Bibliography of Herbert A. Simon - 1970's
^ The Human Intuition Project: Chase and Simon (1973) Perception in chess, Cognitive Psychology 4:55-81. A scientific blunder by Alexandre Linhares, October 01, 2007
^ Physical symbol system from Wikipedia
^ Bibliography of Herbert A. Simon - 1980's
^ Bibliography of Herbert A. Simon - 1990's
^ Dennis H. Holding (1992). Theories of Chess Skill. Psychological Research, Vol. 54, No. 1
^ Bibliography of Herbert A. Simon - 2000-

What links here?

Page	Date Edited
ACM	May 7, 2017
Adriaan de Groot	Oct 6, 2014
Alan Turing	Feb 8, 2017
Alexandre Linhares	Nov 10, 2012
Allen Newell	Jun 12, 2017
Alpha-Beta	Jan 28, 2018
Anna Elizabeth T. A. Freitas	Nov 7, 2012
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Carnegie Mellon University	Feb 12, 2018
Checkmate	Apr 13, 2018
Chess	Jan 21, 2018
CHREST	May 6, 2016
Christopher Strachey	May 8, 2017
Chump	Jan 31, 2016
Chunking	Jun 12, 2017
Cliff Shaw	Apr 4, 2014
CMU Chess Program	Oct 6, 2014
Cognition	Dec 8, 2017
Coko	Jul 13, 2015
Computer Chess Compendium	Dec 29, 2015
Deep Blue	Aug 1, 2017
Dietrich Prinz	Oct 14, 2016
Edward Feigenbaum	Jan 3, 2016
EPAM	Jul 15, 2017
Eye Movements	Jul 22, 2015
Fernand Gobet	May 11, 2017
Games	Feb 20, 2018
George Baylor	Sep 22, 2014
Herbert Simon	Feb 11, 2016
History	Jan 2, 2018
J. Biit	Jan 17, 2017
John Gaschnig	Sep 5, 2012
John McCarthy	Jan 5, 2017
John von Neumann	May 8, 2017
Jonathan Schaeffer	Jan 29, 2018
Joseph S. Rubenfeld	Oct 6, 2014
Judith Spencer Olson	Sep 24, 2014
Kasparov versus Deep Blue 1997	Aug 1, 2017
Kasparov versus Deep Thought 1989	Mar 26, 2017
Kevin J. Gilmartin	Jan 1, 2016
L. Stephen Coles	Jan 5, 2017
Learning	Feb 20, 2018
Mac Hack	Apr 20, 2018
MANIAC I	Nov 17, 2016
Manuela Veloso	Aug 5, 2015
MAPP	Jan 30, 2016
Mate Search	Oct 22, 2016
Mater	Apr 26, 2016
Mathematician	Apr 9, 2018
Max Bramer	May 20, 2014
Memory	Dec 8, 2017
Michael Barenfeld	Oct 2, 2014
Neil Charness	Oct 2, 2014
NSS	Jul 14, 2015
Null Move Pruning	Dec 2, 2017
Oleg K. Tichomirov	Oct 2, 2014
Pattern Recognition	Sep 8, 2017
Paul Rushton	Jan 12, 2015
People	Feb 28, 2018
Perceiver	Nov 21, 2017
Pertti Saariluoma	Jun 13, 2017
Peter Jansen	Jan 31, 2016
Quote McCarthy	Sep 10, 2013
Simona Tancig	Nov 7, 2012
Susan L. Epstein	Dec 17, 2016
Toshinori Munakata	Feb 12, 2016
Trial and Error	Feb 11, 2018
Walter R. Reitman	Sep 24, 2014
William Chase	Jan 21, 2016
Workshop Chess and Mathematics	Mar 5, 2015

Up one level

Jack Good

GerdIsenberg — Fri, 22 Dec 2017 18:08:42 GMT

Home * People * Jack Good

		Irving John (Jack) Good, (December 9, 1916 - April 5, 2009) a British statistician and computer pioneer. During World War II, Good worked with Alan Turing and Conel Hugh O'Donel Alexander at Bletchley Park, with Donald Michie and Shaun Wylie et al. in the section Newmanry headed by Max Newman, contributing to crack the German Lorenz cipher ^[1] ^[2]. After the war he worked at the University of Manchester and Atlas Computer Laboratory, and had a variety of defense, consulting and academic positions, until he came to the United States in 1967, becoming a University Distinguished Professor at Virginia Tech. In 1965 he originated the concept of an intelligence explosion, now known as technological singularity ^[3], which anticipates the eventual advent of superhuman intelligence ^[4]. Jack Good died on April 5, 2009, aged 92 ^[5].
I.J. Good ^[6]

From Russia with Love

See also

Selected Publications

Photos

I. J. Good, nearest to camera - Cheltenham Chronicle. Final of the
National Chess Club championship, a telephone match. August 20, 1955 ^[7]

Five-Year Plan

Jack Good was a strong chess player, and he published several papers related to computer chess in Michie's Machine Intelligence series ^[8], most notably his Five-Year Plan for Automatic Chess in 1968 ^[9], excerpts reprinted in David Levy's Computer Chess Compendium, covering Material, Quiescence, Turbulence, and Agitation ^[10].

Theorem-Proving

Theorem-proving was mentioned in the Five-Year Plan for Automatic Chess ^[11]:

Theorem-proving resembles chess Playing in that we have an objective and an analysis tree, or graph, but differs in that a superficial expected pay-off replaces the iterated minimax. The minimax idea can come in if we are trying to prove a theorem and we imagine that we have an opponent who wishes to disprove it. The value of our game is 1 if the theorem is true and — 1 if it is false. In the proof trees described in the paper by Dr D. C. Cooper ^[12] the 'and's correspond to moves of the opponent, since we must allow for both branches, whereas the `or's correspond to our own moves. The minimax (strictly maximin) value of the tree tells us whether the theorem is true, and, if we allow for superficial probabilities at the endpoints of the tree, the minimax value is the superficial probability of the theorem.

Quotes

Jack Good

by Jack Good, 1998 ^[13]:

In letters to Turing, on September 16 and October 3, 1948, I mentioned the idea of resonance circuits in the brain; especially as a method for noticing analogies... In the postscript I discussed chess-playing machines, which he and I had discussed in 1941, and gave a reasonable definition of a forced variation. I took for granted the need to distinguish between quiescent and non-quiescent positions. Shannon's paper on chess appeared in 1950. In a letter to F C Williams in July 1951 I said "A facetious question is whether it is intended to display chess positions on the monitoring tubes". Of course today it is no longer at all facetious.

David Levy

David Levy in Computer Chess Compendium ^[14]:

Perhaps non-linear evaluation functions will become popular at some future date, in which case some of Good's ideas will come into their own.

The Times

Excerpt from the Obituary, The Times ^[15]

To statisticians, Good is one of the founding fathers of Bayesian statistics, an approach to the discipline based on work of Thomas Bayes in 1764. In it one forms a view of the phenomenon under study, quantifying one's uncertainty in terms of a probability distribution (the prior distribution). One then draws a sample, obtaining data, and uses the data and Bayes's theorem to update this prior uncertainty to give a new distribution, the posterior distribution. This approach - the Bayesian paradigm, as it is now called - was little used before Good's work but was given an important boost by his 1950 book and his extensive subsequent writings, and is firmly established today. Good's other interests included artificial intelligence - in particular, training computers to play chess and philosophy.

From Russia with Love

In 1991, Jack Good analyzed the famous position shown in the film From Russia with Love, Kronsteen vs. MacAdams ^[16], with the motive of the position was taken from Spassky versus Bronstein 1960 ^[17]. The difference is that MacAdams had 22...Ne6. ^[18]^[19]

- - - - - -

Kronsteen - MacAdams

Spassky - Bronstein

r3rnk1/ppp1qNp1/7p/4b3/5Q2/1B6/PP4PP/5RK1 w - - 0 1

r3rnk1/ppp1qNp1/7p/2P1b3/3P1Q2/1B6/PP4PP/5RK1 w - - 0 22

[Event "URS-ch"]
[Site "Leningrad"]
[Date "1960.??.??"]
[Round "?"]
[White "Boris Spassky"]
[Black "David Bronstein"]
[Result "1-0"]
 
1.e4 e5 2.f4 exf4 3.Nf3 d5 4.exd5 Bd6 5.Nc3 Ne7 6.d4 0-0 7.Bd3 Nd7 8.0-0 h6 9.Ne4 Nxd5 10.c4 Ne3 
11.Bxe3 fxe3 12.c5 Be7 13.Bc2 Re8 14.Qd3 e2 15.Nd6 Nf8 16.Nxf7 exf1Q+ 17.Rxf1 Bf5 18.Qxf5 Qd7 
19.Qf4 Bf6 20.N3e5 Qe7 21.Bb3 Bxe5 22.Nxe5+ Kh7 23.Qe4+ 1-0

Desde Rusia con Amor, YouTube Video

Selected Publications

^[20] ^[21]

1939

Jack Good (1939). Mathematics and chess. Eureka I

1940 ...

Jack Good (1941) Fourier Analysis. Ph.D. thesis, University of Cambridge, advisor Godfrey Harold Hardy
Jack Good, Donald Michie, Geoffrey Timms (1945). General Report on Tunny from The Turing Archive for the History of Computing
Jack Good (1946). Normal Recurring Decimals. Journal of the London Mathematical Society 1946
Jack Good (1949). The number of individuals in a casade process. Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 45

1950 ...

Jack Good (1950). Probability and the Weighing of Evidence. Griffin, London
Jack Good (1952/55). Notes on Randomised Chess. Chess
Jack Good (1953). The population frequencies of species and the estimation of population parameters. Biometrika, Vol. 40, Nos. 3-4 ^[22]
Jack Good (1959). Could a machine make probability judgments? Computers and Automation, Vol. 8

1960 ...

Jack Good (1962). Botryological speculations. in
Jack Good, A. J. Mayne, John Maynard Smith (eds.) (1962). The Scientist Speculates. Heinemann
Jack Good (1964). Measurement of decisions. in William W. Cooper, Harold J. Leavitt, Maynard W. Shelly (eds.) (1964). New Perspectives in Organisation Research. pp. 391-404. Wiley
Jack Good (1964). The Human Preserve. an Invited Contribution to a Symposium on Extraterrestrial Life held by the Institute of Biology and the British Interplanetary Society, May 1964, Records of Royal Naval Scientific Service
Jack Good (1965). Speculations Concerning the First Ultraintelligent Machine. Advances in Computers, Vol. 6, pdf, pdf
Jack Good (1965). The generalization of Lagrange's expansion and the enumeration of trees. Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 61, No. 2
Jack Good (1965). Logic of man and machine. IPC Magazines Limited
Jack Good (1965). The Mystery of Go. Literature: Reports hosted by Atlas Computer Laboratory
Jack Good (1966). The probability of war. Journal of the Royal Statistical Society, Series A, Vol. 129
Jack Good (1967). Human and machine logic. British Journal for the Philosophy of Science, Vol. 18
Jack Good, R.F. Churchhouse (1968). A New Conjecture Related to the Riemann Hypothesis. in Some Research Applications of the Computer, Atlas Computer Laboratory
Jack Good (1968). A Five-Year Plan for Automatic Chess. Machine Intelligence Vol. 2, pdf ^[23]
Jack Good (1969). Analysis of the machine chess game, J. Scott (White), ICL-1900 versus R.D. Greenblatt, PDP-10. Machine Intelligence Vol. 4 pp. 267-270 » John J. Scott, ICL 1900, Richard Greenblatt, PDP-10

1970 ...

Jack Good (1977). Dynamic Probability, Computer Chess, and the Measurement of Knowledge. Machine Intelligence Vol. 8 pp. 139-150
Jack Good (1978). Review of "Advances in Computer Chess, Volume 1. by M.R.B. Clarke"; University Press, 1977. ACM SIGART Bulletin, Issue 66 » Mike Clarke, Advances in Computer Chess 1
Jack Good (1978). Historical Notes. Personal Computing, Vol. 2, No. 10, pp. 80, October 1978, from Jack Good (1968). A Five-Year Plan for Automatic Chess.
Jack Good (1978). Historical Notes. Personal Computing, Vol. 2, No. 11, pp. 27, November 1978, cont.
Jack Good (1979). On the Grading of Chess Players. Personal Computing, Vol. 3, No. 3, pp. 47
Jack Good (1979). Rules for computer chess tournaments: an open letter to the tournament rules and organization committee of the International Computer Chess Association. ICCA Newsletter, Vol. 2, No. 2
Jack Good (1979). Studies in the history of probability and statistics. XXXVII AM Turing’s statistical work in World War II. Biometrika, Vol. 66, No. 2

1980 ...

Jack Good (1982). When will the rules of chess be changed? British Chess Magazine 102, No. 7 (July 1982), 305-306.
Jack Good (1988). Some Comments Concerning an Article by De Groot. ICCA Journal, Vol. 11, No. 2/3 ^[24]
Jack Good (1988). The Interface Between Statistics and Philosophy of Science. Statistical Science, Vol. 3, No. 4

1990 ...

Jack Good (1991). Analysis of the chess position shown in the film From Russia with Love, Kronsteen vs. MacAdams. Chess Monthly, Vol. 56, No. 5
Jack Good (1998). The first game of randomized chess played in a regular chess match. Chess Monthly, Vol. 63, No. 5

2000 ...

Jack Good (2000). Turing’s anticipation of emprical Bayes in connection with the cryptanalysis of the naval enigma. Journal of Statistical Computation and Simulation, Vol. 66, No. 2 ^[25] ^[26] ^[27]

External Links

I.J. Good from Wikipedia
Good–Turing frequency estimation from Wikipedia
The Mathematics Genealogy Project - Irving Good
Ratio Club from Wikipedia
I.J. Good - University Distinguished Professor Emeritus, 1967-94 from Virginia Tech
Professor I J Good from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
Professor Jack Good, Telegraph, April 09, 2009
Spies and Spymasters > Second World War > Jack Good from Spartacus Educational
Chess and the Code-Breakers by Edward Winter

References

^ Jack Good, Donald Michie, Geoffrey Timms (1945). General Report on Tunny from The Turing Archive for the History of Computing
^ From Codebreaking to Computing - Video from The Computer History Museum
^ Singularity Institute for Artificial Intelligence from Wikiepedia
^ Jack Good (1965). Speculations Concerning the First Ultraintelligent Machine. Advances in Computers, Vol. 6, pdf, pdf
^ In Memoriam: I. J. Good, University Distinguished Professor and pioneer of modern statistics, Obituary from Virginia Tech
^ VT Image Base Photographs Creator: Pat Hill of OMNI Magazine 1979, January issue
^ VT Image Base Photographs Creator: Pat Hill of OMNI Magazine 1979, January issue
^ Machine Intelligence series
^ Jack Good (1968). A Five-Year Plan for Automatic Chess. Machine Intelligence Vol. 2, pdf
^ David Levy (1988). Computer Chess Compendium - 3.2 A Five-Year Plan for Automatic Chess (excerpt).
^ Jack Good (1968). A Five-Year Plan for Automatic Chess. Machine Intelligence Vol. 2, pp. 93
^ David C. Cooper (1966). Mathematical proofs about computer programs. Machine Intelligence, Vol. 1
^ Excerpts from Acceptance Speech for the 1998 Computer Pioneers Award from the IEEE - Jack Good hosted by Atlas Computer Laboratory
^ David Levy (1988). Computer Chess Compendium, 3 Position Evaluation pp. 112
^ Obituary, The Times - Brilliant mathematician and Bletchley Park codebreaker who laid the foundations of modern statistics hosted by Atlas Computer Laboratory
^ Jack Good (1991). Analysis of the chess position shown in the film From Russia with Love, Kronsteen vs. MacAdams. Chess Monthly, Vol. 56, No. 5
^ The Chess Game in the James Bond classic From Russia, With Love from Ernst's Home Page
^ OPEN CHESS DIARY 241-260, 250. July 6, 2004: You are requested to make a blunder by Tim Krabbé
^ The name is Spassky – Boris Spassky from ChessBase news, September 2, 2004
^ ICGA Reference Database (pdf)
^ I.J. Good's Shorter Publications List (pdf) from Virginia Tech
^ Good–Turing frequency estimation
^ Paul Rushton, Tony Marsland (1973). Current Chess Programs: A Summary of their Potential and Limitations. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, pdf
^ Adriaan de Groot (1988). A Rejoinder to I.J. Good's Comments. ICCA Journal, Vol. 11, No. 2/3
^ Banburismus from Wikipedia
^ Good–Turing frequency estimation from Wikipedia
^ David McAllester, Robert Schapire (2000). On the Convergence Rate of Good-Turing Estimators. COLT 2000, CiteSeerX

What links here?

Page	Date Edited
Adriaan de Groot	Oct 6, 2014
Advances in Computer Chess 1	Oct 22, 2015
Alan Turing	Feb 8, 2017
Arthur Guez	Dec 6, 2017
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Atlas Computer Laboratory	Feb 10, 2015
Chess	Jan 21, 2018
Christopher Strachey	May 8, 2017
Computer Chess Compendium	Dec 29, 2015
David McAllester	May 23, 2016
De Bruijn sequence	Feb 20, 2018
Dietrich Prinz	Oct 14, 2016
Donald Michie	Dec 23, 2017
Eliot Slater	Aug 6, 2016
Evaluation	Feb 1, 2018
Ferranti Mark 1	Jun 2, 2015
Go	Jan 24, 2018
ICGA Journal	Dec 21, 2017
Influence Quantity of Pieces	Jul 21, 2017
Jack Good	Dec 22, 2017
John J. Scott	Aug 30, 2016
John Maynard Smith	Nov 27, 2017
John von Neumann	May 8, 2017
Jürgen Schmidhuber	Feb 3, 2018
Knowledge	Jul 22, 2017
Lancaster	Aug 30, 2016
Mac Hack	Apr 20, 2018
Marvin Minsky	Jan 29, 2016
Match Statistics	Mar 31, 2018
Material	Mar 31, 2018
Mathematician	Apr 9, 2018
Mike Clarke	May 23, 2016
Minimax	Dec 29, 2017
Mobility	Jan 17, 2018
Paul Rushton	Jan 12, 2015
People	Feb 28, 2018
Personal Computing	Dec 27, 2017
Piece-Square Tables	Mar 31, 2018
Planning	Feb 12, 2018
Playing Strength	Mar 31, 2018
Point Value	Mar 31, 2018
Proof-number search	Jan 22, 2018
Robert Schapire	Jun 1, 2015
Shaun Wylie	Jun 2, 2015
Tactics	Jan 12, 2018
The Computer History Museum	Aug 9, 2017
University of Manchester	May 24, 2017

Up one level

John McCarthy

GerdIsenberg — Thu, 05 Jan 2017 17:02:07 GMT

Home * People * John McCarthy

		John McCarthy, (September 4, 1927 - October 23, 2011 ^[1]) was an American researcher in computer science and pioneer in the field of artificial intelligence. After short-term appointments at Princeton, Stanford, Dartmouth, and MIT, John McCarthy became a full professor at Stanford in 1962, where he remained until his retirement at the end of 2000. In 1971 John McCarthy received the Turing Award for his major AI contributions. In 1955 McCarthy co-organized the Dartmouth Conference ^[2], where he coined the term Artificial intelligence, and introduced the idea of the Alpha-beta algorithm, to become their eponym. Alpha-beta was also approximated by Herbert Simon with Allen Newell and Arthur Samuel and was released to the public by Daniel Edwards and Timothy Hart in 1961 ^[3] and independently by Alexander Brudno in 1963 ^[4] . In 1958 at MIT John McCarthy created the Lisp programming language ^[5] ^[6] ^[7].
John McCarthy ^[8] ^[9]

Selected Publications

Photos



John McCarthy, playing chess at Stanford's IBM 7090, 1967 ^[10] ^[11] ^[12]

Claude Shannon, John McCarthy, Ed Fredkin and Joseph Weizenbaum (1966) ^[13]


Georgy Adelson-Velsky and John McCarthy playing chess, Soviet-American computer science conference, Urgench, 1979 ^[14]

Kotok-McCarthy

Between 1959 and 1962, students of John McCarthy at Massachusetts Institute of Technology, Alan Kotok, Elwyn Berlekamp (1960), Michael A. Lieberman, Charles Niessen and Robert A. Wagner, wrote a chess program for the IBM 7090. When McCarthy left MIT to take charge of the Arificial Intelligence Laboratory at Stanford, he took Kotok's program with him and improved it's searching. In 1965, McCarthy visited the Soviet Union and was challenged by Alexander Kronrod for a computer chess match. At the end of 1966 the four game match began between the Kotok-McCarthy-Program, running on a IBM 7090 computer, and a program developed at the Institute of Theoretical and Experimental Physics (ITEP) in Moscow which used a Soviet M-2 computer ^[15]. The match played over nine months was won 3-1 by the The ITEP program.

Quotes

Alpha-Beta

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 ^[16]:

What is AI?

Quote by John McCarthy from What is Artificial Intelligence? ^[17] ^[18] ^[19]:

Selected Publications

1955 ...

John McCarthy, Marvin Minsky, Nathaniel Rochester, Claude Shannon (1955). A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence.
Claude Shannon, John McCarthy (eds.) (1956). Automata Studies. Annals of Mathematics Studies Number 34, Google books, oldcomputerbooks.com
John McCarthy (1956). Inversion of Functions Defined by Turing Machines, pdf
John McCarthy (1958). An Algebraic Language for the Manipulation of Symbolic Expressions. Memo No. 1, Artificial Intelligence Project, RLE and MIT Computation Center, pdf hosted by The Computer History Museum, Courtesy of Tom Knight ^[20]
John McCarthy (1958). A Revised Version of "MAPLIST". Memo 2, Symbol Manipulating Language, Artificial Intelligence Project, RLE and MIT Computation Center
John McCarthy (1958). Symbol Manipulating Language - Revisions of the Language. MIT AI Lab., Memo No. 3, Artificial Intelligence Project, RLE and MIT Computation Center, pdf hosted by The Computer History Museum, Courtesy of Tom Knight
John McCarthy (1958). Symbol Manipulating Language - Revisions of the Language. MIT AI Lab., Memo No. 4, Artificial Intelligence Project, RLE and MIT Computation Center, pdf hosted by The Computer History Museum, Courtesy of Tom Knight
John McCarthy (1959). Programs with Common Sense, pdf

1960 ...

John McCarthy (1960). Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I. pdf, the original paper on Lisp.
John McCarthy, Paul W. Abrahams, Daniel J. Edwards, Timothy P. Hart, Michael I. Levin (1962) LISP 1.5 Programmer's Manual. The M.I.T. Press, 1962, second edition (1985) pdf ^[21]
John McCarthy, James Painter (1967). Correctness of a Compiler for Arithmetic Expressions, pdf

1970 ...

John McCarthy (1979). History of Lisp. Artificial Intelligence Laboratory, Stanford University

1980 ...

John McCarthy (1989). The Fruitfly on the Fly. ICCA Journal, Vol. 12, No. 4

1990 ...

John McCarthy (1990). Chess as the Drosophila of AI. Computers, Chess, and Cognition ^[22]
John McCarthy and Edward Feigenbaum (1991). In Memoriam. Arthur L. Samuel: Pioneer in Machine Learning. ICCA Journal, Vol. 14, No. 1 » Arthur Samuel
John McCarthy (1996). The Mutilated Checkerboard in Set Theory, available as 2001 pdf reprint
John McCarthy (1997). AI as Sport. Science, Vol. 276, June 6, pp. 1518-1519.
John McCarthy (1997). Chess as the Drosophila of AI. Computer Science Department, Stanford University, condensed version of the 1990 paper, pdf

2010 ...

Johan van Benthem (2011). John McCarthy (1927-2011). ICGA Journal, Vol. 34, No. 4

External Links

John McCarthy's Home Page
John McCarthy from Wikipedia
The Mathematics Genealogy Project - John McCarthy
Fellow Awards | John McCarthy from The Computer History Museum
John McCarthy - A.M. Turing Award Winner
John McCarthy Photo Essay - A.M. Turing Award Winner
AI as Sport by John McCarthy
Making Computer Chess Scientific by John McCarthy
Father of Lisp and AI John McCarthy has died • The Register by Iain Thomson, October 24, 2011
John McCarthy obituary by Jack Schofield, guardian.co.uk, October 25, 2011
Stanford's John McCarthy, seminal figure of artificial intelligence, dies at 84 by Andrew Myers, October 25, 2011
In memoriam of John McCarthy by Mel Cooper, CCC, October 26, 2011
Breaking News for 2011 - "Obituary: Emeritus Professor John McCarthy of Stanford University [1927 - -2011]" by L. Stephen Coles
John McCarthy (1927-2011): Artificial Intelligence - Thinking Allowed by Jeffrey Mishlove (1989), YouTube Video

References

^ Father of Lisp and AI John McCarthy has died • The Register by Iain Thomson, October 24, 2011
^ John McCarthy, Marvin Minsky, Nathaniel Rochester, Claude Shannon (1955). A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence.
^ Daniel Edwards, Timothy Hart (1961). The Alpha-Beta Heuristic. AIM-030, DSpace at MIT
^ Alexander Brudno (1963). Bounds and valuations for shortening the search of estimates. Problemy Kibernetiki (10) 141–150 and Problems of Cybernetics (10) 225–241
^ John McCarthy from The Computer History Museum
^ The Lisp programming language from Wikipedia
^ History of Lisp
^ About John McCarthy
^ The Programmer Dress Code | CodeThinked by Justin Etheredge, December 6, 2007
^ History of Computer Chess from The Computer History Museum
^ CSD founding faculty from Computer History Exhibits Photo Tour created January 2000 by Gio Wiederhold
^ See also image from Breaking News for 2011 - "Obituary: Emeritus Professor John McCarthy of Stanford University [1927 - -2011]" by L. Stephen Coles
^ Weizenbaum. Rebel at Work. A documentary by Peter Haas and Silvia Holzinger
^ Photos of Georgy M Adelson-Velsky (1922 - 2014) - ForeverMissed.com, shared by: Семен Карпенко, June 01, 2014
^ The Fast Universal Digital Computer M-2 by the Russian Virtual Computer Museum
^ John McCarthy Human-Level AI is harder than it seemed in 1955
^ What is Artificial Intelligence? by John McCarthy
^ John McCarthy (1989). The Fruitfly on the Fly. ICCA Journal, Vol. 12, No. 4
^ John McCarthy (1990). Chess as the Drosophila of AI. Computers, Chess, and Cognition, pp. 227-237
^ LISP 1.5 family — Software Preservation Group from The Computer History Museum
^ McCarthy et al. LISP 1.5 Programmer's Manual. from The Computer History Museum Software Preservation Group
^ John McCarthy (1997). Chess as the Drosophila of AI. Computer Science Department, Stanford University, condensed version of the 1990 paper, pdf

What links here?

Page	Date Edited
AAAI	Mar 21, 2017
ACM 1971	Jul 19, 2016
ACM 1979	Apr 3, 2017
Alan Kotok	Sep 21, 2014
Alen Shapiro	May 3, 2015
Alex Bernstein	Jan 2, 2016
Alexander Brudno	Apr 9, 2018
Alexander Kronrod	Apr 9, 2018
Algol	Feb 1, 2014
Allen Newell	Jun 12, 2017
Alpha-Beta	Jan 28, 2018
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
Barbara Liskov	Oct 30, 2014
Charles Niessen	Sep 23, 2011
Christopher Strachey	May 8, 2017
Claude Shannon	Apr 30, 2016
Cognition	Dec 8, 2017
Computers, Chess, and Cognition	Dec 28, 2016
Daniel Edwards	Jan 19, 2018
Dartmouth College	Dec 16, 2016
David Levy	Jan 3, 2017
David Wilkins	Mar 2, 2016
Donald Knuth	Aug 29, 2016
Donald Michie	Dec 23, 2017
Edward Feigenbaum	Jan 3, 2016
Edward Fredkin	Oct 27, 2013
Georgy Adelson-Velsky	Apr 9, 2018
Herbert Simon	Feb 11, 2016
History	Jan 2, 2018
Huberman	Aug 9, 2013
IBM 704	Jan 2, 2016
IBM 7090	Jan 19, 2018
ICGA Journal	Dec 21, 2017
ITEP Chess Program	Apr 2, 2014
John McCarthy	Jan 5, 2017
John Pasta	Feb 22, 2015
John von Neumann	May 8, 2017
Kaissa	Apr 9, 2018
Kotok-McCarthy-Program	Jul 14, 2015
L. Stephen Coles	Jan 5, 2017
Learning	Feb 20, 2018
Levy versus Chess 1978	Apr 1, 2017
Marvin Minsky	Jan 29, 2016
Massachusetts Institute of Technology	Jan 24, 2017
Mater	Apr 26, 2016
Mathematician	Apr 9, 2018
Michael A. Lieberman	Jan 9, 2014
Michael Levin	Sep 10, 2013
Mikhail Botvinnik	Jul 15, 2017
Nathaniel Rochester	Oct 26, 2016
Neural Networks	Mar 12, 2018
Paul W. Abrahams	Oct 9, 2013
PDP-1	Oct 27, 2013
People	Feb 28, 2018
Quote Shura-Bura	Dec 2, 2013
Quote Yershov	Dec 2, 2013
Recursion	Nov 18, 2017
Robert A. Wagner	Oct 28, 2013
Stanford University	Dec 7, 2017
Stanford-ITEP Match	Apr 9, 2018
Stanislaw Ulam	Aug 11, 2016
Timothy Hart	Aug 22, 2014
Vladimir Arlazarov	May 20, 2016
WCCC 1989	Dec 5, 2017

Up one level

John Pasta

GerdIsenberg — Sun, 22 Feb 2015 23:00:41 GMT

Home * People * John Pasta

		John R. Pasta, (1918 – June 5, 1981) was an American computer scientist, known for his participation in the Manhattan Project and the Fermi–Pasta–Ulam experiment. In 1952, at Los Alamos National Laboratory, working under Nicholas Metropolis on the MANIAC I, John Pasta aided in the construction of an early computer that specialized in calculations around weapons design. According to John McCarthy's quote, Pasta is considered as early chess programmer, co-developing the MANIAC I chess program. John Pasta was head of the department of Computer Science at the University of Illinois at Urbana-Champaign from 1964 to 1970.
John Pasta ^[1]

Quote

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 ^[2]:

External Links

References

What links here?

Page	Date Edited
John Pasta	Feb 22, 2015
John von Neumann	May 8, 2017
Los Alamos National Laboratory	Sep 16, 2015
MANIAC I	Nov 17, 2016
Mark Wells	Feb 23, 2015
Paul Stein	Feb 23, 2015
People	Feb 28, 2018
Quote McCarthy	Sep 10, 2013
Stanislaw Ulam	Aug 11, 2016
University of Illinois at Urbana-Champaign	Oct 12, 2016
William Walden	Jun 3, 2015

Up one level

Wikispaces : chessprogramming - items matching description

Alan Turing

Table of Contents

Photos

Turing Machine

Turing Test

Chess and Go

Could one make a machine?

Andrew Hodges

Jack Good

Punishment and Death

See also

Selected Publications

1936 ...

1940 ...

1950 ...

1990 ...

2000 ...

2010 ...

Forum Posts

External Links

Turing Machine

Devices and Computers

Turing Test

Turing Archive

Andrew Hodges

Literature

Turing Year 2012

Movies

References

What links here?

Alex Bernstein

Table of Contents

Quotes

See also

Publications

External Links

References

What links here?

Alexander Brudno

Table of Contents

Photos

Quotes

John McCarthy

Ershov and Shura-Bura

Landis and Yaglom

Mikhail Donskoy

See also

Selected Publications

External Links

References

What links here?

Alexander Kronrod

Table of Contents

Quotes

Remembering A.S. Kronrod

Intellectual Foundations

Competitions, Controversies, and Computer Chess

What is AI?

Selected Publications

External Links

References

What links here?

Allen Newell

Table of Contents

See also

Selected Publications

1955 ...

1960 ...

1970 ...

1980 ...

1990 ...

External Links

References

What links here?

Arthur Samuel

Table of Contents

Photos

Quotes

See also