Wikispaces : chessprogramming - items matching description

Aaron L. Futer

GerdIsenberg — Tue, 23 Dec 2014 19:06:08 GMT

Home * People * Aaron L. Futer

Aaron L. Futer,
a Russian mathematician and computer scientist. In the 70s at the Institute for System Studies (VNIISI) in Moscow, he researched with Edward Komissarchik on KQP(g7)KQ (1974) and with Vladimir Arlazarov on KRPKR (1979). Based on Zermelo's justification ^[1] they applied retrograde analysis, using bitboards in coding the chess board.

Selected Publications

^[2]

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 in ICCA Journal, Vol. 9, No. 4 (1986)
A. G. Alexandrov, A. M. Baraev, Ya. Yu. Gol'fand, Edward Komissarchik, Aaron L. Futer (1977). Computer analysis of rook end game. Avtomatika i Telemekhanika, No. 8, 113–117
A. G. Alexandrov, Vladimir Arlazarov, A. M. Baraev, Ya. Yu. Gol'fand, V. N. Deza, T. P. Il’ina, Edward Komissarchik, Anatoly Uskov, I. A. Faradzhev, Aaron L. Futer (1977). Processing of large files of information on the example of the analysis of the rook’s end game. Programming and Computer Software, No. 3
Aaron L. Futer (1978). Programming endgames with few pieces. Soviet Physics. Doklady, No. 23
Aaron L. Futer (1978). Computerized transposition of high-order matrices. Programming and Computer Software, No. 4
Vladimir Arlazarov, Aaron L. Futer (1979). Computer Analysis of a Rook End-Game. Machine Intelligence 9 (eds. Jean Hayes Michie, Donald Michie and L.I. Mikulich), pp. 361-371. Ellis Horwood, Chichester. Reprinted in Computer Chess Compendium
Edward Komissarchik, Aaron L. Futer (1986). Computer Analysis of a Queen Endgame. ICCA Journal, Vol. 9, No. 4 ^[3]

External Links

Futer A L from Math-Net.Ru

References

^ 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 see Appendix in Schwalbe and Walker: Zermelo and the Early History of Game Theory (pdf)
^ ICGA Reference Database (pdf)
^ Subject: brute-force vs. intuition in math & chess by Bill Dubuque, August 1996

What links here?

Page	Date Edited
Aaron L. Futer	Dec 23, 2014
Anatoly Uskov	Jan 7, 2016
Computer Chess Compendium	Dec 29, 2015
David Levy	Jan 3, 2017
Edward Komissarchik	May 20, 2016
Endgame Tablebases	Mar 6, 2018
Ernst Zermelo	Sep 8, 2014
ICGA Journal	Dec 21, 2017
People	Feb 28, 2018
Retrograde Analysis	Mar 21, 2017
Vladimir Arlazarov	May 20, 2016

Up one level

Adam Kujawski

GerdIsenberg — Thu, 14 Mar 2013 10:24:41 GMT

Home * People * Adam Kujawski

Adam Kujawski,
a Polish computer scientist and chess programmer. He is author of the first Polish chess program, called Joanna ^[1], being a part of his masters thesis from 1994 ^[2]. His paper had major impact on chess programming in Poland, containing a good natural language description of most important concepts and techniques. Joanna has been revived by Jim Ablett, who added Chess Engine Communication Protocol support to the version of 2002.

Publications

Adam Kujawski (1994). Programowanie gry w szachy. Masters thesis, University of Warsaw, pdf (Polish)

External Links

The chess games of Adam Kujawski from chessgames.com
Program szachowy Joanna (Polish) Translation by Google Translate

References

^ Program szachowy Joanna (Polish)
^ Adam Kujawski (1994). Programowanie gry w szachy. Masters thesis, University of Warsaw, pdf (Polish)

What links here?

Page	Date Edited
Adam Kujawski	Mar 14, 2013
Evaluation function draft	Jul 11, 2014
Joanna	Dec 9, 2014
PCCC 2002	Mar 14, 2013
People	Feb 28, 2018
University of Warsaw	May 6, 2014

Up one Level

Alan Kotok

GerdIsenberg — Sun, 21 Sep 2014 11:02:18 GMT

Home * People * Alan Kotok

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

See also

Selected Publications

External Links

References

What links here?

Selected Publications

Alan Kotok (1962). Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program. pdf
Alan Kotok (1962). A Chess Playing Program for the IBM 7090. B.S. Thesis, MIT, AI Project Memo 41, Computation Center, Cambridge MA. pdf
Gordon Bell, Alan Kotok, Thomas N. Hastings, Richard Hill (1978). The Evolution of the DECsystem-10. Communications of the ACM, 21(1): 44-63 » PDP-10

External Links

Alan Kotok from Wikipedia
Welcome to the Web site of Alan Kotok
Tech Model Railroad Club from Wikipedia
Alan Kotok from The Computer History Museum
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-1:08:40) ^[5] and John McCarthy (1:27:20), moderated by Edward Fredkin from 17:40, YouTube Video

References

^ Alan Kotok (1962). Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program. pdf
^ Forty five years ago by Steven Edwards, CCC, May 01, 2007
^ Competitions, Controversies, and Computer Chess (pdf) by Michael Brudno (May 2000)
^ Alan Kotok at CSAIL in 2006, Alan Kotok from Wikipedia
^ Alan Kotok died at his home in Cambridge, apparently from a heart attack, on May 26, 2006, eleven days after the PDP-1 Celebration Event

What links here?

Page	Date Edited
Alan Kotok	Sep 21, 2014
Charles Niessen	Sep 23, 2011
Chess	Jan 21, 2018
Computer Chess Compendium	Dec 29, 2015
Edward Fredkin	Oct 27, 2013
Elwyn Berlekamp	Jun 25, 2015
History	Jan 2, 2018
IBM 7090	Jan 19, 2018
John McCarthy	Jan 5, 2017
Kotok-McCarthy-Program	Jul 14, 2015
Massachusetts Institute of Technology	Jan 24, 2017
Mater	Apr 26, 2016
Michael A. Lieberman	Jan 9, 2014
Paul W. Abrahams	Oct 9, 2013
PDP-1	Oct 27, 2013
PDP-10	Apr 20, 2018
PDP-6	Jan 19, 2018
People	Feb 28, 2018
Robert A. Wagner	Oct 28, 2013

Up one level

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

Albert Gower

GerdIsenberg — Thu, 07 Jan 2016 13:30:24 GMT

Home * People * Albert Gower

		Dr. Albert (Al) Gower, an American musicologist, Professor Emeritus at the University of Southern Mississippi, Ph.D. in composition ^[1] ^[2] . As correspondence chess player co-author and chess consultant of the chess programs Blitz and Cray Blitz, the two-time winner of the World Computer Chess Championship.
Albert Gower ^[3]

Selected Publications

External Links

References

What links here?

Selected Publications

Robert Hyatt, Albert Gower, Harry Nelson. (1985). Cray Blitz. Advances in Computer Chess 4
Robert Hyatt, Albert Gower, Harry Nelson. (1985). Using Time Wisely, revisited (extended abstract). Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective, p. 271, Denver, Colorado. ISBN 0-89791-170-9.
Robert Hyatt, Harry Nelson, Albert Gower (1986). Cray Blitz - 1984 Chess Champion. Telematics and Informatics Vol. 2, No. 4, pp. 299-305. Pergammon Press Ltd.
Robert Hyatt, Albert Gower, Harry Nelson (1990). Cray Blitz. Computers, Chess, and Cognition, pp. 111-130

External Links

Albert Gower's ICGA Tournaments

References

^ The University of Southern Mississippi - McCain Library and Archives - Gower (Albert) Music Scores
^ Albert Gower from Tritone-Tenuto
^ Harold Bogner (1984). The New Champion. Chess Life February 1984, pdf from The Computer History Museum, Cover Photo: Ken Thompson, Joe Condon, Robert Hyatt, and Albert Gower

What links here?

