Wikispaces : chessprogramming - items matching description

Aaron Becker

GerdIsenberg — Wed, 22 Jul 2015 19:13:24 GMT

Home * People * Aaron Becker

		Aaron Becker, an American mathematician, computer scientist and software engineer at Google Inc. in Mountain View, California. He holds a B.Sc. in CS and mathematics from Harvey Mudd College in 2004, and a Ph.D in CS from University of Illinois at Urbana-Champaign in 2012, where he was research assistant in the Parallel Programming Lab ^[1], working on finite element methods, a multiphase shared arrays library in Charm++, adaptive MPI, parallel state space search and compiler support for productive parallel programming ^[2]. Starting in 2009, he developed the chess engine Daydreamer.
Aaron Becker ^[3]

Selected Publications

Selected Publications

^[4] ^[5]

Aaron Becker, Gengbin Zheng, Laxmikant V. Kalé (2011). Distributed Memory Load Balancing. Encyclopedia of Parallel Computing, Springer
Phil Miller, Aaron Becker, Laxmikant V. Kalé (2011). Using Shared Arrays in Message-Driven Parallel Programs. HIPS 2011
Aaron Becker (2012). Compiler Support for Productive Message-Driven Parallel Programming. Ph.D. thesis, University of Illinois at Urbana-Champaign, advisor Laxmikant V. Kalé

Forum Posts

Test suites for specific engine features by Aaron Becker, CCC, July 10, 2009
Announcing Daydreamer 1.0 by Aaron Becker, CCC, August 16, 2009
The strongest non-bitboard engine on 1 core by Aaron Becker, CCC, February 14, 2010
In praise of git, cutechess-cli, bayeselo, and pgn-extract by Aaron Becker, CCC, March 02, 2010 ^[6] ^[7] ^[8] ^[9]
UCI extensions for kibitzing by Aaron Becker, CCC, March 05, 2010 » UCI
Developments of the last two years by Aaron Becker, CCC, March 02, 2013
Re: copy/make vs make/unmake by Aaron Becker, CCC, January 07, 2014 » Copy-Make, Make Move, Unmake Move
Re: Good question: What % improvement is hardware vs. software by Aaron Becker, CCC, January 17, 2014

External Links

References

^ Aaron Becker | LinkedIn
^ Parallel Programming Laboratory - Aaron Becker
^ Aaron Becker | LinkedIn
^ Parallel Programming Laboratory - Aaron Becker
^ dblp: Aaron Becker (mixed up with Aaron T. Becker, 2012 Ph.D. in Electrical and Computer Engineering, also from University of Illinois at Urbana-Champaign)
^ Git (software) from Wikipedia
^ Cutechess-cli by Ilari Pihlajisto and Arto Jonsson
^ BayesElo by Rémi Coulom
^ pgn-extract: Portable Game Notation (PGN) Manipulator for Chess Games by David J. Barnes
^ Project Euler from Wikipedia

What links here?

Page	Date Edited
Aaron Becker	Jul 22, 2015
ACCA 2010	Jul 14, 2014
CCT12	Jan 28, 2018
Cutechess-cli	Jan 6, 2018
DayDreamer	Aug 22, 2016
Donna	Aug 17, 2017
Mathematician	Apr 9, 2018
Memory	Dec 8, 2017
Open Source Engines	Jul 14, 2015
People	Feb 28, 2018
UCI	Mar 4, 2018
University of Illinois at Urbana-Champaign	Oct 12, 2016

Up one level

Aaron L. Futer

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

Selected Publications

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

Aart Bik

GerdIsenberg — Thu, 01 Mar 2018 18:20:18 GMT

Compiler Architect

Java Compiler

Vectorization

Selected Publications

Home * People * Aart Bik

Aart J. C. Bik,
a Dutch computer scientist, compiler architect and researcher at Google Inc., and since 2013 at Google X, where he is working on the Glass Development Kit. Aart holds a Ph.D. in computer science on Compiler construction from Leiden University with the title Compiler Support for Sparse Matrix Computations ^[1] , and further researched on high-performance Java compilers, and worked for Intel on automatic SIMD vectorization for their compilers.

As chess programmer, Aart is author of the UCI compatible chess engine BikJump, and the standalone chess application Chess for Android ^[2] , which can import other UCI Engines or Winboard/Xboard engines which are natively compiled for Android (ARMv5TE for most mobile devices, x86 for some) ^[3] . More recently, he implemented Chess for Glass ^[4] .

Compiler Architect

Java Compiler

Quote from Aart homepage ^[5] :

In 1996 and 1997, Aart was a post-doctoral researcher at the Indiana University, Bloomington, Indiana, USA, where he did research in high-performance compilers for the Java programming language under supervision of prof. dr. D.B. Gannon. This research resulted in the implementation of JAVAR (a prototype Java restructuring compiler) and JAVAB (a prototype bytecode parallelization tool).

Vectorization

Aart Bik is former compiler architect concerning automatic vectorization of the Intel C++/Fortran compilers for Windows, Linux, and Mac OS, supporting SIMD Extensions (MMX, SSE, SSE2, SSE3, SSSE3, SSE4) of x86 and x86-64 processors ^[6] ^[7] , and concerning optimization.

Quote from The Software Optimization Cookbook, Second Edition ^[8] :

Aart J.C. Bik holds a PhD in computer science and is a Principal Engineer at Intel Corporation, working on the development of high performance Intel® C++ and Fortran compilers. Aart received an Intel Achievement Award, the company's highest award, for making the Intel Streaming SIMD Extensions easier to use through automatic vectorization. Aart is the author of The Software Vectorization Handbook.

Selected Publications

^[9] ^[10]

Aart Bik (1996). Compiler Support for Sparse Matrix Computations. Ph.D. thesis, Leiden University, advisor Harry A. G. Wijshoff
Aart Bik (2004). The Software Vectorization Handbook. Applying Multimedia Extensions for Maximum Performance. ISBN 0-9743649-2-4, Intel Press
Richard Gerber, Aart Bik, Kevin B. Smith and Xinmin Tian (2006). The Software Optimization Cookbook, Second Edition. Intel Press, toc as pdf
Aart Bik (2012). Computing Deep Perft and Divide Numbers for Checkers. ICGA Journal, Vol. 35, No. 4 » Perft, Checkers

Forum Posts

2005 ...

planning a SSE-optimized chess engine by Aart Bik, CCC, January 12, 2005 » SSE2
Chess for Android by Aart Bik, CCC, November 24, 2008
Upcoming Chess for Android 2.0 by Aart Bik, CCC, October 19, 2009

2010 ...

Chess for Android with UCI support released by Aart Bik, CCC, August 23, 2010
Chess for Android with UCI support released by Aart Bik, OpenChess Forum, August 23, 2010
Chess for Android 2.5 by Aart Bik, CCC, January 05, 2011
Chess for Android 2.8 by Aart Bik, CCC, April 01, 2011
Chess for Android 3.0.2: enhanced XBoard support by Aart Bik, CCC, October 24, 2011
Chess for Android upcoming network feature by Aart Bik, CCC, July 03, 2012
Chess for Android v4.1.5: sharing by Aart Bik, CCC, January 12, 2013
Chess for Glass by Aart Bik, CCC, August 08, 2014

2015 ...

Chess for Android v5.0: Time Control by Aart Bik, CCC, January 09, 2015
Chess for Android v5.3 by Aart Bik, CCC, November 27, 2017
Chess for Android v5.6 by Aart Bik, CCC, February 26, 2018

External Links

References

^ Aart Bik (1996). Compiler Support for Sparse Matrix Computations. Ph.D. thesis, Leiden University, advisor Harry A. G. Wijshoff
^ Aart's Computer Chess Page
^ UCI and XBoard Protocols for Android
^ Chess for Glass by Aart Bik, CCC, August 08, 2014
^ Aart Bik's Home Page
^ Intel Compilers: Vectorization for Multimedia Extensions
^ Aart Bik (2004). The Software Vectorization Handbook. Applying Multimedia Extensions for Maximum Performance. ISBN 0-9743649-2-4, Intel Press
^ Richard Gerber, Aart Bik, Kevin B. Smith and Xinmin Tian (2006). The Software Optimization Cookbook, Second Edition. Intel Press
^ Publications of Aart Bik
^ Papers published by A. J. C. Bik from BibNetWiki

What links here?

Page	Date Edited
Aart Bik	Mar 1, 2018
Algebraic Chess Notation	Sep 25, 2017
Android	Jan 9, 2018
BikJump	Aug 11, 2014
Checkers	Dec 23, 2017
Cheng	Jul 30, 2017
Chess for Android	Mar 1, 2018
Chess for Glass	Dec 26, 2016
ChessBase (Database)	Feb 26, 2018
Commodore 64	Oct 27, 2016
DiscoCheck	Jun 23, 2017
Entering Moves	Sep 7, 2017
Greko	Feb 27, 2018
ICGA Journal	Dec 21, 2017
Jazz	Oct 4, 2017
Komodo	Mar 6, 2018
Leiden University	Jul 5, 2016
Mathematician	Apr 9, 2018
MicroChess	Jul 14, 2015
Millennium ChessGenius	Mar 1, 2018
Othello	Jan 4, 2018
Parallel Search	Dec 30, 2017
People	Feb 28, 2018
Perft	Sep 26, 2017
RedQueen	Nov 13, 2017
SMP	Dec 26, 2017
SolusChess	Apr 21, 2015
SSE	Mar 7, 2017
SSE2	Feb 27, 2018
UCI	Mar 4, 2018