Page	Date Edited
ACM 1976	Dec 27, 2017
ACM 1978	Dec 23, 2017
ACM 1979	Apr 3, 2017
ACM 1980	Dec 25, 2017
ACM 1981	Jan 19, 2018
ACM 1982	Jul 19, 2016
ACM 1984	Jul 19, 2016
ACM 1985	Jun 21, 2017
ACM 1987	Dec 5, 2017
ACM 1988	Dec 5, 2017
ACM 1989	Jun 7, 2016
ACM 1991	Nov 25, 2017
ACM 1993	Oct 30, 2017
ACM 1994	May 5, 2017
Advances in Computer Chess 4	Jan 22, 2018
Albert Gower	Jan 7, 2016
Blitz	Dec 23, 2017
Cartoons	Dec 1, 2017
Computer Chess Compendium	Dec 29, 2015
Computers, Chess, and Cognition	Dec 28, 2016
Cray Blitz	Dec 25, 2017
David Darling	Aug 23, 2017
Derek Robb	Aug 23, 2017
Harry Nelson	Jul 26, 2017
History	Jan 2, 2018
Lawrence Livermore National Laboratory	Feb 7, 2017
People	Feb 28, 2018
Rival	Jul 30, 2017
Robert Hyatt	Dec 25, 2017
Ryan Rifkin	Oct 12, 2016
StarTech	Oct 20, 2016
Time Management	Mar 20, 2018
University of Alabama at Birmingham	Jul 14, 2014
University of Southern Mississippi	Dec 27, 2017
WCCC 1983	Jan 20, 2018
WCCC 1986	Jul 27, 2017
WCCC 1989	Dec 5, 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 Bitman

GerdIsenberg — Tue, 02 Jun 2015 16:11:24 GMT

Home * People * Alexander Bitman

		Alexander Rafailovich Bitman, (Александр Рафаилович Битман, 1939 - September 9, 2013) was a Russian programmer, chess master ^[1], and Go player ^[2]. Alexander Bitman was co-developer and Chess adviser of the ITEP Chess Program at Alexander Kronrod’s laboratory at the Moscow Institute of Theoretical and Experimental Physics (ITEP). At the end of 1966 the 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 computer ^[3]. The match played over nine months was won 3-1 by the ITEP program. Alexander Bitman became member of the Kaissa team ^[4], which won the First World Computer Chess Championship 1974 in Stockholm. In 1988, after Kaissa's retirement, Bitman was tournament director of the First Soviet Computer-Chess Championship in Ulan-Ude ^[5]. On September 9, 2013, Alexander Rafailovich Bitman was killed by a hit-and-run car accident at the Institute of Systems Analysis, Bersenevskaya waterfront in Moscow ^[6].
Alexander Bitman ^[7]

Quotes

See also

Selected Publications

Quotes

Tony Marsland and Monty Newborn in their report of their USSR visit, December 1980 ^[8]:

We arrived in Moscow on December 7th and spent several days in technical talks at the Institute for System Studies with the Kaissa group - Mikhail Donskoy, Vladimir Arlazarov, Georgy Adelson-Velsky, Alexander Bitman, and Anatoly Uskov. Bitman, a master level player, easily outplayed the Chess Sensory Challenger which we brought along with us for demonstration purposes ...

Selected Publications

Vladimir Arlazarov and Alexander Bitman (1968). Will the machine beat man? Shakhmaty v SSSR, 2, 9–11
Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman, Alexander Zhivotovsky and Anatoly Uskov (1970). Programming a Computer to Play Chess. Russian Mathematical Surveys, Vol. 25, pp. 221-262.
Г.М. Адельсон-Вельский, В.Л. Арлазаров, А.Р. Битман, М.В. Донской (1983). Машина играет в шахматы, pdf (book with detailed explanations of Kaissa algorithms, language: Russian)
Jaap van den Herik (2013). Alexander Bitman, an Obituary. ICGA Journal, Vol. 36, No. 3

Forum Posts

Early Reference on Bit-Boards by Tony Warnock, rec.games.chess, October 29, 1994
Alexander Bitman (1939-2013) by Vladimir Medvedev, CCC, September 11, 2013
Alexander Bitman by Harvey Williamson, Hiarcs Forum, September 22, 2013

External Links

Alexander Bitman - Google+
Sensei's Library: Alexander Bitman
Alexander R. Bitman's Chess Games from 365chess.com
The chess games of Alexander R Bitman from chessgames.com
Alex Bitman (Go_chess) on Twitter
Погиб Александр Рафаилович Битман | Об игре го, September 11, 2013 (obituary by Mikhail Krylov)

References

^ Alexander R. Bitman's Chess Games from 365chess.com
^ Sensei's Library: Alexander Bitman
^ The Fast Universal Digital Computer M-2 by the Russian Virtual Computer Museum
^ History of Kaissa
^ Mikhail Donskoy, Jonathan Schaeffer (1988). Report on the 1st Soviet Computer-Chess Championship or re-awakening a sleeping giant. ICCA Journal, Vol. 11, Nos. 2/3
^ Alexander Bitman by Harvey Williamson, Hiarcs Forum, September 22, 2013
^ Погиб Александр Рафаилович Битман | Об игре го, September 11, 2013 (obituary by Mikhail Krylov)
^ Tony Marsland, Monty Newborn (1981). A brighter future for Soviet computer chess? ICCA Newsletter, Vol. 4, No. 1, pdf

What links here?

Page	Date Edited
Alexander Bitman	Jun 2, 2015
Alexander Zhivotovsky	Sep 10, 2013
Anatoly Uskov	Jan 7, 2016
Bitboards	Nov 14, 2017
Chess	Jan 21, 2018
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
Evaluation Overlap	Jul 19, 2016
First Soviet Computer-Chess Championship 1988	Dec 7, 2016
Georgy Adelson-Velsky	Apr 9, 2018
ICGA Journal	Dec 21, 2017
Institute of Control Sciences	Jun 2, 2015
Institute of Theoretical and Experimental Physics	Sep 8, 2015
ITEP Chess Program	Apr 2, 2014
Jaap van den Herik	Sep 18, 2017
Kaissa	Apr 9, 2018
M-2	Sep 10, 2013
M-20	Oct 9, 2013
Mikhail Donskoy	Dec 23, 2017
People	Feb 28, 2018
Point Value by Regression Analysis	Aug 26, 2017
Stanford-ITEP Match	Apr 9, 2018
Vladimir Arlazarov	May 20, 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

Alexander Reinefeld

GerdIsenberg — Mon, 04 Jul 2016 08:39:01 GMT

Home * People * Alexander Reinefeld

		Alexander Reinefeld, (born 1957 ^[1] ) a German computer scientist, games researcher, and professor of Computer Science at the Zuse Institute Berlin (ZIB). He studied physics at the Technical University of Braunschweig and computer science at the University of Hamburg and during two one-year visits in Edmonton at the University of Alberta. In 1982 he concluded his graduate in computer science and in 1987 he received his Ph.D at the University of Hamburg. From 1983 to 1987, he worked as a scientific employee, and from 1989 to 1992 as assistant at the University of Hamburg. During the years 1987 to 1990 he collected industrial experience as a management consultant in the areas of Systems analysis, Databases and Compiler building. In 1992 Reinefeld collaborated with the Paderborn Center for Parallel Computing (PC²) at the University of Paderborn ^[2]. Since 1998, Alexander Reinefeld leads the area of Computer Science in the Zuse Institute Berlin (ZIB). He is a member of the Gesellschaft für Informatik, the ACM, the IEEE Computer Society, the German university association Deutscher Hochschulverband (DHV) and Chair of Parallel and Distributed Systems at the Humboldt University of Berlin.
Alexander Reinefeld ^[3]

Selected Publications

Chess Programs

Murks

In 1979 at the University of Hamburg, motivated and supported by his advisor Frieder Schwenkel, Alexander Reinefeld designed the chess program Murks, partly implemented in microcode for an Interdata M85 minicomputer.

Reinefeld: "world chess champion Mikhail Botvinnik visited us and played against Murks."

MicroMurks

In 1980/81, a team of four students, Manfred Allers, Dirk Hauschildt, Dieter Steinwender and Alexander Reinefeld, ported Murks to a Motorola MC68000 Microprocessor, then dubbed MicroMurks. They built their own MC68000 microcomputer from scratch ^[4] Micromurks II represented by Dieter Steinwender, participated at the WMCCC 1983 in Budapest.

Search Algorithms

Negascout

In 1983 Alexander Reinefeld introduced the NegaScout search-algorithm, an improvement of Judea Pearl's Scout ^[5] .

RecSSS* and RecDual*

Ten years later, in 1993 at the 7th Advances in Computer Chess conference, Reinefeld made an attempt to resuscitate Stockman's SSS* algorithm, and proposed an improvement of the recursive RecSSS* ^[6] , initially developed by Subir Bhattacharya and Amitava Bagchi ^[7] . Despite promising results with some trees of depth 8, the space (memory) requirements were still very (too) high, and with the research of Aske Plaat, Wim Pijls and Arie de Bruin concerning Alpha-Beta with zero windows and transposition table in SSS* and Dual* as MT, SSS* was finally declared "dead" by Pijls and De Bruin in 1996 ^[8] .

Selected Publications

^[9] ^[10]

1982 ...

Alexander Reinefeld (1982). Untersuchungen an modernen Suchbaum-Reduktionsverfahren. Diplomarbeit, Fachbereich Informatik, Universität Hamburg
Alexander Reinefeld (1983). An Improvement to the Scout Tree-Search Algorithm. ICCA Journal, Vol. 6, No. 4, pdf
Alexander Reinefeld (1985). Kai von Luck: Aspekte wissensgestützter Planung. Bernd Owsnicki: Repräsentation von positionellem Schachwissen mit Techniken der künstlichen Intelligenz. ICCA Journal, Vol. 8, No. 4
Alexander Reinefeld, Tony Marsland, Jonathan Schaeffer (1985). Is Best First Search Really Best? Technical Report TR 85-16, Department of Computer Science, University of Alberta.
Alexander Reinefeld, Jonathan Schaeffer, Tony Marsland (1985). Information Acquisition in Minimal Window Search. Proceedings of the 9th IJCAI, pp. 1040-1043.
Alexander Reinefeld, Tony Marsland (1987). A Quantitative Analysis of Minimal Window Search. IJCAI-87, pdf
Tony Marsland, Alexander Reinefeld, Jonathan Schaeffer (1987). Low Overhead Alternatives to SSS*. Artificial Intelligence, Vol. 31, No. 2, pp. 185-199. ISSN 0004-3702.
Alexander Reinefeld (1989). Spielbaum Suchverfahren. Informatik-Fachberichte Volume 200. Springer-Verlag, Berlin, Germany. ISBN 3-540-50742-6.

1990 ...

Alexander Reinefeld (1994). A Minimax Algorithm Faster than Alpha-Beta. Advances in Computer Chess 7
Alexander Reinefeld, Tony Marsland (1994). Enhanced Iterative-Deepening Search. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 16, No. 7, pp. 701-710. ISSN 0162-8828. pdf
Alexander Reinefeld, Peter Ridinger (1994). Time-Efficient State Space Search. Artificial Intelligence, Vol. 71, No. 2, CiteSeerX

2000 ...

Alexander Reinefeld (2000). Parallel Heuristic Search and Heuristic Search. In: C.A. Floudas, P.M. Pardalos (eds.), Encyclopedia of Optimization. Kluwer Academic Publishers
Florian Schintke, Jens Simon, Alexander Reinefeld (2001). A Cache Simulator for Shared Memory Systems. International Conference on Computational Science ICCS 2001, San Francisco, CA, Springer LNCS 2074, vol. 2, pp. 569-578.
Alexander Reinefeld (2005). Die Entwicklung der Spielprogrammierung: Von John von Neumann bis zu den hochparallelen Schachmaschinen. slides as pdf, Themen der Informatik im historischen Kontext Ringvorlesung an der HU Berlin, 02.06.2005 (English paper, German title)
Alexander Reinefeld (2009). Heuristic Search. In: C.A. Floudas, P.M. Pardalos (eds.), Encyclopedia of Optimization 2nd ed. pp 1506-1508
Alexander Reinefeld (2009). Parallel Heuristic Search. In: C.A. Floudas, P.M. Pardalos (eds.), Encyclopedia of Optimization 2nd ed. pp 2908-2912

External Links

References

^ Prof. Dr. Alexander Reinefeld - Auf dem Weg zum globalen "Information Power Grid" (German)
^ Paderborn Center for Parallel Computing
^ Alexander Reinefeld's homepage
^ Alexander Reinefeld (2005). Die Entwicklung der Spielprogrammierung: Von John von Neumann bis zu den hochparallelen Schachmaschinen. slides as pdf, Themen der Informatik im historischen Kontext Ringvorlesung an der HU Berlin, 02.06.2005 (English paper, German title)
^ Alexander Reinefeld (1983). An Improvement to the Scout Tree-Search Algorithm. ICCA Journal, Vol. 6, No. 4, pdf
^ Alexander Reinefeld (1994). A Minimax Algorithm Faster than Alpha-Beta. Advances in Computer Chess 7
^ Subir Bhattacharya, Amitava Bagchi (1990). Unified Recursive Schemes for Search in Game Trees. Technical Report WPS-144, Indian Institute of Management, Calcutta
^ Arie de Bruin, Wim Pijls (1997). SSS†. Advances in Computer Chess 8
^ dblp: Alexander Reinefeld
^ ICGA Reference Database (pdf)

What links here?

Page	Date Edited
Advances in Computer Chess 7	Oct 28, 2014
Agata Muszycka-Jones	May 4, 2017
Alexander Reinefeld	Jul 4, 2016
Bernd Owsnicki-Klewe	Jan 20, 2018
Best-First	Dec 29, 2017
Dieter Steinwender	Jul 4, 2016
Dirk Hauschildt	Jul 4, 2016
European MCC 1982	May 22, 2016
Frieder Schwenkel	Dec 23, 2017
Games	Feb 20, 2018
Guido Schimmels	Apr 23, 2013
History	Jan 2, 2018
ICGA Journal	Dec 21, 2017
Interdata M85	Oct 30, 2013
Iterative Deepening	Jun 23, 2017
John von Neumann	May 8, 2017
Jonathan Schaeffer	Jan 29, 2018
Kai von Luck	Jan 20, 2018
Mathematician	Apr 9, 2018
MicroMurks	Jan 8, 2016
Minimax	Dec 29, 2017
Murks	Jul 4, 2016
N.N.	Jan 20, 2018
NegaScout	Jul 6, 2016
Parallel Search	Dec 30, 2017
People	Feb 28, 2018
Pepito	Nov 27, 2014
Principal Variation Search	Oct 22, 2017
Rajjan Shinghal	Nov 4, 2013
Scout	Jan 28, 2018
SSS* and Dual*	Jan 22, 2018
Tony Marsland	Nov 27, 2017
University of Alberta	Feb 20, 2018
University of Hamburg	Jan 20, 2018
University of Paderborn	Aug 17, 2014
WMCCC 1983	Jun 5, 2017

Up one level

Alexander Zhivotovsky

GerdIsenberg — Tue, 10 Sep 2013 12:05:57 GMT

Selected Publications

Forum Posts

References

What links here?

Home * People * Alexander Zhivotovsky

Alexander A. Zhivotovsky,
is a Russian computer scientist. In 1963 ^[1] at Alexander Kronrod’s laboratory at the Moscow Institute of Theoretical and Experimental Physics (ITEP), Alexander Zhivotovsky co-developed the ITEP Chess Program, together with Georgy Adelson-Velsky, Vladimir Arlazarov and Anatoly Uskov, advised by Russian chess master Alexander Bitman and three-time world champion Mikhail Botvinnik.

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 computer ^[2]. The match played over nine months was won 3-1 by the The ITEP program, despite playing on slower hardware.

Selected Publications

Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman, Alexander Zhivotovsky and Anatoly Uskov (1970). Programming a Computer to Play Chess. Russian Mathematical Surveys, Vol. 25, pp. 221-262.

Forum Posts

Early Reference on Bit-Boards by Tony Warnock, rgc, October 29, 1994

References

What links here?