Up one level

Abdallah Saffidine

GerdIsenberg — Fri, 11 Aug 2017 19:40:25 GMT

Home * People * Abdallah Saffidine

		Abdallah Saffidine, a French computer scientist and games researcher, currently postdoc at NICTA and University of New South Wales, and Ph.D. from Lamsade, Paris Dauphine University in 2013 ^[1]. His research interests include Linear temporal logic (LTL) Model checking, Monte-Carlo Tree Search, Proof-Number Search, Product Propagation ^[2] and General Game Playing. Along with Tristan Cazenave, Abdallah Saffidine is co-author of the Hex program Yopt, applying Monte-Carlo Tree Search.
Abdallah Saffidine ^[3]

Selected Publications

Selected Publications

^[4]

2009

Abdallah Saffidine (2009). LTL Model Checking with use of Generalised Stuttering and Characteristic Patterns.

2010 ...

Abdallah Saffidine (2010). Some Improvements for Monte-Carlo Tree Search, Game Description Language Compilation, Score Bounds and Transpositions. MSc-Thesis, Lamsade, Paris Dauphine University, advisor Tristan Cazenave
Tristan Cazenave, Abdallah Saffidine (2010). Monte-Carlo Hex. pdf
Abdallah Saffidine, Tristan Cazenave, Jean Méhat (2010). UCD : Upper Confidence bound for rooted Directed acyclic graphs. TAAI IWCG, pdf
Tristan Cazenave, Abdallah Saffidine (2010). Score Bounded Monte-Carlo Tree Search. CG 2010, pdf

2011

Abdallah Saffidine (2011). Moccos wins the Panthom-Go Tournament. ICGA Journal, Vol. 34, No. 1 » 15th Computer Olympiad
Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13 » Breakthrough (Game)
Abdallah Saffidine, Tristan Cazenave (2011). A forward chaining based game description language compiler. GIGA 2011

2012

Abdallah Saffidine (2012). Minimal Proof Search for Modal Logic K Model Checking. CoRR, July 2012 ^[5]
Abdallah Saffidine, Tristan Cazenave (2012). Multiple-Outcome Proof Number Search. ECAI 2012 » Proof-Number Search
Abdallah Saffidine, Hilmar Finnsson, Michael Buro (2012). Alpha-Beta Pruning for Games with Simultaneous Moves. AAAI 2012
Abdallah Saffidine, Tristan Cazenave, Jean Méhat (2012). UCD : Upper confidence bound for rooted directed acyclic graphs. Knowledge Based Systems, Vol. 34
Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald (2012). Sparse Sampling for Adversarial Games. ECAI CGW 2012
Abdallah Saffidine, Tristan Cazenave (2012). A General Multi-Agent Modal Logic K Framework for Game Tree Search. ECAI CGW 2012

2013

Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald, Mark Winands (2013). Monte Carlo *-Minimax Search. IJCAI 2013
Abdallah Saffidine (2013). The Game Description Language is Turingcomplete. IEEE Transactions on Computational Intelligence and AI in Games
Abdallah Saffidine (2013). Solving Games and All That. Ph.D. thesis, Université Paris-Dauphine, advisor Tristan Cazenave, pdf ^[6]
Édouard Bonnet, Florian Jamain, Abdallah Saffidine (2013). Havannah and TwixT are PSPACE-complete. CG 2013 ^[7]
Abdallah Saffidine, Tristan Cazenave (2013). Developments on Product Propagation. CG 2013, pdf
Abdallah Saffidine, Nicolas Jouandeau, Cédric Buron, Tristan Cazenave (2013). Material Symmetry to Partition Endgame Tables. CG 2013
Édouard Bonnet, Florian Jamain, Abdallah Saffidine (2013). On the Complexity of Trick-Taking Card Games. IJCAI 2013 ^[8]

2014

Édouard Bonnet, Abdallah Saffidine (2014). On the Complexity of General Game Playing. ECAI CGW 2014

2015 ...

Olivier Teytaud, Abdallah Saffidine, Shi-Jim Yen (2015). The complexities of Go. Advances in Computer Games 14
Édouard Bonnet, Florian Jamain, Abdallah Saffidine (2015). Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game. Advances in Computer Games 14
Édouard Bonnet, Florian Jamain, Abdallah Saffidine (2016). On the Complexity of Connection Games. arXiv:1605.04715

External Links

References

^ Abdallah Saffidine (2013). Solving Games and All That. Ph.D. thesis, Université Paris-Dauphine, advisor Tristan Cazenave
^ Abdallah Saffidine, Tristan Cazenave (2013). Developments on Product Propagation. CG 2013, pdf
^ Optimisation Research Group - Abdallah Saffidine at NICTA
^ DBLP: Abdallah Saffidine
^ Modal logic from Wikipedia
^ Dap Hartmann (2013). From to αβ to ABCD and SMAB. Review. ICGA Journal, Vol. 36, No. 4
^ PSPACE-complete from Wikipedia
^ Trick-taking game from Wikipedia

What links here?

Page	Date Edited
13th Computer Olympiad	Jul 22, 2017
14th Computer Olympiad	Jul 23, 2017
15th Computer Olympiad	Aug 12, 2017
Abdallah Saffidine	Aug 11, 2017
Advances in Computer Games 13	Jan 7, 2017
Advances in Computer Games 14	Aug 11, 2017
Alpha-Beta	Jan 28, 2018
Breakthrough (Game)	Aug 11, 2017
CG 2010	Jan 8, 2014
CG 2013	Jul 18, 2017
Dap Hartmann	Jun 10, 2017
ECAI CGW 2012	May 21, 2015
ECAI CGW 2014	Jul 18, 2017
Edouard Bonnet	Aug 13, 2017
Endgame Tablebases	Mar 6, 2018
Florian Jamain	Aug 11, 2017
Games	Feb 20, 2018
General Game Playing	Dec 22, 2017
Go	Jan 24, 2018
Havannah	Jan 8, 2017
Hex	Dec 29, 2017
ICGA	Jul 8, 2017
ICGA Journal	Dec 21, 2017
Jean Méhat	Jan 19, 2016
Joel Veness	Dec 8, 2017
Marc Lanctot	Jan 10, 2018
Mark Winands	Sep 19, 2017
Mathematician	Apr 9, 2018
Michael Buro	Dec 21, 2016
Monte-Carlo Tree Search	Apr 26, 2018
Nicolas Jouandeau	Jun 29, 2017
Olivier Teytaud	Jan 7, 2017
Pattern Recognition	Sep 8, 2017
People	Feb 28, 2018
Proof-number search	Jan 22, 2018
Search	Feb 1, 2018
Shi-Jim Yen	Jul 22, 2017
Tristan Cazenave	Jan 22, 2018
University of Paris	Nov 26, 2015

Up one level

Adriaan de Groot

GerdIsenberg — Mon, 06 Oct 2014 15:28:21 GMT

Home * People * Adriaan de Groot

		Adrianus Dingeman (Adriaan) de Groot, (October 26, 1914 - August 14, 2006), was a Dutch psychologist and chess master, who conducted a number of ground-breaking experiments in the cognitive processes that occur in the brains of strong chess players. The studies involve participants of all chess backgrounds, from amateurs to masters. They investigate the cognitive requirements and the thought processes involved in moving a chess piece. The participants were usually required to solve a given chess problem correctly under the supervision of an experimenter and represent their thought-processes vocally so that they could be recorded.
Adriaan de Groot ^[1]

Selected Publications

External Links

References

What links here?

Quotes

Chase & Simon

William Chase and Herbert Simon in Perception in chess, 1973 ^[2]

The most extensive work to date on perception in chess is that done by De Groot. In his search for differences between masters and weaker players, de Groot was unable to find any gross differences in the statistics of their thought processes: the number of moves considered, search heuristics, depth of search, and so on. Masters search through about the same number of possibilities as weaker players-perhaps even fewer, almost certainly not more-but they are very good at coming up with the “right” moves for further consideration, whereas weaker players spend considerable time analyzing the consequences of bad moves. De Groot did, however, find an intriguing difference between masters and weaker players in his short-term memory experiments. Masters showed a remarkable ability to reconstruct a chess position almost perfectly after viewing it for only 5 sec. There was a sharp drop off in this ability for players below the master level. This result could not be attributed to the masters’ generally superior memory ability, for when chess positions were constructed by placing the same numbers of pieces randomly on the board, the masters could then do no better in reconstructing them than weaker players, Hence, the masters appear to be constrained by the same severe short-term memory limits as everyone else, and their superior performance with “meaningful’ positions must lie in their ability to perceive structure in such positions and encode them in chunks.

Fernand Gobet

Fernand Gobet in Adriaan de Groot: Marriage of two Passions, 2006 ^[3], two excerpts :