Page	Date Edited
Alexander Bitman	Jun 2, 2015
Alexander Zhivotovsky	Sep 10, 2013
Anatoly Uskov	Jan 7, 2016
Bitboards	Nov 14, 2017
Chess	Jan 21, 2018
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
Evaluation Overlap	Jul 19, 2016
Georgy Adelson-Velsky	Apr 9, 2018
Institute of Theoretical and Experimental Physics	Sep 8, 2015
ITEP Chess Program	Apr 2, 2014
Kaissa	Apr 9, 2018
M-2	Sep 10, 2013
M-20	Oct 9, 2013
People	Feb 28, 2018
Stanford-ITEP Match	Apr 9, 2018
Vladimir Arlazarov	May 20, 2016

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

Amitava Bagchi

GerdIsenberg — Mon, 23 May 2016 09:03:48 GMT

Selected Publications

External Links

References

What links here?

Home * People * Amitava Bagchi

Amitava Bagchi,
an Indian physicist, computer scientist and until 2007 professor for Management Information Systems at the Indian Institute of Management, Calcutta. With his colleague Subir Bhattacharya, he researched on various search topics and investigated Stockman's SSS* algorithm. With some improvements they tried a recursive depth-first implementation, called RecSSS*.

Selected Publications

^[1] ^[2] ^[3]

Amitava Bagchi, Ambuj Mahanti (1983). Search Algorithms Under Different Kinds of Heuristics - A Comparative Study. Journal of the ACM, Vol. 30, No. 1
Subir Bhattacharya, Amitava Bagchi (1986). Making Best Use of Available Memory when Searching Game Trees. AAAI 1986
Anup K. Sen, Amitava Bagchi (1989). Fast Recursive Formulations for Best-First Search that allow Controlled use of Memory. IJCAI 1989, pdf
Subir Bhattacharya, Amitava Bagchi (1990). Unified Recursive Schemes for Search in Game Trees. Technical Report WPS-144, Indian Institute of Management, Calcutta
Subir Bhattacharya, Amitava Bagchi (1993). A Faster Alternative to SSS* with Extension to Variable Memory. Information Processing Letters, Vol. 47

External Links

The Mathematics Genealogy Project - Amitava Bagchi

References

What links here?

Page	Date Edited
Alexander Reinefeld	Jul 4, 2016
Amitava Bagchi	May 23, 2016
Best-First	Dec 29, 2017
Mathematician	Apr 9, 2018
Memory	Dec 8, 2017
People	Feb 28, 2018
SSS* and Dual*	Jan 22, 2018
Subir Bhattacharya	Jul 28, 2014

Up one level

Anatoly Uskov

GerdIsenberg — Thu, 07 Jan 2016 12:58:45 GMT

Home * People * Anatoly Uskov

		Anatoly V. Uskov, a Russian computer scientist. In 1963 ^[1] at Alexander Kronrod’s laboratory at the Moscow Institute of Theoretical and Experimental Physics (ITEP), Anatoly Uskov co-developed the ITEP Chess Program, together with Georgy Adelson-Velsky, Vladimir Arlazarov and Alexander Zhivotovsky, advised by Russian chess master Alexander Bitman and three-time world champion Mikhail Botvinnik. 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 computer ^[2]. The match played over nine months was won 3-1 by the The ITEP program, despite playing on slower hardware. By 1971, Mikhail V. Donskoy joined with Arlazarov and Uskov to program its successor on an ICL System 4/70 at the Institute of Control Sciences, called Kaissa, which became the first World Computer Chess Champion in 1974 in Stockholm.
Arlazarov, Uskov, and Donskoy ^[3] ^[4]

Selected Publications

Selected Publications

^[5]

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.
Vladimir Arlazarov, I. I. Zujev, Anatoly Uskov, I. A. Faradzhev (1974). An algorithm for the reduction of finite non-oriented graphs to canonical form. U.S.S.R. Computational Mathematics and Mathematical Physics, No. 14
A. G. Alexandrov, Vladimir Arlazarov, A. M. Baraev, Ya. Yu. Gol'fand, V. N. Deza, T. P. Il’ina, Edward Komissarchik, Anatoly Uskov, I. A. Faradzhev, Aaron L. Futer (1977). Processing of large files of information on the example of the analysis of the rook’s end game. Programming and Computer Software, No. 3

Forum Posts

Early Reference on Bit-Boards by Tony Warnock, rgc, October 29, 1994

External Links

Anatoly Uskov's ICGA Tournaments

References

^ "Каисса" - Историю программы рассказывает один из ее создателей Михаил Донской - Kaissa by Mikhail Donskoy, translated by Google Translate
^ The Fast Universal Digital Computer M-2 by the Russian Virtual Computer Museum
^ Tony Marsland, Monty Newborn (1981). A brighter future for Soviet computer chess? ICCA Newsletter, Vol. 4, No. 1, pdf
^ Arlazarov, Uskov, and Donskoy in Moscow 1980, Gift of Monroe Newborn from The Computer History Museum
^ zbMATH Uskov, A.V.

What links here?

Page	Date Edited
Aaron L. Futer	Dec 23, 2014
Alexander Bitman	Jun 2, 2015
Alexander Zhivotovsky	Sep 10, 2013
Anatoly Uskov	Jan 7, 2016
Bitboards	Nov 14, 2017
Chess	Jan 21, 2018
David Levy	Jan 3, 2017
Edward Komissarchik	May 20, 2016
Efficient Generation of Sliding Piece Attacks	Nov 5, 2016
Endgame Tablebases	Mar 6, 2018
Evaluation Overlap	Jul 19, 2016
Georgy Adelson-Velsky	Apr 9, 2018
Institute of Control Sciences	Jun 2, 2015
Institute of Theoretical and Experimental Physics	Sep 8, 2015
ITEP Chess Program	Apr 2, 2014
Kaissa	Apr 9, 2018
M-2	Sep 10, 2013
M-20	Oct 9, 2013
Mikhail Donskoy	Dec 23, 2017
People	Feb 28, 2018
Stanford-ITEP Match	Apr 9, 2018
Vladimir Arlazarov	May 20, 2016
WCCC 1974	Jan 19, 2018
WCCC 1977	Dec 22, 2017

Up one level

Andrew Tridgell

GerdIsenberg — Mon, 03 Aug 2015 11:00:40 GMT

Home * People * Andrew Tridgell

		Andrew Tridgell, an Australian programmer, primary author of the TD-learning chess program KnightCap ^[1] and best known as the major developer of the Samba software. His Ph.D. thesis Efficient Algorithms for Sorting and Synchronization ^[2] at the Australian National University was based on his work on the rsync algorithm.
Andrew Tridgell ^[3]

Selected Publications

Selected Publications

^[4]

Andrew Tridgell (1997). KnightCap — a parallel chess program on the AP1000+. zipped ps
Jonathan Baxter, Andrew Tridgell, Lex Weaver (1998). Knightcap: A chess program that learns by combining td(λ) with game-tree search, Proceedings of the 15th International Conference on Machine Learning, pdf via citeseerX
Jonathan Baxter, Andrew Tridgell, Lex Weaver (1998). TDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search. Australian Journal of Intelligent Information Processing Systems, Vol. 5 No. 1, arXiv:cs/9901001
Jonathan Baxter, Andrew Tridgell, Lex Weaver (1998). Experiments in Parameter Learning Using Temporal Differences, ICCA Journal, Vol. 21, No. 2, pdf
Andrew Tridgell (1999). Efficient Algorithms for Sorting and Synchronization. Ph.D. thesis, The Australian National University, advisor Richard P. Brent, pdf
Jonathan Baxter, Andrew Tridgell, Lex Weaver (2000). Learning to Play Chess Using Temporal Differences. Machine Learning, Vol 40, No. 3, pdf

Forum Posts

KnightCap 1.0 by Andrew Tridgell, rgcc, February 27, 1997
Re: Going commercial, maybe by Andrew Tridgell, rgcc, March 9, 1997 » 3D Graphics Board
Re: Computer Chess Planning by Andrew Tridgell, rgcc, March 17, 1997
Parallel searching by Andrew Tridgell, post 16, rgcc, March 22, 1997 » Parallel Search
KnightCap v1.8 by Andrew Tridgell, rgcc, April 03, 1997
Re: computer chess "oracle" ideas... by Andrew Tridgell, rgcc, April 03, 1997 » Oracle
quiescence search by Andrew Tridgell, rgcc, April 16, 1997 » Quiescence Search, Check, Crafty
Re: Bit Board Bonkers?? - other alternatives by Andrew Tridgell, rgcc, August 9, 1997 » Piece-Sets
asymmetry by Andrew Tridgell, rgcc, August 12, 1997 » Asymmetric evaluation

External Links

References

^ Welcome to the KnightCap home page
^ Andrew Tridgell (1999). Efficient Algorithms for Sorting and Synchronization. Ph.D. thesis, The Australian National University, advisor Richard P. Brent, pdf
^ Andrew Tridgell's homepage
^ DBLP: Andrew Tridgell

What links here?

Page	Date Edited
3D Graphics Board	Sep 23, 2017
ABDADA	Aug 30, 2017
Andrew Tridgell	Aug 3, 2015
Asymmetric evaluation	Nov 17, 2016
Australian National University	Jun 30, 2014
Automated Tuning	Feb 27, 2018
Check	Feb 1, 2018
Crafty	Jan 28, 2018
Giraffe	Jan 8, 2018
ICGA Journal	Dec 21, 2017
Jonathan Baxter	Feb 11, 2018
KnightCap	Nov 6, 2016
Learning	Feb 20, 2018
Lex Weaver	Aug 3, 2015
Mathematician	Apr 9, 2018
Meep	Sep 4, 2016
NC3 1999	Jan 12, 2013
NC3 2000	Jan 13, 2013
NC3 2001	Jan 13, 2013
NC3 2003	Jan 13, 2013
NC3 2004	Jan 13, 2013
NC3 2005	Jan 13, 2013
NC3 2006	Jan 10, 2013
Neural Networks	Mar 12, 2018
Opponent Model Search	Aug 14, 2017
Parallel Search	Dec 30, 2017
Parity Pruning	Jan 14, 2013
People	Feb 28, 2018
Pepito	Nov 27, 2014
Piece-Sets	Jun 9, 2017
Quiescence Search	Aug 19, 2017
Shared Hash Table	Sep 11, 2017
Shaun Press	Sep 24, 2014
Temporal Difference Learning	Feb 20, 2018
Vanilla Chess	Jan 13, 2013

Up one level

Anthony Cozzie

GerdIsenberg — Sat, 05 Nov 2016 09:09:44 GMT

Home * People * Anthony Cozzie

		Anthony E. Cozzie, an American computer scientist with a Ph.D. from University of Illinois at Urbana-Champaign on the topic of Detecting and Combining Programming Patterns ^[1], creative thinker, intuitive programmer, cosmopolitan world traveler, erudite conversationalist, modest, all-around good guy ^[2]. As retired computer chess programmer ^[3] ^[4], Anthony is author of the world class chess program Zappa ^[5] ^[6], the winner of the WCCC 2005 in Reykjavík, and after the Rybka disqualification in 2011, the WCCC 2007 in Amsterdam.
Anthony Cozzie ^[7]

Photos & Games

Reykjavík 2005

Mexico-City 2007

Selected Publications

Photos & Games

Reykjavík 2005

Anthony Cozzie just before round 7, Zappa - Junior, WCCC 2005 ^[8] ^[9] ^[10]

[Event "13th World Computer Chess Championship"]
[Site "Reykjavík, Iceland"]
[Date "2005.08.19"]
[Round "7"]
[White "Zappa"]
[Black "Junior"]
[Result "1-0"]
 
1.d4 d5 2.Nf3 Nf6 3.c4 e6 4.Nc3 c6 5.e3 Nbd7 6.Qc2 Bd6 7.g4 h6 
8.Rg1 e5 9.cxd5 cxd5 10.g5 hxg5 11.Nxg5 e4 12.Nb5 Nb6 13.Bd2 Bf5 
14.h3 Bh2 15.Rg2 Rc8 16.Qb3 Bb8 17.Bb4 Nh7 18.Nxh7 Rxh7 19.Rg1 Rc6 
20.Nc3 a6 21.a4 Nc4 22.Bxc4 dxc4 23.Qc2 Rch6 24.Qe2 Qc8 25.O-O-O b5 
26.d5 Qb7 27.d6 Bd7 28.axb5 axb5 29.Rg5 f5 30.Rd5 Qa8 31.Kb1 g6 
32.Re5+ Kf7 33.Nd5 Kf8 34.Nf6 Rf7 35.Re8+ Kg7 36.Nh5+ Kh7 1-0

Mexico-City 2007

Press conference Zappa versus Rybka 2007, Anthony Cozzie, David Levy and Vasik Rajlich ^[11]

Selected Publications

^[12]

Robert Hyatt, Anthony Cozzie (2005). The Effect of Hash Signature Collisions in a Chess Program. ICGA Journal, Vol. 28, No. 3
Anthony Cozzie (2007). Zappa vs. Rybka. ICGA Journal, Vol. 30, No. 4
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T. King (2008). Digging for Data Structures. OSDI 2008, pdf
Samuel T. King, Joseph Tucek, Anthony Cozzie, Chris Grier, Weihang Jiang, Yuanyuan Zhou (2008). Designing and Implementing Malicious Hardware. LEET 2008, pdf
Anthony Cozzie (2011). The Future of Computer Chess. Selective Search 154, pp. 11, pdf hosted by Mike Watters
Anthony Cozzie (2011). Detecting and Combining Programming Patterns. Ph.D. thesis, University of Illinois at Urbana-Champaign, advisor Samuel T. King

Forum Posts

Zappa CCT5 Report by Anthony Cozzie, CCC, January 21, 2003 » CCT5
Zappa @ CCT6 by Anthony Cozzie, CCC, February 01, 2004 » CCT6
The Zappa Attack Table Code by Anthony Cozzie, CCC, May 05, 2004
Re: Fruit fly races by Anthony Cozzie, CCC, April 06, 2005
Zappa scaling #s by Anthony Cozzie, CCC, August 23, 2005
Re: Zappa Retail: No UCI? by Anthony Cozzie, CCC, September 04, 2005
Re: what do we know about zappa by Anthony Cozzie, CCC, December 12, 2005
Zappa Hardware Upgrade by Anthony Cozzie, CCC, December 23, 2005
Zappa Report by Anthony Cozzie, CCC, December 30, 2005 » IPCCC 2005 b
Re: Zappa Report by Ingo Althöfer, CCC, December 30, 2005 ^[13]
Re: Strelka 2.0 pg 4 by Anthony Cozzie, Rybka Forum, January 11, 2008
Anthony Cozzie speak ! by Silvian, Rybka Forum, February 03, 2008 ^[14]
My two cents by Anthony Cozzie, CCC, August 27, 2008
Longer Article by Anthony Cozzie, CCC, March 17, 2011

External Links

Anthony Cozzie's ICGA Tournaments
Anthony Cozzie's page
World Computer Chess Champion: Zap!Chess by ChessBase, April 13, 2006
Anthony Cozzie speaks about Rybka source code from Steve Lim / SuperSteve3d - Home, February 04, 2008 » Rybka, Strelka ^[15]

References

^ Anthony Cozzie (2011). Detecting and Combining Programming Patterns. Ph.D. thesis, University of Illinois at Urbana-Champaign, advisor Samuel T. King
^ CV Anthony Cozzie (pdf)
^ Zappa - Retirement
^ Subject: CCC Retirement by Zappa, CCC, January 13, 2006
^ Zappa Chess Engine
^ Chessprogram Zappa from Wikipedia
^ Anthony Cozzie's page
^ Photo by Gerd Isenberg
^ Zappa - Junior by Anthony Cozzie, CCC, August 19, 2005
^ Reykjavík 2005 - Chess - Round 7 - Game 3 (ICGA Tournaments)
^ WM Mexiko-City 2007: 108 Bilder, Namen, Themen, kommentiert, ... (German) Chess Tigers News October 08, 2007
^ DBLP: Anthony Cozzie
^ Ingo Althöfer (1993). On Telescoping Linear Evaluation Functions. ICCA Journal, Vol. 16, No. 2
^ Anthony Cozzie speaks about Rybka source code from Steve Lim / SuperSteve3d - Home, February 04, 2008
^ Anthony Cozzie speak ! by Silvian, Rybka Forum, February 03, 2008

What links here?