Through the intervention of his friend Max Euwe, de Groot managed to convince, among others, most of the AVRO players to participate in his experiments. Chess giants such as Alekhine, Euwe, Fine, Flohr, and Keres agreed to act as subjects. Some of the experiments – for example, the one with Tartakover – were run on the steamer carrying the players to the 1939 Olympiads in Argentina. The protocols are reproduced in the English edition of de Groot’s thesis and, apart from their scientific value, are great fun for chess aficionados to read.

...

De Groot proposed also that a player’s thinking process may be divided into four main phases: orientation, exploration, investigation, and proof. In the orientation phase, players collect relevant information and try to form a first (tentative) judgment of the position. During the exploration phase, sample variations are analysed, and, typically, the number of critical moves or plans is reduced to two. The two candidate moves are analysed in great detail during the investigation phase, which is characterised by a more in-depth search than during the exploration phase. Players strive to validate their favourite move (or plan). Note that most of the argumentation used by chess players consists of convincing themselves that one of the two variations is better than the other. Finally, the proof phase is used to recapitulate the information obtained in the analysis and to check the correctness of the argumentation.

Four Stages

De Groot defined four stages of the thought process:

The orientation phase – grasp the position and formulate general ideas of what to do.
The exploration phase – analysis of concrete variations.
The investigation phase – choice of a probable best move.
The proof phase – confirming the validity of the choice reached in phase three.

His Ph.D. Thesis Het denken van den Schaker ^[4] was already cited in Claude Shannon's paper ^[5] . In "Thought and Choice in Chess", 1965, De Groot introduced iterative or progressive deepening. His book became the bible for chess programmers in the late sixties during the zenith of the Type B programs.

Euratom

An AI-effort in machine translation and on developing a computer chess program in the "human style" was conducted under the auspices of Euratom agency in the 60s in the spirit of its President Étienne Hirsch and a team around Max Euwe, Adriaan de Groot, François Lionnais, Claude Berge and Marcel Barzin ^[6] :

Finally an important international team had been gathered around Max Euwe (former world champion) to work on the problem of the simulation of the play of the failures. One found there the encyclopedist François Lionnais, the mathematician Claude Berge, the logician Barzin, the psychologist De Groot. This team made considerably progress on the problems of the mediums of part, but did not have the possibility of carrying out a program of a complete set.

Selected Publications

Adriaan de Groot (1946). Het denken van den Schaker, een experimenteel-psychologische studie. Ph.D. thesis, University of Amsterdam, advisor Géza Révész; N.V. Noord-Hollandse Uitgevers Maatschappij, Amsterdam. Translated with the help of George Baylor, with additions, (in 1965) as Thought and Choice in Chess. Mouton Publishers, The Hague. ISBN 90-279-7914-6.
Adriaan de Groot (1965, 1978). Thought and Choice in Chess. Mouton & Co Publishers, The Hague, The Netherlands. ISBN 90-279-7914-6, amazon, google

Adriaan de Groot (1966). Perception and Memory versus Thought: Some Old Ideas and Recent Findings. Problem Solving: Research, Method, and Theory. (ed. B. Kleinmuntz), pp. 19-50. John Wiley, New York.
Adriaan de Groot, Walter R. Reitman (eds.) (1966). Heuristic Processes in Thinking. International Congress of Psychology, Nauka, Moscow
Adriaan de Groot (1986). Intuition in Chess. ICCA Journal, Vol. 9, No. 2
Adriaan de Groot (1987). Some Benefits of Advances in Computer Chess. ICCA Journal, Vol. 10, No. 2
Adriaan de Groot (1988). A Rejoinder to I.J. Good's Comments. ICCA Journal, Vol. 11, Nos. 2/3 ^[7]
Adriaan de Groot (1989). Some Special Benefits of Advances in Computer Chess. Advances in Computer Chess 5
Adriaan de Groot (1992). Allen Newell: An Adieu. ICCA Journal, Vol. 15, No. 3
Adriaan de Groot, Fernand Gobet (1996). Perception and Memory in Chess: Heuristics of the professional eye. Van Gorcum and Comp. B.V., Assen, The Netherlands. ISBN 90-232-2949-5. Chapter 9; A discussion: Two authors, two different views? available as word reprint.
Fernand Gobet (2006). Adriaan de Groot: Marriage of two Passions. ICGA Journal, Vol. 29, No. 4, pdf
Merim Bilalić, Peter McLeod, Fernand Gobet (2011). Expert and “novice” problem solving strategies in chess: Sixty years of citing de Groot (1946). Thinking and Reasoning, Vol. 14, No. 4
Michael H. Connors, Bruce D. Burns, Guillermo Campitelli (2011). Expertise in complex decision making: the role of search in chess 70 years after de Groot. Cognitive Science, Vol. 35, No. 8

External Links