Page	Date Edited
Anthony Cozzie	Nov 5, 2016
Artificial Intelligence	Apr 9, 2018
Arturo Ochoa	May 4, 2017
Attack and Defend Maps	Nov 5, 2016
CCT10	May 5, 2013
CCT5	Feb 22, 2013
CCT6	May 29, 2014
CCT7	Dec 16, 2017
CCT8	Apr 6, 2013
CCT9	Aug 25, 2013
ChessBase (Database)	Feb 26, 2018
Clones	Jan 16, 2017
Data	Nov 26, 2017
Erdogan Günes	Jul 7, 2017
Fabien Letouzey	Feb 5, 2018
Futé	Apr 13, 2017
Gothmog	Nov 28, 2013
Hardware	Jan 20, 2018
Hash Move	Oct 4, 2017
Hash Table	Jan 1, 2018
ICGA Investigations	May 8, 2015
ICGA Journal	Dec 21, 2017
IPCCC 2005 b	Apr 15, 2013
Jean-Louis Boussin	Jan 7, 2016
Mathematician	Apr 9, 2018
MTD(f)	Jul 17, 2017
People	Feb 28, 2018
Peter Berger	Feb 29, 2016
Razoring	Oct 5, 2015
Robert Hyatt	Dec 25, 2017
Rondo	Jan 7, 2016
RWBC	Jun 2, 2016
Rybka	Mar 27, 2017
Rybka Controversy	Jan 18, 2018
Shannon Trophy	Jul 7, 2017
Shared Hash Table	Sep 11, 2017
Stefan Meyer-Kahlen	Jun 19, 2017
Strelka	May 17, 2016
TLCS-TLCV	Dec 27, 2017
Transposition Table	Apr 19, 2018
University of Illinois at Urbana-Champaign	Oct 12, 2016
WCCC 2005	Dec 27, 2016
WCCC 2006	Jan 28, 2018
WCCC 2007	Jan 2, 2017
WCCC 2010	Jan 6, 2017
WCRCC 2007	Nov 21, 2016
Yngvi Björnsson	Jun 26, 2017
Zach Wegner	Jan 7, 2016
Zappa	Oct 24, 2017
Zappa versus Rybka 2007	Nov 25, 2017
Zobrist Hashing	Jan 22, 2018

Up one level

Ard van Bergen

GerdIsenberg — Mon, 12 Dec 2016 20:52:38 GMT

Home * People * Ard van Bergen

		Ard van Bergen, a Dutch physicist, owner of Novidec Ltd. ^[1], and former computer chess and game programmer. Ard is author of the chess programs PK80/83 and Shess, and the Draughts program TN83.
Ard van Bergen ^[2]

Quotes

Photos

Selected Publications

External Links

References

What links here?

Quotes

from Ard's Chesspage ^[3]:

Also, when I was a student, I started to develop my own chess program which competed many times in the Dutch National Championship organised by the CSVN. The best result my program obtained was a shared second place in 1983. It also competed twice (Cologne 1986 and Edmonton 1989) in the World Championship organised by the ICCA (now ICGA).

Photos

A.R.D. van Bergen, WMCCC 1985 ^[4]

Selected Publications

^[5]

Sicco Kooi, Ard van Bergen (1985). The 5th World Microcomputer-Chess Championship. ICCA Journal, Vol. 8, No. 3 » WMCCC 1985
Ard van Bergen (1985). An Ulti-Mate Look at the KPK Data Base. ICCA Journal, Vol. 8, No. 4
Ard van Bergen and Theo van der Storm (1986). The KPK Endgame: a Unit Correction. ICCA Journal, Vol. 9, No. 1
Ard van Bergen (1989). The 1st Computer Olympiad, August 9-15, 1989. ICCA Journal, Vol. 12, No. 3 » 1st Computer Olympiad

External Links

References

^ Ard Van Bergen - LinkedIn
^ homepage of Ard van Bergen
^ Ard's Chesspage
^ Computerschaak pagina 2 (Dutch) Redactie: J. ten Have and Drs. S. Kooi
^ ICGA Reference Database (pdf)

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
3rd Computer Olympiad	Jul 25, 2017
4th Computer Olympiad	Jul 15, 2017
Ard van Bergen	Dec 12, 2016
DOCCC 1981	Nov 14, 2015
DOCCC 1982	Nov 14, 2015
DOCCC 1983	Nov 13, 2015
DOCCC 1984	May 22, 2016
DOCCC 1985	Dec 9, 2016
DOCCC 1986	Dec 9, 2016
DOCCC 1987	Dec 9, 2016
DOCCC 1992	Dec 12, 2016
DOCCC 1993	Dec 12, 2016
Don Dailey	Dec 7, 2016
Draughts	Jul 12, 2017
ICGA Journal	Dec 21, 2017
International Computer Chess Tournament 1984	Dec 21, 2017
KPK	May 12, 2016
People	Feb 28, 2018
PK	Jan 8, 2016
Rex	Jan 7, 2016
Shess	Jan 7, 2016
Theo van der Storm	Apr 5, 2017
WCCC 1986	Jul 27, 2017
WCCC 1989	Dec 5, 2017
WMCCC 1985	Feb 6, 2018

Up one level

Arie de Bruin

GerdIsenberg — Mon, 23 May 2016 09:05:58 GMT

Home * People * Arie de Bruin

		Arie de Bruin, a Dutch computer scientist and professor at the Department of Computer Science, Faculty of Economics, Erasmus University Rotterdam. Arie de Bruin research interests cover various search algorithms, especially with Wim Pijls the investigation on Stockman's SSS* algorithm, which they declared "dead" at the 8th Advances in Computer Chess conference 1996 ^[1].
Arie de Bruin ^[2]

Photos

Selected Publications

Photos

Kees Sio, Arie de Bruin and Theo van der Storm, WCCC 2002 ^[3]

Selected Publications

^[4] ^[5]

1990 ...

Wim Pijls, Arie de Bruin (1990). Another View on the SSS* Algorithm. International Symposium SIGAL '90 (eds. T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki), pp. 211-220. Tokyo, Japan. Lecture Notes in Computer Science, Vol. 450, Springer-Verlag, New York, NY. ISSN 0302-9743.
Wim Pijls, Arie de Bruin (1992). Searching Informed Game Trees. Report EUR-CS-92-02, Department of Computer Science, Erasmus University Rotterdam. An extended abstract in Proceedings CSN 92, pp. 246-256, and Algorithms and Computation, Proceedings of the Third International Symposium ISAAC 92 (eds. T. Ibaraki, Y. Inagaki, K. Iwama, T. Nishizeki and M. Yamashita), pp. 332-341, Nagoya 1992, published in Lecture Notes in Computer Science, Vol. 650.
Wim Pijls, Arie de Bruin (1993). SSS*-like Algorithms in Constrained Memory. ICCA Journal, Vol. 16, No. 1
Wim Pijls, Arie de Bruin (1993). A Framework for Game Tree Algorithms. Report EUR-CS-93-03. Department of Computer Science, Erasmus University, Rotterdam, The Netherlands.
Wim Pijls, Arie de Bruin (1994). Generalizing Alpha-Beta. Advances in Computer Chess 7
Arie de Bruin, Wim Pijls, Aske Plaat (1994). Solution Trees as a Basis for Game Tree Search. Technical Report EUR-CS-94-04, Department of Computer Science, Erasmus University Rotterdam. pdf
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994). Nearly Optimal Minimax Tree Search? Technical Report, University of Alberta
Arie de Bruin, Wim Pijls, Aske Plaat (1994). Solution Trees as a Basis for Game-Tree Search. ICCA Journal, Vol. 17, No. 4
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994). SSS* = a-b TT. TR-CS-94-17, University of Alberta
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994). A New Paradigm for Minimax Search. TR 94-18

1995 ...

Wim Pijls, Arie de Bruin, Aske Plaat (1995). Solution Trees as a Basis for Game Tree Search. Tech. Report EUR-CS-95-01, Department of Computer Science, Erasmus University Rotterdam, Rotterdam, The Netherlands.
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1995). Best-First Fixed Depth Game Tree Search in Practice. Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-95), Vol. 1, pp. 273-279. Montreal, Quebec, Canada. ps
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Best-First Fixed-Depth Minimax Algorithms. Artificial Intelligence, Vol. 87, Nos. 1-2, pp. 255-293. ISSN 0004-3702, pdf
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Exploiting Graph Properties of Game Trees. 13th National Conference on Artificial Intelligence (AAAI-96), Vol. 1, pp. 234-239, ISBN 978-0-262-51091-2. pdf, ps, see Enhanced Transposition Cutoff
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). An Algorithm Faster than NegaScout and SSS* in Practice, pdf from CiteSeerX, covers MTD(f)
Arie de Bruin, Wim Pijls (1997). SSS†. Advances in Computer Chess 8
Wim Pijls, Arie de Bruin (1998). Game Tree Algorithms and Solution Trees. CG 1998
Aske Plaat, Arie de Bruin, Jonathan Schaeffer, Wim Pijls (1999). A Minimax Algorithm better than SSS*. Artificial Intelligence, Vol. 87, pp. 255–293. ISSN 0004-3702.

2000 ...

Wim Pijls, Arie de Bruin (2001). Game tree algorithms and solution trees. Department of Computer Science, Erasmus University, Rotterdam, The Netherlands, pdf

External Links

Welcome to the homepage of Arie de Bruin

References

^ Arie de Bruin, Wim Pijls (1997). SSS†. Advances in Computer Chess 8
^ Welcome to the homepage of Arie de Bruin
^ 10e WK Computerschaak, 6-11 juli 2002, Maastricht, CSVN site
^ ICGA Reference Database (pdf)
^ dblp: Arie de Bruin

What links here?

Page	Date Edited
Advances in Computer Chess 7	Oct 28, 2014
Advances in Computer Chess 8	Jun 26, 2017
Alexander Reinefeld	Jul 4, 2016
Arie de Bruin	May 23, 2016
Aske Plaat	Jun 26, 2017
Best-First	Dec 29, 2017
CG 1998	May 28, 2015
Enhanced Transposition Cutoff	May 19, 2017
ICGA Journal	Dec 21, 2017
Jonathan Schaeffer	Jan 29, 2018
Mathematician	Apr 9, 2018
Memory	Dec 8, 2017
MTD(f)	Jul 17, 2017
Novag Best-Publication Awards to Include	Jan 2, 2014
People	Feb 28, 2018
Search	Feb 1, 2018
Search Tree	Dec 23, 2016
SSS* and Dual*	Jan 22, 2018
Sunfish	Jan 11, 2018
Uncertainty Cut-Offs	Jul 21, 2015
Wim Pijls	May 23, 2016

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

Aske Plaat

GerdIsenberg — Mon, 26 Jun 2017 09:57:20 GMT

Home * People * Aske Plaat

		Aske Plaat, a Dutch computer scientiest. In 1993 he started as a PhD student at the University of Alberta , and at the Erasmus University Rotterdam. In 1997 he was a postdoc at MIT's LCS, where he worked with Charles Leiserson and Don Dailey on Cilkchess at the Supercomputing Technologies Group. Until 1999 he was researcher in the Computer Systems Group of the Vrije Universiteit in Amsterdam where he worked on Wide Area Algorithms. Next, he worked in IT Governance at PriceWaterhouse Coopers, and the Ministry of Justice in the Netherlands. Since October 2009 he is professor of information and complex decision making at Tilburg University. Since 2014 he is professor of data science at the Leiden Centre of Data Science, Leiden Institute of Advanced Computer Science (LIACS), Leiden University. Aske Plaat is creator of the MTD(f) ^[1] ^[2] search algorithm as applied in Cilkchess ^[3]. He is deputy editor of the Journal of the International Computer Games Association ICGA.
Aske Plaat ^[4]

See also

Selected Publications

Selected Publications

^[5] ^[6]

1994

Arie de Bruin, Wim Pijls, Aske Plaat (1994). Solution Trees as a Basis for Game Tree Search. Technical Report EUR-CS-94-04, Department of Computer Science, Erasmus University Rotterdam. pdf
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994). Nearly Optimal Minimax Tree Search? Technical Report, University of Alberta
Arie de Bruin, Wim Pijls, Aske Plaat (1994). Solution Trees as a Basis for Game-Tree Search. ICCA Journal, Vol. 17, No. 4
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994). SSS* = a-b TT. TR-CS-94-17, University of Alberta
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994). A New Paradigm for Minimax Search. TR 94-18

1995

Wim Pijls, Arie de Bruin, Aske Plaat (1995). Solution Trees as a Basis for Game Tree Search. Tech. Report EUR-CS-95-01, Department of Computer Science, Erasmus University Rotterdam
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1995). Best-First Fixed Depth Game Tree Search in Practice. Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-95), Vol. 1, pp. 273-279. Montreal, Quebec, Canada. ps

1996

Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Best-First Fixed-Depth Minimax Algorithms. [[https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29Artificial Intelligence]], Vol. 87, Nos. 1-2, pdf
Aske Plaat (1996). Research Re: Search & Re-Search. Ph.D. thesis, Erasmus University, Rotterdam, The Netherlands.
Jonathan Schaeffer, Aske Plaat (1996). New Advances in Alpha-Beta Searching. Proceedings of the 1996 ACM Computer Science Conference, pp. 124-130. ACM Press, New York, N.Y. pdf from CiteSeerX
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Exploiting Graph Properties of Game Trees. AAAI-96, Vol. 1, pdf » Enhanced Transposition Cutoff
Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). An Algorithm Faster than NegaScout and SSS* in Practice. pdf from CiteSeerX, covers MTD(f)
Yngvi Björnsson, Mark Brockington, Andreas Junghanns, Aske Plaat (1996). Report on the Advances in Computer Chess 8 Conference. ICCA Journal, Vol. 19, No. 3 » Advances in Computer Chess 8

1997 ...

Aske Plaat (1997). MTD(f), A Minimax Algorithm Faster Than NegaScout. Internal Report, Erasmus University Rotterdam
Jonathan Schaeffer, Aske Plaat (1997). Kasparov versus Deep Blue: The Rematch. ICCA Journal, Vol. 20, No. 2
Aske Plaat, Arie de Bruin, Jonathan Schaeffer, Wim Pijls (1999). A Minimax Algorithm better than SSS*. Artificial Intelligence, Vol. 87
John Romein, Aske Plaat, Henri Bal, Jonathan Schaeffer (1999). Transposition Table Driven Work Scheduling in Distributed Search. AAAI-99, pdf ^[7] ^[8]

2000 ...

Jonathan Schaeffer, Aske Plaat, Andreas Junghanns (2001). Unifying Single-agent and Two-player search. Information Sciences, Vol. 135, ps
John Romein, Henri Bal, Jonathan Schaeffer, Aske Plaat (2002). A Performance Analysis of Transposition-Table-Driven Scheduling in Distributed Search. IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 5, pp. 447–459. pdf ^[9]

2010 ...

Jaap van den Herik, Aske Plaat, Johanna Hellemons (2010). The JAIST Computer Olympiad. ICGA Journal, Vol. 33, No. 3 » 15th Computer Olympiad
Jaap van den Herik, Aske Plaat, Johanna Hellemons (2010). The JAIST Computer Olympiad (Part 2). ICGA Journal, Vol. 33, No. 4

2011

Jaap van den Herik, Aske Plaat, Johanna Hellemons (2011). The JAIST Computer Olympiad (Part 3). ICGA Journal, Vol. 34, No. 1
Jaap van den Herik, Aske Plaat, Johanna Hellemons (2011). The JAIST Computer Olympiad (Part 4). ICGA Journal, Vol. 34, No. 2

2012

Jaap van den Herik, Aske Plaat (2012). The 13th Advances in Computer Games Conference. ICGA Journal, Vol. 35, No. 1 » Advances in Computer Games 13
Jaap van den Herik, Aske Plaat, Johanna Hellemons (2012). The 16th Computer Olympiad. ICGA Journal, Vol. 35, No. 1 » 16th Computer Olympiad
Jaap van den Herik, Aske Plaat, Johanna Hellemons (2012). The 16th Computer Olympiad (part 2). ICGA Journal, Vol. 35, No. 2
Jaap van den Herik, Aske Plaat, Johanna Hellemons (2012). The 16th Computer Olympiad (part 3). ICGA Journal, Vol. 35, No. 4
Jan Kuipers, Aske Plaat, Jos Vermaseren, Jaap van den Herik (2012). Improving multivariate Horner schemes with Monte Carlo tree search. CoRR abs/1207.7079