Adriaan de Groot from Wikipedia
The Mathematics Genealogy Project - Adriaan de Groot
Adriaan de Groot facts - Freebase
Adriaan de Groot games at chessgames.com
Computer Chess: The Drosophila of AI by L. Stephen Coles, Dr. Dobb's Portal 2002
A brief survey of psychological studies of chess Copyright © 2001 Mark Jeays
Grondlegger Cito overleden (Dutch) from Reformatorisch Dagblad, August 15, 2006
Adriaan de Groot, chess psychologist (1914–2006) by Frederic Friedel, ChessBase, August 16, 2006
`Voor zo'n erkenning moet je vrij oud worden' - UT Nieuws - weekblad (Dutch) from University of Twente, August 24, 2006
Dorpsbode Schiermonnikoog - Prof. dr. A.D. de Groot overleden (Dutch), September 01, 2006
Het denken van de schaker from The Max Pam Globe, September 2006

References

^ WCCC 1986 Video
^ William Chase, Herbert Simon (1973). Perception in chess. Cognitive Psychology, Vol. 4, No. 1, pdf
^ Fernand Gobet (2006). Adriaan de Groot: Marriage of two Passions. ICGA Journal, Vol. 29, No. 4, pdf
^ Adriaan de Groot (1946). Het denken van den Schaker, een experimenteel-psychologische studie. Ph.D. thesis, University of Amsterdam, advisor Géza Révész; N.V. Noord-Hollandse Uitgevers Maatschappij, Amsterdam. Translated with the help of George Baylor, with additions (in 1965) as Thought and Choice in Chess. Mouton Publishers, The Hague. ISBN 90-279-7914-6. (amazon)
^ Claude Shannon (1949). Programming a Computer for Playing Chess (raw text)
^ Le langage / Intelligence et artifices, by Paul Braffort 2002 (French) translated by babelfish
^ Jack Good (1988). Some Comments Concerning an Article by De Groot. ICCA Journal, Vol. 11, No. 2/3

What links here?

Page	Date Edited
Adriaan de Groot	Oct 6, 2014
Advances in Computer Chess 5	Dec 2, 2017
Allen Newell	Jun 12, 2017
Automated Tuning	Feb 27, 2018
Barend Swets	Jan 7, 2016
Bill Jordan	Feb 23, 2017
Bs6676	Jul 21, 2016
Butterfly Heuristic	May 6, 2016
Checkmate	Apr 13, 2018
Chess Psychology Booklist	Apr 11, 2013
CHREST	May 6, 2016
Chunking	Jun 12, 2017
Claude Shannon	Apr 30, 2016
Cognition	Dec 8, 2017
Computer Chess Compendium	Dec 29, 2015
Dap Hartmann	Jun 10, 2017
Eliot Slater	Aug 6, 2016
Evaluation	Feb 1, 2018
Eye Movements	Jul 22, 2015
Fernand Gobet	May 11, 2017
Frederic Friedel	Jan 6, 2018
George Baylor	Sep 22, 2014
Hartmut Tanke	Sep 7, 2014
Herbert Simon	Feb 11, 2016
ICGA Journal	Dec 21, 2017
Iterative Deepening	Jun 23, 2017
Jaap van den Herik	Sep 18, 2017
Jack Good	Dec 22, 2017
Jan Eric Larsson	Dec 11, 2013
Jan van Reek	Aug 18, 2016
Learning	Feb 20, 2018
Mate Search	Oct 22, 2016
Mater	Apr 26, 2016
Mathematician	Apr 9, 2018
Max Euwe	Oct 10, 2015
Memory	Dec 8, 2017
Mobility	Jan 17, 2018
People	Feb 28, 2018
Peter van Diepen	Nov 5, 2015
Peter W. Frey	Dec 25, 2017
Planning	Feb 12, 2018
Santos Gerardo Lazzeri	Mar 19, 2016
Search	Feb 1, 2018
Simona Tancig	Nov 7, 2012
Walter R. Reitman	Sep 24, 2014
WCCC 1986	Jul 27, 2017
William Chase	Jan 21, 2016
Workshop Chess and Mathematics	Mar 5, 2015
CreativityTheories : A Modern Trend in Creative Gaming	Nov 30, 2011

Up one level

Alan Biermann

GerdIsenberg — Thu, 21 Dec 2017 14:23:42 GMT

Home * People * Alan Biermann

Alan W. Biermann,
an American mathematician, computer scientist and professor of CS at Duke University. His research interests include computational linguistics, automatic programming, learning and inference, and multimedia tools for computer science education ^[1]. In the mid 70s, he advised his students Eric Jensen and Tom Truscott in writing the Duke program, a Checkers program which defeated Samuel's program in a 2-game match ^[2] ^[3] ^[4].

Selected Publicatons

^[5] ^[6]

Alan W. Biermann (1968). Pattern Classification Using Sequential Machine Analysis. Ph.D. thesis, University of California, Berkeley, Advisor Arthur Gill
Alan Biermann (1979). When a Duchess Reigned in Jerusalem. Personal Computing, Vol. 3, No. 2, pp. 71 » Duchess, Jerusalem CC Tournament 1978
Alan W. Biermann (1994). Computer Science for the Many. IEEE Computer
Alan W. Biermann (1997). Great Ideas in Computer Science. Second Edition, MIT Press

External Links

References

What links here?

Page	Date Edited
Alan Biermann	Dec 21, 2017
Checkers	Dec 23, 2017
Dana Nau	Apr 25, 2017
Duchess	Dec 22, 2017
Duke University	Mar 24, 2015
Eric Jensen	Jan 7, 2016
Jerusalem CC Tournament 1978	Jan 3, 2018
Mathematician	Apr 9, 2018
People	Feb 28, 2018
Personal Computing	Dec 27, 2017
Tom Truscott	Dec 22, 2017
University of California, Berkeley	Sep 5, 2016

Up one level

Alan Blair

GerdIsenberg — Mon, 22 Jan 2018 16:50:35 GMT

Home * People * Alan Blair

		Alan David Blair, an Australian computer scientist, Ph.D. in Mathematics from MIT ^[1], and senior lecturer at School of Computer Science and Engineering ^[2], University of New South Wales (UNSW). His research interests include co-evolutionary learning, mobile robots and language processing. Alan Blair worked on a multi-player chess variant board game called Duchess ™ ^[3], and is author of the Go playing program thcGo, applying a recurrent cellular neural network ^[4] ^[5].
Alan Blair ^[6]

Selected Publications

External Links

References

What links here?

Selected Publications

^[7] ^[8]

Alan Blair (1994). Path Integrals on Ultrametric Spaces. Ph.D. thesis, MIT, advisor Gian-Carlo Rota
Alan Blair (1999). Co-evolutionary learning - lessons for human education? Proceedings of the Fourth Conference of the Australasian Cognitive Science Society, Newcastle, Australia, pdf
Joel Veness, Alan Blair (2007). Effective Use of Transposition Tables in Stochastic Game Tree Search. IEEE Symposium on Computational Intelligence and Games, pdf
Joel Veness, David Silver, William Uther, Alan Blair (2009). Bootstrapping from Game Tree Search. pdf

External Links

References

^ Alan Blair (1994). Path Integrals on Ultrametric Spaces. Ph.D. thesis, MIT, advisor Gian-Carlo Rota
^ UNSW - School of Computer Science and Engineering
^ Welcome to the Duchess™ page!
^ computer-go.info - Details of Program: thcGo
^ 24th KGS Computer Go Tournament
^ Alan Blair's Home Page
^ Alan Blair's publications
^ Joel Veness - Publications

What links here?

Page	Date Edited
Alan Blair	Jan 22, 2018
Artificial Intelligence	Apr 9, 2018
Automated Tuning	Feb 27, 2018
Bodo	Oct 6, 2016
David Silver	Feb 11, 2018
Joel Veness	Dec 8, 2017
Learning	Feb 20, 2018
Massachusetts Institute of Technology	Jan 24, 2017
Mathematician	Apr 9, 2018
Meep	Sep 4, 2016
People	Feb 28, 2018
Temporal Difference Learning	Feb 20, 2018
Transposition Table	Apr 19, 2018
William Uther	Aug 7, 2015

Up one level

Alan H. Bond

GerdIsenberg — Tue, 07 Oct 2014 13:11:52 GMT

Home * People * Alan H. Bond

		Alan Hale Bond (October 18, 1940), a British American physicist, electrical engineer, computer scientist, AI researcher, and neuroscientist at Semel Institute for Neuroscience and Human Behavior, University of California, Los Angeles, California, and as president of Expert Software, Inc. ^[1] working on theory, design, development, and implementation of Artificial Intelligence, Logic programming, and Brain models for every occasion ^[2]. Alan Bond received the B.A. in Physics in 1961 and the M.A. degree in 1966 from Magdalen College, Oxford and the Ph.D. in Theoretical Physics from Imperial College London ^[3] . Since then he had various research and lecturer positions in the UK and US, beside others at Carnegie Mellon University and Queen Mary, University of London ^[4] . He was tutor and advisor of John J. Scott, an early British computer chess programmer, and was along with Alex Bell supporter and promoter of early Computer Chess Conferences, the forerunner of Advances in Computer Chess ^[5] .
Alan H. Bond ^[6]

Photos

Selected Publications

Photos

Alan Bond at Pittsburgh Zoo: 1966 ^[7]

Selected Publications

^[8] ^[9]

1968

Alan H. Bond (1968). Interactive Programming at Carnegie Tech. Artificial Intelligence 3, Literature: Reports hosted by Atlas Computer Laboratory
Alan H. Bond, Jerry Rightnour, L. Steven Coles (1969). An Interactive Graphical Display Monitor in a Batch-processing Environment with Remote Entry. Communications of the ACM, Vol. 12, No. 11, pdf

1970 ...

Alan H. Bond (1973). A Descriptor Indexed Bibliography of Computer Chess. in Alex Bell (ed.) (1973). Computer Chess. Proceedings May 1973 Meeting on chess playing by computer. Science Research Council, Atlas Computer Laboratory
Alan H. Bond (1973). Psychology and Computer Chess. in Alex Bell (ed.) (1973). Computer Chess. Proceedings May 1973 Meeting on chess playing by computer. Science Research Council, Atlas Computer Laboratory
Alan H. Bond (1979). An Approach to Artificial Intelligence. pdf

1980 ...

Alan H. Bond, David H. Mott (1981). Learning of Sensory-Motor Schemas in a Mobile Robot. IJCAI 1981, pdf
Alan H. Bond, David H. Mott (1985). An investigation of a learning system with a mobile robot. Queen Mary, University of London, pdf
Alan H. Bond (1987). Broadcasting Arrays - A Highly Parallel Computer Architecture Suitable For Easy Fabrication. pdf

1990 ...

Alan H. Bond (1990). What I have in Mind. draft as pdf
Alan H. Bond (1996). A Computational Architecture for Social Agents. pdf
Alan H. Bond (1999). A system model of the primate neocortex. Neurocomputing, vol 26-27, pp. 617-623, pdf ^[10]

2000 ...

Alan H. Bond (2004). A Computational Model for the Primate Brain based on its Functional Architecture. Journal of Theoretical Biology, vol 227, pp. 81-102, pdf
Alan H. Bond (2005). Representing episodic memory in a system-level model of the brain. Neurocomputing, vol 65-66, pp. 261-273, pdf
Alan H. Bond (2007). BAD, a Declarative Logic-Based Language for Brain Modeling. PADL 2007: 200-214

External Links

Books

Other Alan Bonds

from Wikipedia:

References

^ Expert Software Inc - Santa Monica, California (CA) | Company Profile
^ Expert Software home page
^ NSF bio
^ Alan Bond. Curriculum Vitae
^ Alex Bell (1978). MASTER at IFIPS. Excerpt from: The Machine Plays Chess? from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
^ Alan Bond's home page
^ Alan H. Bond (1968). Interactive Programming at Carnegie Tech. Artificial Intelligence 3, Literature: Reports hosted by Atlas Computer Laboratory
^ Alan Bond's publications page
^ DBLP: Alan H. Bond
^ Neocortex from Wikipedia

What links here?

Page	Date Edited
Advances in Computer Chess 1	Oct 22, 2015
Alan H. Bond	Oct 7, 2014
Artificial Intelligence	Apr 9, 2018
Carnegie Mellon University	Feb 12, 2018
CMU Chess Program	Oct 6, 2014
Cognition	Dec 8, 2017
John J. Scott	Aug 30, 2016
Joseph S. Rubenfeld	Oct 6, 2014
L. Stephen Coles	Jan 5, 2017
Mathematician	Apr 9, 2018
Memory	Dec 8, 2017
People	Feb 28, 2018
Queen Mary, University of London	Jul 12, 2017
Robots	Feb 20, 2018
Sequential Logic	May 10, 2017

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 Xin Jiang

GerdIsenberg — Mon, 22 Jun 2015 11:50:07 GMT

Home * People * Albert Xin Jiang

		Albert Xin Jiang, a computer scientist, mathematician and postdoctoral research associate at the University of Southern California. He received a Ph.D. from University of British Columbia under advisor Kevin Leyton-Brown. His research interests include computational game theory, multi-agent systems, artificial intelligence and machine learning. In his 2003 thesis Implementation of Multi-ProbCut in Chess, Albert Xin Jiang applied Buro's ProbCut inside Robert Hyatt's open source chess program Crafty ^[1] .
Albert Xin Jiang ^[2]

Selected Publications

External Links

References

What links here?

Selected Publications

^[3] ^[4]

Albert Xin Jiang (2003). Implementation of Multi-ProbCut in Chess. CPSC 449 Thesis, pdf
Albert Xin Jiang, Michael Buro (2003). First Experimental Results of ProbCut Applied to Chess. Advances in Computer Games 10, pdf
Albert Xin Jiang (2004). Multiagent Reinforcement Learning in Stochastic Games with Continuous Action Spaces. pdf
Albert Xin Jiang (2011). Representing and Reasoning with Large Games. Ph.D. thesis, University of British Columbia, advisor Kevin Leyton-Brown

External Links

References

^ Albert Xin Jiang (2003). Implementation of Multi-ProbCut in Chess. pdf
^ Albert Xin Jiang - UBC homepage
^ Albert Xin Jiang - publications
^ dblp: Albert Xin Jiang

What links here?

Page	Date Edited
Advances in Computer Games 10	Dec 30, 2016
Albert Xin Jiang	Jun 22, 2015
Crafty	Jan 28, 2018
Learning	Feb 20, 2018
Mathematician	Apr 9, 2018
Michael Buro	Dec 21, 2016
People	Feb 28, 2018
ProbCut	Mar 25, 2016
Reinforcement Learning	Feb 12, 2018
University of Southern California	Aug 10, 2016

Up one level

Albert Zobrist

GerdIsenberg — Sun, 12 Jun 2016 17:56:23 GMT

Home * People * Albert Zobrist

		Albert Lindsey Zobrist, an American computer scientist, games researcher, and inventor of the famous Zobrist Hashing, which was published in 1970 ^[1]. He is further author of the first Go program in 1968 as part of his Ph.D. Thesis on pattern recognition at the Computer Science Department of the University of Wisconsin ^[2] ^[3].
Albert Zobrist ^[4]

Computer Chess

Selected Publications

External Links

References

What links here?

Computer Chess

While affiliated with the University of Southern California and the Jet Propulsion Laboratory, Zobrist researched on computer chess, and was along with Frederic Roy Carlson and Charles Kalme co-author of the chess programs USC CP ^[5] and Tyro, participating at five ACM North American Computer Chess Championships, ACM 1972 and ACM 1973 with USC CP and ACM 1974, ACM 1975 and ACM 1977 with Tyro ^[6].

Selected Publications

^[7] ^[8]

Albert Zobrist (1969). A Model of Visual Organisation for the Game of Go. Proceedings of the Spring Joint Computer Conference, Vol. 34, pp. 103-112.
Albert Zobrist (1970). A Pattern Recognition Program which uses a Geometry-Preserving Representation of Features. Technical Report #85, pdf
Albert Zobrist (1970). A New Hashing Method with Application for Game Playing. Technical Report #88, Computer Science Department, The University of Wisconsin, Madison, WI, USA. reprinted (1990) in ICCA Journal, Vol. 13, No. 2, pdf
Albert Zobrist (1970). Feature Extraction and Representation for Pattern Recognition and the Game of Go. Ph.D. Thesis, University of Wisconsin.
Albert Zobrist, Frederic Roy Carlson (1973). The USC chess program. Proceedings of the ACM annual conference, Atlanta, Georgia
Albert Zobrist, Frederic Roy Carlson (1973). An Advice-Taking Chess Computer. Scientific American, Vol. 228, No. 6, pp. 92-105.
Albert Zobrist, Frederic Roy Carlson (1977). Detection of Combined Occurrences. Communications of the ACM, Vol. 20, No. 1, pp. 31-35.
Albert Zobrist (1990). A New Hashing Method with Applications for Game Playing. ICCA Journal, Vol. 13, No. 2, pp. 69-73.
Albert Lindsey Zobrist (2009). Ordered Minimal Perfect Hash of the Human Genome and Implications for Duplicate Finding. CSIE '09 Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 04

External Links

References

^ Albert Zobrist (1970). A New Hashing Method with Application for Game Playing. Technical Report #88, Computer Science Department, The University of Wisconsin, Madison, WI, USA. Reprinted (1990) in ICCA Journal, Vol. 13, No. 2, pdf
^ Albert Zobrist (1970). Feature Extraction and Representation for Pattern Recognition and the Game of Go. Ph.D. thesis, University of Wisconsin, also published as technical report, pdf
^ 4.1.1 Zobrist in Jay Burmeister, Janet Wiles (1995). CS-TR-339 Computer Go Tech Report. Departments of Computer Science and Psychology, The University of Queensland, QLD 4072, Australia (permanently - under construction)
^ Computer Go Milestones and Records from Mick's Computer Go Page
^ Albert Zobrist, Frederic Roy Carlson (1973). The USC chess program. Proceedings of the ACM annual conference, Atlanta, Georgia
^ A Memorial to BRUTE FORCE by Louis Kessler
^ ICGA Reference Database (pdf)
^ dblp: Albert L. Zobrist

What links here?

Page	Date Edited
ACM 1972	Dec 22, 2017
ACM 1973	Jan 19, 2018
ACM 1974	Jan 19, 2018
ACM 1975	Jan 19, 2018
ACM 1977	Dec 22, 2017
Albert Zobrist	Jun 12, 2016
Charles Kalme	Oct 20, 2013
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Frederic Roy Carlson	Oct 19, 2013
Go	Jan 24, 2018
Hash Table	Jan 1, 2018
ICGA Journal	Dec 21, 2017
Learning	Feb 20, 2018
Mac Hack	Apr 20, 2018
Mathematician	Apr 9, 2018
Pattern Recognition	Sep 8, 2017
People	Feb 28, 2018
Personal Computing	Dec 27, 2017
Scientific American	Jun 5, 2017
Space-Time Tradeoff	Jun 17, 2015
Transposition Table	Apr 19, 2018
Tyro	Apr 4, 2013
University of Southern California	Aug 10, 2016
USC CP	Aug 10, 2016
Zobrist Hashing	Jan 22, 2018

Up one level

Alberto Maria Segre

GerdIsenberg — Mon, 22 Jun 2015 11:50:35 GMT

Home * People * Alberto Maria Segre

		Alberto Maria Segre, an American mathematician and computer scientist with a Ph.D. on Explanation-Based Learning of Generalized Robot Assembly Plans from University of Illinois at Urbana-Champaign in 1987. He is professor and chair at Department of Computer Science ^[1] , University of Iowa. His research interests include distributed algorithms for solving optimization problems, linkage analysis problems from statistical genetics, and protein structure prediction techniques, machine learning, and parallel search algorithms such as A*, αβ-minimax, Davis-Loveland-Putnam, and applications of these algorithms to both standard AI problems and economic problems such as combinatorial auction winner determination.
Alberto Maria Segre ^[2]

Selected Publications

External Links

References

What links here?

Selected Publications

^[3]

Alberto Maria Segre (1987). On the Operationality/Generality Trade-off in Explanation-based Learning. IJCAI 1987, pdf
Alberto Maria Segre (1987). Explanation-Based Learning of Generalized Robot Assembly Plans. Ph.D. thesis, University of Illinois at Urbana-Champaign, Advisor: Gerald Francis DeJong, II
Alberto Maria Segre, Daniel Scharstein (1993). Bounded-Overhead Caching for Definite-Clause Theorem Proving. Journal of Automated Reasoning, Vol, 11, No. 1, pdf
David Sturgill, Alberto Maria Segre (1994). A Novel Asynchronous Parallelism Scheme for First-Order Logic. CADE'1994
Alberto Maria Segre, David Sturgill (1994). Using Hundreds of Workstations to Solve First-Order Logic Problems. AAAI'1994
Alberto Maria Segre, Charles Elkan (1994). A High-Performance Explanation-Based Learning Algorithm. Artificial Intelligence, Vol. 68, Nos. 1-2
David Sturgill, Alberto Maria Segre (1997). Nagging: A Distributed, Adversarial Search-Pruning Technique Applied to First-Order Inference. Journal of Automated Reasoning, Vol. 19, No. 3 ^[4]
Alberto Maria Segre, Sean Forman, Giovanni Resta, Andrew Wildenberg (2002). Nagging: A Scalable Fault-Tolerant Paradigm for Distributed Search. Artificial Intelligence 140, pdf, pdf
Ronen Feldman, Moshe Koppel, Alberto Maria Segre (2011). Bias-Driven Revision of Logical Domain Theories. CoRR, 2011

External Links

References

What links here?

Page	Date Edited
Alberto Maria Segre	Jun 22, 2015
Charles Elkan	Jan 23, 2017
David Sturgill	May 23, 2016
GPU	Dec 16, 2017
Learning	Feb 20, 2018
Mathematician	Apr 9, 2018
Moshe Koppel	May 23, 2016
Parallel Search	Dec 30, 2017
People	Feb 28, 2018
Srdja Matovic	Apr 14, 2018
University of Illinois at Urbana-Champaign	Oct 12, 2016

Up one level

Albrecht Heeffer

GerdIsenberg — Tue, 06 Sep 2016 13:31:36 GMT

Home * People * Albrecht Heeffer

		Albrecht Heeffer, a Belgian electrical engineer and philosopher with research interests in the history of algebra ^[1], computational models for scientific discovery ^[2], recreational mathematics, and further in chess, computer chess and shogi. He holds a degree in electrical engineering and a Ph.D. in philosophy from Ghent University in 2006 on the topic of emergence of symbolic algebra during the sixteenth century ^[3], and is post-doctoral fellow of the Research Foundation Flanders (FWO) ^[4] and member of the Center for Logic and Philosophy of Science ^[5] at Ghent University. In 1984, during a three month visit of the Turing Institute in Glasgow, Albrecht Heeffer worked on automated acquisition on concepts for the description of middlegame positions in chess ^[6], supported by Donald Michie, John Roycroft, and Tim Niblett ^[7]. Albrecht Heeffer was member of the Bionic Impakt team with Hans Secelle, and provided the hardware, worked through the test sets, added the endgame databases and did some optimizations ^[8], while they later joined the Ant team around Tom Vijlbrief.
Albrecht Heeffer ^[9]

Photos

Selected Publications

Photos



Albrecht Heeffer, Mathias Feist and Frans Morsch, ICT 2001 ^[10], round 5, Ant - Fritz ^[11]

Boris Spassky, Yoshiharu Habu, Albrecht Heeffer, Paris May 23, 2002 ^[12]

Selected Publications

^[13] ^[14] ^[15]

1984

Albrecht Heeffer (1984). Automated Acquisition on Concepts for the Description of Middle-game Positions in Chess. Turing Institute, Glasgow, Scotland, TIRM-84-005

1985 ...

Albrecht Heeffer (1985). Validating Concepts from Automated Acquisition Systems. IJCAI 85, pdf
Albrecht Heeffer, Marc Leman (1986). Chunking as a Method for Concept Acquisition. Proceedings of the 7th European Conference on Artificial Intelligence
Fernand Vandamme, Albrecht Heeffer (1986). An overview of expert systems. Proceedings of Expert Systems: Available Hard- and Software

1995 ...

Patrick De Causmaecker, Albrecht Heeffer, Greet Vanden Berghe (1997). A Cost Function approach towards Scheduling of Highly Constrained Resources. Proceedings of the International Colloquium on European Cooperation in International Projects, Information Technologies and Environmental Sciences

2000 ...

Albrecht Heeffer (2003). Kepler's near discovery of the sine law: a qualitative computational model. Computer modeling of scientific reasoning, pdf ^[16]
Albrecht Heeffer (2004). Récréations Mathématiques (1624) A Study on its Authorship, Sources and Influence. pdf

2005 ...

Albrecht Heeffer (2006). The Regula Quantitatis or the invention of the second unknown. The 22nd International Conference on the History of Science
Albrecht Heeffer (2006). Van precepten tot vergelijkingen: de conceptuele ontwikkeling van de symbolische algebra in de zestiende eeuw. Ph. D. thesis, Universiteit Gent (Flemish)
Albrecht Heeffer, Harold Heeffer (2007). Near-Optimal Strategies for the Game of Logik. pdf ^[17]
Albrecht Heeffer (2007). Mathematics education through lesson study in the Asia-Pacific region. pdf
Albrecht Heeffer (2007). On the Nature and Origin of Algebraic Symbolism. pdf
Albrecht Heeffer (2007). Humanist Repudiation of Eastern Influences in Early Modern Mathematics. pdf
Albrecht Heeffer (2008). From Problem Solving to Argumentation: Pacioli’s Appropriation of Abbacus Algebra. pdf ^[18]
Albrecht Heeffer (2008). Negative Numbers As An Epistemic Difficult Concept: Some Lessons From History. pdf
Albrecht Heeffer (2008). Text production, reproduction and appropriation within the abbaco tradition: a case study. pdf
Albrecht Heeffer (2008). Estienne de la Roche’s appropriation of Chuquet (1484). pdf ^[19] ^[20]
Albrecht Heeffer (2008). On the interpretation of early Italian bartering problems. pdf
Albrecht Heeffer (2008). A Conceptual Analysis of Early Arabic Algebra. pdf
Albrecht Heeffer (2009). On the curious historical coincidence of algebra and double-entry bookkeeping. To appear in: Karen François, Benedikt Löwe, Thomas Müller, and Bart van Kerkhove (eds.) Foundations of the Formal Sciences. Bringing together Philosophy and Sociology of Science, College Publications, London. pdf
Albrecht Heeffer (2009). The Abbacus Tradition: the Missing Link between Arabic and Early Symbolic Algebra? pdf
Albrecht Heeffer (2009). Algebraic partitioning problems from Luca Pacioli's Perugia manuscript (Vat. Lat. 3129). pdf

2010 ...

Albrecht Heeffer (2010). Regiomontanus and Chinese Mathematics. pdf ^[21]
Albrecht Heeffer (2011). The Rule of Quantity by Chuquet and de la Roche and its Influence on German Cossic Algebra. Archives internationales d'histoire des sciences, pdf
Albrecht Heeffer (2011). Models of scientific discovery: what do they explain?. Third international conference on philosophy and cognitive science, Proceedings ^[22]
Albrecht Heeffer (2011). From problem solving to the teaching of algebra: the genesis of the algebra textbook. 11th international IHPST and 6th Greek history, philosophy and science teaching joint conference, Proceedings
Albrecht Heeffer (2012). The genesis of the algebra textbook: from Pacioli to Euler. Almagest
Albrecht Heeffer (2012). Dutch arithmetic, samurai and warships: teaching of Western mathematics in pre-Meiji Japan. History and Pedagogy of Mathematics, Proceedings ^[23]
Albrecht Heeffer (2012). Sangaku: the mathematics of traditional Japanese votive tablets. Mathematics Today ^[24]
Albrecht Heeffer (2013). Why the quadratic equation has only one root (according to abbaco masters). Mathematics Today
Albrecht Heeffer (2013). Algebraic symbolism as a conceptual barrier in learning mathematics. 6th East Asia Regional Conference on Mathematics Education, Proceedings
Albrecht Heeffer (2013). Was Uncle Tom right that quadratic problems can't be solved with the rule of false position?. The Mathematical Intelligencer
Albrecht Heeffer (2014). Cardano's favorite problem: the Proportio Reflexa. The Mathematical Intelligencer ^[25]

External Links

Albrecht Heeffer | Sarton Centre for History of Science
Albrecht Heeffer | Max Planck Institute for the History of Science
Albrecht Heeffer's homepage
Members - Albrecht Heeffer from Centre for Logic and Philosophy of Science
Albrecht Heeffer - Google Scholar Citations
Albrecht Heeffer - ResearchGate
Albrecht Heeffer - Microsoft Academic Search
European/Worldwide Open Shogi Championship 2002 - Participants
Albrecht Heeffer - The Abbaco mathematical culture (1300 - 1500) , YouTube Video
First Conference on Mathematical Cultures, September 10-12, 2012 at De Morgan House, London

References

^ Sources in the history of algebra by Albrecht Heeffer
^ Centre for History of Science - dr. Albrecht Heeffer
^ Albrecht Heeffer (2006). Van precepten tot vergelijkingen: de conceptuele ontwikkeling van de symbolische algebra in de zestiende eeuw. Ph. D. thesis, Universiteit Gent
^ Research Foundation Flanders
^ Center for Logic and Philosophy of Science
^ Albrecht Heeffer (1984). Automated Acquisition on Concepts for the Description of Middle-game Positions in Chess. Turing Institute, Glasgow, Scotland, TIRM-85-005
^ Albrecht Heeffer (1985). Validating Concepts from Automated Acquisition Systems. IJCAI 85, pdf, This work was carried out during a three month visit at the Turing Institute. Financial support was provided by the Belgian NFWO and the ICIWO. I would like to express my thank s to Prof. F. Vandamme of the University of Ghent, and to Prof. Donald Michie, Mr John Roycroft and Dr Tim Niblett of the Turing Institute, for their helpful suggestions
^ Re: Bionic Vs Crafty Debate: some data required by Albrecht Heeffer, CCC, January 25, 1999 » Crafty
^ Albrecht Heeffer | Sarton Centre for History of Science
^ Leiden 2001 by László Szalai
^ ICT Leiden 2001 - download
^ Albrecht Heeffer - My game against Habu
^ Preprints from 1995 on
^ Albrecht Heeffer - Publications
^ dblp: Albrecht Heeffer
^ Johannes Kepler from Wikipedia
^ Mastermind (board game) from Wikipedia
^ Luca Pacioli from Wikipedia
^ Estienne de la Roche from Wikipedia
^ Nicolas Chuquet from Wikipedia
^ Regiomontanus from Wikipedia
^ Knowledge extraction from Wikipedia
^ Emperor Meiji from Wikipedia
^ Sangaku from Wikipedia
^ Gerolamo Cardano from Wikipedia

What links here?

Page	Date Edited
Albrecht Heeffer	Sep 6, 2016
Ant	Jun 1, 2015
Bionic Impakt	Sep 6, 2014
Chunking	Jun 12, 2017
DOCCC 2000	Aug 15, 2015
Hans Secelle	Nov 2, 2012
Knowledge	Jul 22, 2017
Learning	Feb 20, 2018
Mathematician	Apr 9, 2018
Middlegame	Sep 6, 2016
People	Feb 28, 2018

Up one level

Alen Shapiro

GerdIsenberg — Sun, 03 May 2015 20:23:29 GMT

Selected Publications

External Links

References

What links here?

Home * People * Alen Shapiro

Alen David Shapiro, (born 1956)
a British computer scientist, who as student of Donald Michie at Department of Machine Intelligence at University of Edinburgh, researched on Decision tree algorithms and Decision tree learning applied to chess. Alen Shapiro and Tim Niblett, another of Michie's students, adopted Ross Quinlan's Iterative Dichotomiser 3 (ID3) algorithm for processing complex data ^[1] for other employment at the chessboard, while they overcame ^[2] its disadvantage that it yielded massively unwieldy and incomprehensible decision-rules with structured induction, an interactive regime for generating machine-executable decision rules and configuring them into transparent concept-hierarchies. Niblett and Shapiro tested ID3 on the endgame of KPK, and found that decision trees generated by the algorithm 100% accurate.

CLESS

In 1979/80, Alen Shapiro worked with Ivan Bratko and Zdenek Zdrahal on Pattern Recognition applied to Chess. In fact they used Bitboards, called cellular 8x8 arrays, to implement their Cellular logic processing emulator for chess (CLESS) ^[3] . CLESS used three kinds of instructions to recognize simple and more complex chess patterns:

bitwise boolean operations without any interactions between squares
shifts as expand instructions
fill-like propagation instructions, internally using the first two kinds of instructions and conditions in loops

Chess Endgames

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

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

Structured Induction

from computer chess: Information from Answers.com ^[5]^[6]:

In addition to purely factual discoveries, computer programs could help the chess expert fill the gaps of which codified chess knowledge is now seen mainly to consist. Knowledge-directed programs can support his endeavours to outline the missing framework and by semi-automatic generation of descriptions from expert-supplied examples to fill empty slots in the framework as it takes shape. Using a technique of Alen Shapiro and Timothy Niblett known as 'structured induction', Shapiro was able to generate a complete human-readable codification for adjudicating positions in the king-pawn–king-rook ending (pawn's side to move, pawn on a7) where none pre-existed. A side benefit subsequently extracted from this phenomenon was endowment of the program with the ability to document its own adjudications on demand with explanatory notes.

In the above-mentioned work the induction process was fuelled by hand-supplied examples. In some other cases success has been reported where the examples have been quarried by the program itself from large pre-computed databases. A recent de novo synthesis of knowledge in clinical cardiology by Ivan Bratko and colleagues employed just such an alternation between

(i) exhaustive derivation of brute facts from a logical model and
(ii) induction from these of an operational theory.

Sparked initially by the chess work, application is beginning to place emphasis on factual compilations as raw materials for automating the codification of new knowledge as a commercial product. The need to better understand the cognitive invariants with which the designer of codification languages must now come to terms is also leading to closer involvement of professional students of mind.

Structured Induction Expert System ^[7]

AI as Sport

Quote by John McCarthy from AI as Sport ^[8]^[9]:

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

Selected Publications

^[10]^[11]

Zdenek Zdráhal, Ivan Bratko, Alen Shapiro (1981). Recognition of Complex Patterns Using Cellular Arrays. The Computer Journal, Vol. 24, No. 3
Alen Shapiro, Tim Niblett (1982). Automatic Induction of Classification Rules for Chess End game. Advances in Computer Chess 3
Alen Shapiro (1983). The Role of Structured Induction in Expert Systems. University of Edinburgh, Machine Intelligence Research Unit (Ph.D. thesis) ^[12]
Alen Shapiro, Donald Michie (1986). A Self-commenting Facility for Inductively Synthesised Endgame Expertise. Advances in Computer Chess 4
Alen Shapiro (1987). Structured Induction in Expert Systems. Turing Institute Press in association with Addison-Wesley Publishing Company, Workingham, UK. ISBN 0-201-178133. amazon^[13].

External Links

UCI Machine Learning Repository: Chess (King-Rook vs. King-Pawn) Data Set by Alen Shapiro

References

^ Ross Quinlan (1986). Induction of Decision Trees. Mach. Learn. 1, 1, 81-106.
^ D. Michie CV
^ Zdenek Zdráhal, Ivan Bratko, Alen Shapiro (1981). Recognition of Complex Patterns Using Cellular Arrays. The Computer Journal, Vol. 24, No. 3, pp. 263-270
^ I remember Donald Michie (1923 – 2007) « A Programmers Place by Maarten van Emden, June 12, 2009
^ Title: Chess End-Game - King+Rook versus King+Pawn on a7
^ Mario Marchand and Mostefa Golea (1993). A Constructive Algorithm for Neural Decision Lists. University of Ottawa, from World Congress on Neural Networks: Proceedings of the 1993 Annual Meeting of the International Neural Network Society, vol. 3, pp. 560-563, Hillsdale, NJ: Erlbaum Associates. pdf
^ Alen Shapiro (1987). Structured Induction in Expert Systems. Turing Institute Press in association with Addison-Wesley Publishing Company, Workingham, UK. ISBN 0-201-178133
^ John McCarthy (1997). AI as Sport. Science, Vol. 276, June 6, pp. 1518-1519.
^ AI as Sport by John McCarthy
^ ICGA Reference Database (pdf)
^ DBLP: Alen Shapiro
^ UCI Machine Learning Repository: Chess (King-Rook vs. King-Pawn) Data Set
^ Dap Hartmann (1988). Alen D. Shapiro: Structured Induction in Expert Systems. ICCA Journal, Vol. 11, No. 4

What links here?

Page	Date Edited
Advances in Computer Chess 3	Jul 23, 2015
Advances in Computer Chess 4	Jan 22, 2018
Alen Shapiro	May 3, 2015
Artificial Intelligence	Apr 9, 2018
Bitboards	Nov 14, 2017
Chunking	Jun 12, 2017
Danny Kopec	Oct 1, 2016
Dap Hartmann	Jun 10, 2017
Donald Michie	Dec 23, 2017
Endgame	Sep 18, 2017
ICGA Journal	Dec 21, 2017
Ivan Bratko	Aug 16, 2017
Knowledge	Jul 22, 2017
Learning	Feb 20, 2018
Mathematician	Apr 9, 2018
Pattern Recognition	Sep 8, 2017
People	Feb 28, 2018
Tim Niblett	May 22, 2014
University of Edinburgh	Nov 26, 2017
Zdenek Zdrahal	Apr 4, 2013

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]:

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.

Ershov and Shura-Bura

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

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

Landis and Yaglom

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

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

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

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

Mikhail Donskoy

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

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

Selected Publications

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

External Links

References

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

What links here?

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

Up one level

Alexander Kronrod

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

Home * People * Alexander Kronrod

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

Quotes

Remembering A.S. Kronrod

Intellectual Foundations

Competitions, Controversies, and Computer Chess

What is AI?

Selected Publications

External Links

References

What links here?

Quotes

Remembering A.S. Kronrod

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

Intellectual Foundations

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

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

Competitions, Controversies, and Computer Chess

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

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

What is AI?

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

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

Selected Publications

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

External Links

References

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

What links here?

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

Up one level

Allen Newell

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

Home * People * Allen Newell

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

See also

Selected Publications

Selected Publications

^[5] ^[6]

1955 ...

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

1960 ...

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

1970 ...

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

1980 ...

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

1990 ...

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

External Links

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

References

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

What links here?

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

Up one level

Alois Heinz

GerdIsenberg — Wed, 12 Aug 2015 08:28:48 GMT

Home * People * Alois Heinz

		Alois P. Heinz, a German mathematician, computer scientist and professor of CS at Heilbronn University. He received a diplom degree in CS from RWTH Aachen in 1984, a Ph.D. in mathematics and habilitaion in CS from University of Freiburg in 1990 and 1994 respectively. His reaearch includes machine learning, neural networks and neural trees as descendants of decision trees ^[1], also applied to evaluation of a alpha-beta search as generalization of lazy evaluation ^[2] ^[3].
Alois Heinz ^[4]

Selected Publications

Selected Publications

^[5] ^[6] ^[7]

1990 ...

Alois Heinz (1990). Analyse der Grenzen und Möglichkeiten schneller Tableauoptimierung. Ph.D. thesis, University of Freiburg, advisor Thomas Ottmann (German)
Alois Heinz (1990). Finding Two-Tree-Factor Elements of Tableau-Defined Monoids in Time O(n³). ICCI 1990 ^[8]
Alois Heinz, Christoph Hense (1993). Bootstrap learning of α-β-evaluation functions. ICCI 1993, pdf
Alois Heinz (1994). Efficient Neural Net α-β-Evaluators. pdf
Alois Heinz (1994). Fast bounded smooth regression with lazy neural trees. ICNN 1994, DOI: 10.1109/ICNN.1994.374421
Alois Heinz (1995). Pipelined Neural Tree Learning by Error Forward-Propagation. ICNN 1995, DOI: 10.1109/ICNN.1995.488132,pdf
Alois Heinz, Christoph Hense (1995). Tools for Neural Trees. University of Freiburg, Technical Report No. 68

2000 ...

Alois Heinz (2000). Tree-Structured Neural Networks: Efficient Evaluation of Higher-Order Derivatives and Integrals. IJCNN 2000
Alois Heinz (2003). Yes, Trees May Have Neurons. Computer Science in Perspective 2003

External Links

References

^ Alois Heinz (2003). Yes, Trees May Have Neurons. Computer Science in Perspective 2003
^ Re: Evaluation by neural network ? by Jay Scott, CCC, November 10, 1997
^ Alois Heinz (1994). Efficient Neural Net α-β-Evaluators. pdf
^ Alois Heinz | LinkedIn
^ dblp: Alois P. Heinz
^ University of Freiburg, Department of Computer Science - Technical Reports
^ Online papers by Jay Scott
^ Monoid from Wikipedia

What links here?

Page	Date Edited
Alois Heinz	Aug 12, 2015
Alpha-Beta	Jan 28, 2018
Christoph Hense	Aug 12, 2015
Evaluation	Feb 1, 2018
Learning	Feb 20, 2018
Mathematician	Apr 9, 2018
Neural Networks	Mar 12, 2018
People	Feb 28, 2018

Up one level

Alvin M. Despain

GerdIsenberg — Tue, 17 Feb 2015 12:55:47 GMT

Home * People * Alvin M. Despain

		Alvin M. Despain, an American electrical engineer, and co-founder and CTO of Acorn Technologies before his retirement in 2008 ^[1]. He holds a Ph.D. in electrical engineering from the University of Utah in 1966, and has been a professor at University of California, Berkeley, Stanford University, Utah State University, University of Utah, and University of Southern California, where he is professor emeritus since 2001. His research interests include computer architecture, multiprocessor systems, logic programming, quantum computation and design automation ^[2].
Alvin Despain ^[3]

Computer Chess

Selected Publications

External Links

References

What links here?

Computer Chess

Already in the 70s, Despain designed a chess machine described by Ozalp Babaoglu ^[4], but never obtained funding for full construction ^[5]. In 1990, along with James Testa, Despain co-authored on the Berkeley Chess Microprocessor (BCM) ^[6] ^[7]. The BCM was apparently used in Testa's chess entity Zerker, a promising newcomer at ACM 1990 as it reported 7,000,000 moves per second ^[8], roughly three times faster than Deep Thought at that time, but damage to the machine during shipment forced its withdrawal ^[9] ^[10], and it seems the project was later abandoned.

Selected Publications

^[11]

Alvin M. Despain, David A. Patterson (1978). X-Tree: A Tree Structured Multi-Processor Computer Architecture. ISCA 1978
Alvin M. Despain (1979). Very Fast Fourier Transform Algorithms Hardware for Implementation. IEEE Transactions on Computers, Vol. 28, No. 5 ^[12]
Philip Bitar, Alvin M. Despain (1986). Multiprocessor Cache Synchronization: Issues, Innovations, Evolution. ISCA 1986
Alvin M. Despain (1988). Prolog at Berkeley. COMPCON 1988
James Testa, Alvin M. Despain (1990). A CMOS VLSI chess microprocessor. University of California, Berkeley, IEEE Custom Integrated Circuit Conference
Bruce K. Holmer, Alvin M. Despain (1991). Viewing Instruction Set Design as an Optimization Problem. MICRO 1991
Alvin M. Despain (1994). Symbolic Supercomputing. in Frontiers of Supercomputing II: A National Reassessment edited by Karyn R. Ames and Alan Brenner, University of California Press
Kevin M. Obenland, Alvin M. Despain (1998). Simulating the Effect of Decoherence and Inaccuracies on a Quantum Computer. QCQC 1998

External Links

References

^ Acorn - Board of Directors
^ USC Ming Hsieh Department of Electrical Engineering: Alvin Despain
^ USC Ming Hsieh Department of Electrical Engineering: Alvin Despain
^ Ozalp Babaoglu (1977). Hardware implementation of the legal move generation and relative ordering functions for the game of chess. Master's thesis, University of California, Berkeley
^ Joe Condon, Ken Thompson (1982). Belle Chess Hardware. Advances in Computer Chess 3, Reprinted (1988) in Computer Chess Compendium
^ James Testa, Alvin M. Despain (1990). A CMOS VLSI chess microprocessor. University of California, Berkeley, IEEE Custom Integrated Circuit Conference
^ Marc Boulé (2002). An FPGA Move Generator for the Game of Chess. Masters thesis, McGill University, supervisor: Zeljko Zilic, co-supervisor: Monty Newborn
^ The 21st Annual ACM North American Computer Chess Championship from The Computer History Museum, pdf
^ Quick moves claim computer-chess title - Free Online Library, November 24, 1990
^ Monty Newborn, Danny Kopec (1991). The 21st ACM North American Computer Chess Championship. Communications of the ACM, Vol. 34, No. 11, online
^ DBLP: Alvin M. Despain
^ Fast Fourier transform from Wikipedia

What links here?

Page	Date Edited
Alvin M. Despain	Feb 17, 2015
Berkeley Chess Microprocessor	May 22, 2013
Hardware	Jan 20, 2018
James Testa	Feb 17, 2015
Mathematician	Apr 9, 2018
Move Generation	Jan 29, 2018
Ozalp Babaoglu	Oct 5, 2013
People	Feb 28, 2018
Stanford University	Dec 7, 2017
University of California, Berkeley	Sep 5, 2016
University of Southern California	Aug 10, 2016
Zerker	Jun 9, 2016

Up one level

Amine Bourki

GerdIsenberg — Tue, 19 Jan 2016 14:29:50 GMT

Home * People * Amine Bourki

Selected Publications

References

What links here?

Amine Bourki,
a French mathematician and computer scientist at Laboratoire de Recherche et de Développement de l'EPITA (LRDE), École Pour l'Informatique et les Techniques Avancées, Le Kremlin-Bicêtre. His research interests include Evolutionary Algorithms, Stochastic Optimization, and Parallel Monte-Carlo Tree Search. Amine Bourki is further affiliated with the team developing the top level Go playing program Mogo.

Selected Publications

^[1] ^[2]

Vincent Berthier, Amine Bourki, Matthieu Coulm, Guillaume Chaslot, Christophe Fiter, Sylvain Gelly, Jean-Baptiste Hoock, Rémi Munos, Julien Pérez, Arpad Rimmel, Philippe Rolet, Olivier Teytaud, Paul Vayssière, Yizao Wang, Ziqin Yu (et al.) (2009). Computer-Go is not only for Go. Korea, August 2009 slides as pdf
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Thomas Hérault, Jean-Baptiste Hoock, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, Paul Vayssière, Ziqin Yu (2010). Scalability and Parallelization of Monte-Carlo Tree Search. CG 2010, pdf
Amine Bourki, Matthieu Coulm, Philippe Rolet, Olivier Teytaud, Paul Vayssière (2010). Parameter Tuning by Simple Regret Algorithms and Multiple Simultaneous Hypothesis Testing. pdf

References

What links here?

Page	Date Edited
Amine Bourki	Jan 19, 2016
Arpad Rimmel	Mar 16, 2016
Automated Tuning	Feb 27, 2018
CG 2010	Jan 8, 2014
Christophe Fiter	Jan 19, 2016
Fabien Teytaud	Jul 8, 2016
Go	Jan 24, 2018
Guillaume Chaslot	Jan 2, 2017
Hassen Doghmen	Mar 16, 2016
Jean-Baptiste Hoock	Jan 2, 2017
Julien Pérez	Jan 19, 2016
Learning	Feb 20, 2018
Matthieu Coulm	Oct 22, 2010
Monte-Carlo Tree Search	Apr 26, 2018
Olivier Teytaud	Jan 7, 2017
Parallel Search	Dec 30, 2017
Philippe Rolet	May 23, 2016
Rémi Munos	Dec 8, 2017
Sylvain Gelly	Dec 31, 2016
Thomas Hérault	May 11, 2013
Vincent Danjean	Nov 18, 2012
Yizao Wang	Dec 31, 2016

Up one level

Wikispaces : chessprogramming - items matching description

Aaron Becker

Table of Contents

Selected Publications

Forum Posts

External Links

References

What links here?

Aaron L. Futer

Table of Contents

Selected Publications

See also

External Links

References

What links here?

Aart Bik

Table of Contents

Compiler Architect

Java Compiler

Vectorization

Selected Publications

Forum Posts

2005 ...

2010 ...

2015 ...

External Links

References

What links here?

Abdallah Saffidine

Table of Contents

Selected Publications

2009

2010 ...

2015 ...

External Links

References

What links here?

Adriaan de Groot

Table of Contents

Quotes

Chase & Simon

Fernand Gobet

Four Stages

Euratom

See also

Selected Publications

External Links

References

What links here?

Alan Biermann

Table of Contents

Selected Publicatons

External Links

References

What links here?

Alan Blair

Table of Contents

Selected Publications

External Links

References

What links here?

Alan H. Bond

Table of Contents

Photos

Selected Publications

1968

1970 ...

1980 ...

1990 ...

2000 ...

External Links

Books

Other Alan Bonds

References

What links here?

Alan Turing

Table of Contents

Photos

Turing Machine

Turing Test