2013

Mohamed Abbadi, Francesco Di Giacomo, Giuseppe Maggiore, Aske Plaat, Renzo Orsini, Pieter Spronck (2013). Resources, Entities, Actions. A generalized design pattern for RTS games and its language extension in Casanova. CG 2013, pdf
Jaap van den Herik, Hiroyuki Iida, Aske Plaat (2013). The 8th Computers and Games Conference. ICGA Journal, Vol. 36, No. 3 » CG 2013
Jaap van den Herik, Hiroyuki Iida, Aske Plaat, Johanna Hellemons (2013). The Brain and Mind Sports Olympiad. ICGA Journal, Vol. 36, No. 3 » 17th Computer Olympiad
Jaap van den Herik, Hiroyuki Iida, Aske Plaat (2013). The 8th Computers and Games Conference (Part 2). ICGA Journal, Vol. 36, No. 4 » CG 2013
Jaap van den Herik, Hiroyuki Iida, Aske Plaat, Johanna Hellemons (2013). The Brain and Mind Sports Olympiad (Part 2). ICGA Journal, Vol. 36, No. 4 » 17th Computer Olympiad
Ben Ruijl, Jos Vermaseren, Aske Plaat, Jaap van den Herik (2013). Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification. CoRR abs/1312.0841

2014

Aske Plaat (2014). Don Dailey, 1956-2013, an Obituary. ICGA Journal, Vol 37, No. 1 » Don Dailey
Ben Ruijl, Jos Vermaseren, Aske Plaat, Jaap van den Herik (2014). HEPGAME and the Simplification of Expressions. CoRR abs/1405.6369
S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik, Jos Vermaseren (2014). Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi. CoRR abs/1409.4297 » Go, MCTS
Ben Ruijl, Jos Vermaseren, Aske Plaat, Jaap van den Herik (2014). Why Local Search Excels in Expression Simplification. CoRR abs/1409.5223
Jaap van den Herik, Aske Plaat, David Levy, Daniel Dimov (2014). Plagiarism in Game Programming Competitions. Entertainment Computing, Vol. 5, No. 3, pdf preprint
Jaap van den Herik, Hiroyuki Iida, Aske Plaat (eds.) (2014). Computers and Games: 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers. LNCS 8427, Springer, ISBN-13: 978-3-319-09164-8 » CG 2013 ^[10]
Richard Absalom, Marcus Luczak-Rosch, Dap Hartmann, Aske Plaat (2014). Crowd-Sourcing Fuzzy and Faceted Classification for Concept Search. arXiv:1406.7749, CoRR, June 2014

2015 ...

Taichi Ishitobi, Aske Plaat, Hiroyuki Iida, Jaap van den Herik (2015). Reducing the Seesaw Effect with Deep Proof Number Search. Advances in Computer Games 14
S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik, Jos Vermaseren (2015). Scaling Monte Carlo Tree Search on Intel Xeon Phi. CoRR abs/1507.04383 » Hex, MCTS, Parallel Search, x86-64
S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik, Jos Vermaseren (2015). Parallel Monte Carlo Tree Search from Multi-core to Many-core Processors. TrustCom/BigDataSE/|ISPA 2015, pdf
S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik (2015). Ensemble UCT Needs High Exploitation. CoRR abs/1509.08434
Jaap van den Herik, Walter Kosters, Aske Plaat, Johanna Hellemons (2015). The 18th Computer Olympiad 2015. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad

External Links

References

^ Aske Plaat: MTD(f), a new chess algorithm
^ MTD(f) - A Minimax Algorithm faster than NegaScout
^ Aske Plaat's ICGA Tournaments
^ plaat.nl
^ ICGA Reference Database (pdf)
^ dblp: Aske Plaat
^ Re: scorpio can run on 8192 cores by Daniel Shawul, CCC, August 29, 2015
^ Transposition-driven scheduling - Wikipedia
^ Transposition driven scheduling by Daniel Shawul, CCC, April 04, 2013
^ Dap Hartmann (2014). A Statue of unremitting Devotion. Revised Selected papers CG 2013. (Review) ICGA Journal, Vol. 37, No. 3

What links here?

Page	Date Edited
15th Computer Olympiad	Aug 12, 2017
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
Advances in Computer Chess 8	Jun 26, 2017
Advances in Computer Games 13	Jan 7, 2017
Advances in Computer Games 14	Aug 11, 2017
Alexander Reinefeld	Jul 4, 2016
Andreas Junghanns	Jun 26, 2017
Arie de Bruin	May 23, 2016
Aske Plaat	Jun 26, 2017
Ben Ruijl	Jan 11, 2016
Best-First	Dec 29, 2017
Centipawns	Aug 9, 2016
CG 2013	Jul 18, 2017
ChessBase	Nov 25, 2017
Cilkchess	Jan 21, 2016
Clones	Jan 16, 2017
Daniel Dimov	Jan 16, 2015
Daniel Shawul	Jan 28, 2018
Dap Hartmann	Jun 10, 2017
David Levy	Jan 3, 2017
Deep Blue	Aug 1, 2017
DOCCC 1996	Jun 7, 2016
Don Dailey	Dec 7, 2016
Enhanced Transposition Cutoff	May 19, 2017
Francesco Di Giacomo	May 4, 2014
Giuseppe Maggiore	May 3, 2014
Go	Jan 24, 2018
Henri Bal	Aug 5, 2016
Hex	Dec 29, 2017
Hiroyuki Iida	Aug 11, 2017
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Johanna Hellemons	Jan 8, 2017
John Romein	Aug 5, 2016
Jonathan Schaeffer	Jan 29, 2018
Jos Vermaseren	Jan 12, 2016
Kasparov versus Deep Blue 1997	Aug 1, 2017
Languages	Nov 26, 2017
Leiden University	Jul 5, 2016
Mark Brockington	Jun 26, 2017
Massachusetts Institute of Technology	Jan 24, 2017
Mathematician	Apr 9, 2018
Mohamed Abbadi	May 3, 2014
Monte-Carlo Tree Search	Apr 26, 2018
MTD(f)	Jul 17, 2017
Novag Best-Publication Awards to Include	Jan 2, 2014
Parallel Search	Dec 30, 2017
People	Feb 28, 2018
Pepito	Nov 27, 2014
Pieter Spronck	Jan 5, 2017
Proof-number search	Jan 22, 2018
Renzo Orsini	May 3, 2014
Rybka Controversy	Jan 18, 2018
S. Ali Mirsoleimani	Jan 15, 2016
Score	Apr 14, 2018
Search Tree	Dec 23, 2016
Shared Hash Table	Sep 11, 2017
Simulated Annealing	May 8, 2017
SSS* and Dual*	Jan 22, 2018
Sunfish	Jan 11, 2018
Taichi Ishitobi	Jan 23, 2016
Tilburg University	Jan 7, 2017
Transposition Table	Apr 19, 2018
UCT	Jan 22, 2018
Uncertainty Cut-Offs	Jul 21, 2015
University of Alberta	Feb 20, 2018
Walter Kosters	Jan 8, 2017
WCCC 1999	Jul 13, 2017
WCCC 2015	Jun 13, 2017
WCSC 2015	Jun 13, 2017
Wim Pijls	May 23, 2016
x86-64	Mar 6, 2018
Yngvi Björnsson	Jun 26, 2017

Up one level

Wikispaces : chessprogramming - items matching description

Aaron L. Futer

Table of Contents

Selected Publications

See also

External Links

References

What links here?

Adam Kujawski

Table of Contents

See also

Publications

External Links

References

What links here?

Alan Kotok

Table of Contents

See also

Selected Publications

External Links

References

What links here?

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?

Albert Gower

Table of Contents

Selected Publications

External Links

References

What links here?

Alex Bernstein

Table of Contents

Quotes

See also

Publications

External Links

References

What links here?

Alexander Bitman

Table of Contents

Quotes

See also

Selected Publications

Forum Posts

External Links

References

What links here?

Alexander Brudno

Table of Contents

Photos

Quotes

John McCarthy