Wikispaces : chessprogramming - items matching description

Alexander Reinefeld

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

Home * People * Alexander Reinefeld

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

Selected Publications

Chess Programs

Murks

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

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

MicroMurks

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

Search Algorithms

Negascout

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

RecSSS* and RecDual*

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

Selected Publications

^[9] ^[10]

1982 ...

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

1990 ...

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

2000 ...

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

External Links

References

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

What links here?

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

Up one level

Andreas Junghanns

GerdIsenberg — Mon, 26 Jun 2017 09:55:43 GMT

Home * People * Andreas Junghanns

		Andreas Junghanns, a German computer scientist. Junghanns studied at the Technical University of Chemnitz, Germany, in Madrid, Spain, and at the University of Alberta, Canada from 1994 until 1999, where he defended his Ph.D. thesis Pushing the Limits: New Developments in Single-Agent Search [Jung 1999] in 1999. His research interests include search algorithms like single-agent search applied to the game of Sokoban. Along with Yngvi Björnsson, Junghanns co-authored the chess program The Turk, which was test-bed of their Uncertainty Cut-Offs. After some years of corporate IT research, Andreas Junghanns co-founded the QTronic GmbH 2006 in Berlin, Germany ^[1].
Andreas Junghanns ^[2]

Selected Publications

Selected Publications

^[3] ^[4]

1994 ...

Andreas Junghanns (1994). Methoden zur Verbesserung von Suchalgorithmen. Diplomarbeit, Technische Universität Chemnitz-Zwickau.
Andreas Junghanns (1994). Fuzzy Numbers as a Tool in Chess Programs. ICCA Journal, Vol. 17, No. 3
Andreas Junghanns, Christian Posthoff, Michael Schlosser (1995). Search with Fuzzy Numbers. In: Proc. of the FUZZ-IEEE/IFES'95, Yokohama/Japan, 20.-24. März 1995, Vol. II
Yngvi Björnsson, Mark Brockington, Andreas Junghanns, Aske Plaat (1996). Report on the Advances in Computer Chess 8 Conference. ICCA Journal, Vol. 19, No. 3 » Advances in Computer Chess 8
Yngvi Björnsson, Tony Marsland, Jonathan Schaeffer, Andreas Junghanns (1997). Searching with Uncertainty Cut-offs. ICCA Journal, Vol. 20, No. 1, pdf preprint
Yngvi Björnsson, Tony Marsland, Jonathan Schaeffer, Andreas Junghanns (1997). Searching with Uncertainty Cut-offs. Advances in Computer Chess 8
Andreas Junghanns, Jonathan Schaeffer (1997). Search versus knowledge in game-playing programs revisited. IJCAI-97, Vol. 1, pdf
Andreas Junghanns, Jonathan Schaeffer, Mark Brockington, Yngvi Björnsson, Tony Marsland (1997). Diminishing Returns for Additional Search in Chess. Advances in Computer Chess 8, ps
Andreas Junghanns (1998). Are there Practical Alternatives to Alpha-Beta? ICCA Journal, Vol. 21, No. 1
Andreas Junghanns, Jonathan Schaeffer (1998). Relevance Cuts: Localizing the Search.. CG 1998, pdf from CiteSeerX
Andreas Junghanns (1999). Pushing the Limits: New Developments in Single-Agent Search, Ph.D. Thesis, Department of Computing Science, University of Alberta. ^[5]

2000 ...

Andreas Junghanns, Jonathan Schaeffer (2000). Sokoban: A Challenging Single-Agent Search Problem. Games in AI Research (eds. Jaap van den Herik and Hiroyuki Iida), pp. 139-157. Published by the Universiteit Maastricht in cooperation with the University of Shizuoka. ISBN 90-621-6416-1. ps, pdf from CiteSeerX
Jonathan Schaeffer, Aske Plaat, Andreas Junghanns (2001). Unifying Single-agent and Two-player search. Information Sciences, Vol. 135, pp. 151-175. ISSN 0020-0255. ps
Andreas Junghanns, Jonathan Schaeffer (2001). Sokoban: Improving the Search with Relevance Cuts. Theoretical Computer Science, vol. 252, no. 1-2, pp. 151-175, pdf
Carlos Linares López, Andreas Junghanns (2002). Perimeter Search Performance. CG 2002

External Links

Andreas Junghanns | LinkedIn

References

^ Andreas Junghanns, Ph.D. founder QTronic GmbH 2006
^ Dr. Andreas Junghanns | QTronic GmbH
^ ICGA Reference Database (pdf)
^ dblp: Andreas Junghanns
^ Sokoban Publications from GAMES Group of the University of Alberta

What links here?

Page	Date Edited
Advances in Computer Chess 8	Jun 26, 2017
Andreas Junghanns	Jun 26, 2017
Aske Plaat	Jun 26, 2017
CG 1998	May 28, 2015
CG 2002	Jun 9, 2015
Chemnitz University of Technology	May 14, 2016
Christian Posthoff	Dec 19, 2016
Depth	Feb 25, 2018
Engines	Mar 10, 2018
ICGA Journal	Dec 21, 2017
ICGA Journal Awards to Include	May 21, 2015
Jonathan Schaeffer	Jan 29, 2018
Knowledge	Jul 22, 2017
Mark Brockington	Jun 26, 2017
Mathematician	Apr 9, 2018
Michael Schlosser	Nov 15, 2016
People	Feb 28, 2018
ProbCut	Mar 25, 2016
Raspberry Turk	Sep 7, 2017
Search with Random Leaf Values	Apr 23, 2018
The Turk	Apr 1, 2017
The Turk (TR)	Apr 1, 2017
Tony Marsland	Nov 27, 2017
Uncertainty Cut-Offs	Jul 21, 2015
University of Alberta	Feb 20, 2018
WMCCC 1996	Sep 15, 2016
Yngvi Björnsson	Jun 26, 2017

Up one level

Andrew Barto

GerdIsenberg — Sun, 11 Feb 2018 10:24:15 GMT

Home * People * Andrew Barto

		Andrew G. Barto, an American computer scientist, AI-researcher and Professor of Computer Science, University of Massachusetts, Amherst. His research centers on learning in natural and artificial systems, and he has studied machine learning algorithms since 1977, contributing to the development of the computational theory and practice of reinforcement learning ^[1] .
Andy Barto ^[2] ^[3]

Selected Publications

External Links

References

What links here?

Selected Publications

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

Richard Sutton, Andrew Barto (1981). Toward a modern theory of adaptive networks: Expectation and prediction, Psychological Review, Vol. 88, pp. 135-170. pdf
Richard Sutton, Andrew Barto (1990). Time-Derivative Models of Pavlovian Reinforcement. in Michael Gabriel, John Moore (eds.) (1990). Learning and Computational Neuroscience: Foundations of Adaptive Networks. MIT Press, pdf
Richard C. Yee, Sharad Saxena, Paul E. Utgoff, Andrew Barto (1990). Explaining Temporal Differences to Create Useful Concepts for Evaluating States. AAAI 1990, pdf
Steven Bradtke, Andrew Barto (1996) Linear Least-Squares Algorithms for Temporal Difference Learning. Machine Learning, Vol. 22, Nos. 1/2/3, pdf
Richard Sutton, Andrew Barto (1998). Reinforcement Learning: An Introduction. MIT Press

External Links

References

What links here?

Page	Date Edited
A. Harry Klopf	Dec 29, 2017
Andrew Barto	Feb 11, 2018
Arthur Samuel	May 29, 2016
Backgammon	Dec 22, 2017
Gerald Tesauro	Dec 13, 2016
Learning	Feb 20, 2018
Mathematician	Apr 9, 2018
Neural Networks	Mar 12, 2018
Paul E. Utgoff	Dec 20, 2016
People	Feb 28, 2018
Reinforcement Learning	Feb 12, 2018
Richard Sutton	Feb 20, 2018
Temporal Difference Learning	Feb 20, 2018
Trajectory	Jan 3, 2015

Up one level

Arie de Bruin

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

Home * People * Arie de Bruin

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

Photos

Selected Publications

Photos

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

Selected Publications

^[4] ^[5]

1990 ...

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

1995 ...

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

2000 ...

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

External Links

Welcome to the homepage of Arie de Bruin

References

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

What links here?

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

Up one level

Arthur Samuel

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

Home * People * Arthur Samuel

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

Photos

Quotes

See also

Selected Publications

External Links

References

What links here?

Photos

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

Quotes

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

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.

Selected Publications

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

External Links

References

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

What links here?

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

Up one level

Aske Plaat

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

Home * People * Aske Plaat

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

See also

Selected Publications

Selected Publications

^[5] ^[6]

1994

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

1995

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

1996

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

1997 ...

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

2000 ...

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

2010 ...

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

2011

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

2012

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

2013

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

2014

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

2015 ...

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

External Links

References

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

What links here?

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

Up one level

Bob Herschberg

GerdIsenberg — Tue, 13 Dec 2016 13:19:28 GMT

Home * People * Bob Herschberg

		Israel Samuel (Bob) Herschberg, (March 18, 1928 - March 19, 1998) was a Dutch chemist, computer scientist, and from 1978 until his retirement at January 16, 1998, professor of Computer Science at the Delft University of Technology. With Jaap van den Herik, Bob Herschberg was long time editor of the ICCA Journal as well as editor of the Advances in Computer Chess 7 conference proceedings.
Bob Herschberg ^[1]

Biography

Poems

Quotes

Selected Publications

Biography

Born 1928 in Rotterdam, Israel Samuel Herschberg visited the Gymnasium Erasmianum until the Nuremberg Laws were applied during the German Occupation of the Netherlands in World War II. He continued at the Joodse Lycea (Jewish College) in Rotterdam and Amsterdam, until he got arrested in April 1944, and imprisoned in the Bergen-Belsen Nazi concentration camp (via Westerbork). After his liberation he continued at Gymnasium Erasmianum and got a diplom in 1946 ^[2].

Bob Herschberg started to study chemistry in Amsterdam and had first contact with computers in 1958. His 1966 thesis Overdetermined Linear Systems in Multicomponent Spectrophotometry ^[3] from the Eindhoven University of Technology was a groundbreaking publication, and his related school of information theory was yielding a new generation of computer scientist in the Netherlands. After a career as consultant at Nederlandse Staatsmijnen and Unilever, where he revealed many errors in the operating systems of their mainframes, he accepted a professorship at Delft University of Technology in 1978, with research interests Information security and Computer Chess ^[4]. He had the fame as "The Ethical Hacker" ^[5] and in his inaugural address titled In de Ban van de Fout (Under the spell of error) ^[6] he stated that the protection of private-sensitive data is actually impossible. Only two months after his retirement, Israel Samuel Herschberg passed away at age 70.

Poems

Under the acronym DRISH, Bob Herschberg was a writer of poems, and published/translated Hebrew and French poems and literature of Judah Halevi, Shmuel Yosef Agnon, Leah Goldberg and Charles d’ Orléans ^[7].

Quotes

by David Levy from Intelligence blues, Bewaar Me ^[8]:

Perhaps Bob Herschberg has found the answer. Deep Blue beats Kasparov - now it is time to retire!

by Jaap van den Herik from Israel Samuel Herschberg: An Obituary ^[9]

Bob Herschberg was fully dedicated to science, language, literature, and problem solving. He was not a chess-player himself, but his father was, and in the Jewish tradition he liked what his father liked. Therefor he was interested in computer chess. Consequently, he encouraged me to bring the ICCA Newsletters/Journal to Delft and promised me support. As all readers know he was a stickler for perfection. Being so devoted to science, he entrusted his body to science. I am sure, his contributions to computer chess will live on.

Selected Publications

^[10] ^[11]

1966

Israel Samuel Herschberg (1966). Overdetermined Linear Systems in Multicomponent Spectrophotometry. Proefschrift, available as pdf reprint

1977

Bob Herschberg, J.C.A. Boekhorst (1977). Concurrent File Access Under Unpredictability. Inf. Process. Lett. 6(6): 203-208

1982

Jaap van den Herik, Bob Herschberg (1982). Donnerwetter. ICCA Newsletter, Vol. 5, No. 1

1984

Harry Nefkens, Jaap van den Herik, Bob Herschberg (1984). De openingsbibliotheek van het schaakprogramma PION. THD rapport (Dutch)

1985

Jaap van den Herik, Bob Herschberg (1985). The Construction of an Omniscient Endgame Data Base. ICCA Journal, Vol. 8, No. 2
Bob Herschberg, Jaap van den Herik (1985). Calling All Mates ICCA Journal, Vol. 8, No. 2
Jaap van den Herik, Bob Herschberg (1985). Elementary Theory Improved, a Conjecture Refuted. ICCA Journal, Vol. 8, No. 3
Bob Herschberg, Jaap van den Herik (1985). A Gauge of Endgames. ICCA Journal Vol. 8, No. 4, pp. 225-229.

1986

Jaap van den Herik, Bob Herschberg (1986). A Data Base on Data Bases. ICCA Journal, Vol. 9, No. 1
Bob Herschberg, Jaap van den Herik (1986). Thompson's New Data-Base Results. ICCA Journal, Vol. 9, No. 1
Bob Herschberg (1986). The 5th World Microcomputer Chess Championship. ICCA Journal, Vol. 9, No. 3, Review on a booklet by C. Roos and T. Sibbing, Computer Chess Foundation Amsterdam
Jaap van den Herik, Bob Herschberg (1986). A Note on KBBK. ICCA Journal, Vol. 9, No. 4
Jaap van den Herik, Bob Herschberg (1986). Omniscience, the Rulegiver? Proceedings of L'Intelligenza Artificiale Ed Il Gioco Degli Scacchi, IIIo Convegno Internazionale (eds. B. Pernici and M. Somalvico), pp. 1-17.

1987

Jaap van den Herik, Bob Herschberg (1987). The KBBKN Statistics: New Data from Ken Thompson. ICCA Journal, Vol. 10, No. 1
Bob Herschberg, Jaap van den Herik (1987). By Crawls and Creeps. ICCA Journal, Vol. 10, No. 2
Bob Herschberg, Jaap van den Herik (1987). More Truth on KBBK Database Results. ICCA Journal, Vol. 10, No. 2
Hans Zellner, Jaap van den Herik, Bob Herschberg (1987). Corrections and Substantiations to KBNK. ICCA Journal, Vol. 10, No. 3
Jaap van den Herik, Bob Herschberg, Najib Nakad (1987). A Six-Men-Endgame Database: KRP(a2)KbBP(a3). ICCA Journal, Vol. 10, No. 4, pdf
Sito Dekker, Jaap van den Herik, Bob Herschberg (1987). Complexity Starts at Five. ICCA Journal, Vol. 10, No. 3
Sito Dekker, Jaap van den Herik, Bob Herschberg (1987). Perfect Knowledge and Beyond. Report 37-87, Delft University of Technology, Delft.

1988

Jaap van den Herik, Bob Herschberg (1988). Computer Checks on Human Analyses of the KRKB Endgame. ICCA Journal, Vol. 11, No. 1
Jaap van den Herik, Bob Herschberg, Najib Nakad (1988). Karpov Amends Timman's Analysis. ICCA Journal, Vol. 11, No. 1, pdf
Jaap van den Herik, Bob Herschberg, Najib Nakad (1988). A Reply to R. Sattler's Remarks on the KRP(a2)KbBP(a3) Database. ICCA Journal, Vol. 11, No. 2/3, pdf

1989

Bob Herschberg, Jaap van den Herik, Patrick Schoo (1989). Verifying and Codifying Strategies in a Chess Endgame. Workshop on New Directions in Game-Tree Search
Sito Dekker, Jaap van den Herik, Bob Herschberg (1989). Perfect Knowledge and Beyond. Advances in Computer Chess 5
Bob Herschberg, Jaap van den Herik, Patrick Schoo (1989). Verifying and Codifying Strategies in the KNNKP(h) Endgame. ICCA Journal, Vol. 12, No. 3, pdf
Bob Herschberg, Jaap van den Herik (1989). Thank You, Dr. Shannon. ICCA Journal, Vol. 12, No. 4 » Claude Shannon, WCCC 1989

1990

Bob Herschberg, Ronald Paans (1990). Friday the 13th, facts and fancies. Computers & Security 9(2): 125-130
Ronald Paans, Bob Herschberg (1990). Auditing the change management process. Computers & Security 9(2): 161-174
Bob Herschberg, Ronald Paans (1990) Sloppy, sloppier, sloppiest. Computers & Security 9(3): 223-228
Sito Dekker, Jaap van den Herik, Bob Herschberg (1990). Perfect Knowledge Revisited. Artificial Intelligence, Vol. 43, No. 1, pp. 111-123.
Mikhail Donskoy, Jaap van den Herik, Bob Herschberg (1990). Finessing in Games. ICCA Journal, Vol. 13, No. 4
Bob Herschberg, Jaap van den Herik, Patrick Schoo (1990). Verifying and Codifying Strategies in a Chess Endgame. Computers, Chess, and Cognition, pp. 183-196

1991

Victor Allis, Jaap van den Herik, Bob Herschberg (1991). Which Games Will Survive? Heuristic Programming in Artificial Intelligence 2
Bob Herschberg, Jaap van den Herik (1991). Doubting Castle. ICCA Journal, Vol. 14, No. 3

1992

Dennis Breuker, Victor Allis, Jaap van den Herik, Bob Herschberg (1992). A Database as a Second. ICCA Journal, Vol. 15, No. 1
Jaap van den Herik, Bob Herschberg (1992). The 7th World Computer-Chess Championship. Report on the Tournament. ICCA Journal, Vol. 15, No. 4 » WCCC 1992

1993

Bob Herschberg, Jaap van den Herik (1993). Back to fifty. ICCA Journal, Vol. 16, No. 1
Jaap van den Herik, Bob Herschberg. (1993). J. Nunn: Secrets of Rook Endings. ICCA Journal, Vol. 16, No. 2
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1993). Potential Applications of Opponent-Model Search. Part 1: The Domain of Applicability. ICCA Journal, Vol. 16, No. 4

1994

Edo Roos Lindgreen, Bob Herschberg (1994). On the validity of the Bell-La Padula model. Computers & Security 13(4): 317-333
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1994). Potential Applications of Opponent-Model Search. Part 2. Risks and strategies. ICCA Journal, Vol. 17, No. 1
Bob Herschberg, Jaap van den Herik (1994). J. Nunn: Secrets of Pawnless Endings. ICCA Journal, Vol. 17, No. 2
Bob Herschberg, Jaap van den Herik (1994). The Five Powers. ICCA Journal, Vol. 17, No. 4
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1994). Thoughts on the Application of Opponent-Model Search. Advances in Computer Chess 7

1995

Bob Herschberg, Jaap van den Herik (1995). Mikhail Moiseivich Botvinnik: An Obituary. ICCA Journal, Vol. 18, No. 2 » Mikhail Botvinnik
Bob Herschberg, Jaap van den Herik (1995). Aegonics. ICCA Journal, Vol. 18, No. 3, pdf
Bob Herschberg, Jaap van den Herik (1995). Dieter Steinwender and Frederic F. Friedel: Schach am PC. ICCA Journal, Vol. 18, No. 4
Bob Herschberg, Jaap van den Herik (1995). Peter Schreiner and Karsten Bauermeister (eds.): Der Schachcomputerkatalog. ICCA Journal, Vol. 18, No. 4

1996

Bob Herschberg, Jaap van den Herik (1996). Konrad Zuse: An Obituary. ICCA Journal, Vol. 19, No. 1 » Konrad Zuse
Bob Herschberg, Jaap van den Herik (1996). Chess or Beyond? ICCA Journal, Vol. 19, No. 2

1997

Bob Herschberg (1997). A Brief History of the Future ICCA. ICCA Journal, Vol. 20, No. 2

1998

Bewaar Me, Liber amicorum voor Prof. dr. I.S. Herschberg, Redactie Jaap van den Herik en E. Roos Lindgreen, 16 januari 1998, Drukkerij Van Spijk B.V. Delft, The Netherlands
- Bob Herschberg (1998). Vers naar Vers, pp. 8-19.
- Ben Mittman (1998). Times Past: Some Remembrances and Reflections, pp. 149-151.
- Tony Marsland (1998). Too Clever by Half, pp. 152-153.
- David Levy (1998). Intelligence Blues, pp. 154-156.
- Jonathan Schaeffer (1998). A Database of Databases, pp. 157-161. A tribute to the late Bob Herschberg, available as ps
- Jaap van den Herik (1998). Geleerd, pp. 162-166.
- Bob Herschberg (1998). Al Goed - Afscheidsrede, pp. 201-216.

External Links

Israel Samuel Herschberg from Wikipedia.nl
The Mathematics Genealogy Project - Israel Herschberg

References

^ Prof. I.S. Herschberg laat studenten inbreken in computersystemen, Brabants Dagblad November 28, 1987, Photo by
Bert Houweling, from Giga's Hacker Media by Walter Belgers
^ Israel Samuel Herschberg (1966). Overdetermined Linear Systems in Multicomponent Spectrophotometry. page 159 Levensbericht
^ Israel Samuel Herschberg (1966). Overdetermined Linear Systems in Multicomponent Spectrophotometry. available as pdf reprint
^ Israel Samuel Herschberg from Wikipedia.nl
^ Subject: Hacking at the End of the Universe, Summer Congress 1993 - fun reading (especially toward the end) by Dave Farber, May 21, 1993
^ Bob Herschberg (1978). In de Ban van de Fout. Inaugurele rede. Technische Hogescholl Delft.
^ Bewaar Me, Liber amicorum voor Prof. dr. I.S. Herschberg, Redactie H.J. van den Herik en E. Roos Lindgreen, Delft, 16 januari 1998
^ David Levy (1998). Intelligence blues from Bewaar Me, Liber amicorum voor Prof. dr. I.S. Herschberg, Redactie H.J. van den Herik en E. Roos Lindgreen, Delft 16 januari 1998
^ Jaap van den Herik (1998) Israel Samuel Herschberg: An Obituary. ICCA Journal Vol. 21, No. 2, pp. 121.
^ ICGA Reference Database(pdf)
^ I. S. Herschberg List of publications from the DBLP Bibliography Server

What links here?

Page	Date Edited
2nd Computer Olympiad	Jul 12, 2017
Advances in Computer Chess 5	Dec 2, 2017
Advances in Computer Chess 7	Oct 28, 2014
Aegon 1995	Apr 6, 2017
Bob Herschberg	Dec 13, 2016
CC Sapiens	Oct 29, 2014
Claude Shannon	Apr 30, 2016
Computers, Chess, and Cognition	Dec 28, 2016
David Forthoffer	Apr 25, 2016
Delft University of Technology	Feb 4, 2018
Delicate Brute	Jun 7, 2016
Dennis Breuker	Dec 19, 2016
El Ajedrecista	Feb 25, 2015
Endgame Tablebases	Mar 6, 2018
Fifty-move Rule	Aug 9, 2017
Games	Feb 20, 2018
Hans Zellner	Jun 12, 2016
Harry Nefkens	Dec 28, 2016
Hiroyuki Iida	Aug 11, 2017
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
John Nunn	Dec 9, 2017
Jonathan Schaeffer	Jan 29, 2018
Jos Uiterwijk	Aug 11, 2017
Joseph Sugarman	Jun 19, 2013
KBNK Endgame	Nov 26, 2016
Konrad Zuse	Apr 30, 2015
Lars Rasmussen	Apr 25, 2016
Maastricht University	May 15, 2017
Mathematician	Apr 9, 2018
Mikhail Botvinnik	Jul 15, 2017
Mikhail Donskoy	Dec 23, 2017
Najib Nakad	Oct 22, 2014
Opponent Model Search	Aug 14, 2017
Patrick Schoo	May 25, 2016
People	Feb 28, 2018
Pion	May 22, 2016
Prochess	Jan 7, 2016
Rook Endgame	Sep 18, 2017
Sito Dekker	Apr 25, 2016
Technical University of Madrid	Feb 25, 2015
Thompson's Databases	Dec 24, 2014
Victor Allis	Dec 19, 2016
WCCC 1989	Dec 5, 2017
WCCC 1992	Feb 26, 2018
WMCCC 1985	Feb 6, 2018

Up one level

Chess Psychology Booklist

GerdIsenberg — Thu, 11 Apr 2013 10:22:35 GMT

Home * Knowledge * Psychology * Booklist

Blindfold Chess. History, Psychology, Techniques, Champions, World Records, and Important Games. Eliot Hearst and John Knott. McFarland and Company. 2009. 437 pages.
Chess: A Psychiatrist Matches Wits with Fritz. Ernest Pecci ^[1]^[2], MD. Pavior Publishing. 2001. 412 pages. amazon
Chess for Tigers. Simon Webb. Maxwell Macmillan Chess. 1991. 120 Pages. amazon.uk
Chess Master at Any Age. Rolf Wetzell. Thinkers’ Press. 1994. 300 pages. amazon
Chess Players’ Thinking. Pertti Saariluoma. Routledge. 1995. 201 pages. amazon
Chess Psychology. Angus Dunnington. Everyman Chess. 2003. 128 pages. google books
Chess. The Mechanics of the Mind. Pfleger and Treppner. 1988. 156 pages. amazon.de
Dynamics of Chess Psychology. Cary Utterberg. Chess Digest. 1994. 219 pages. Dynamics of Chess Psychology from Schachversand Niggemann
How to Become a Candidate Master. Alex Dunne. Thinkers’ Press. 1985. 252 pages. amazon
Moves in Mind. The Psychology of Board Games. Gobet et al. Psychology Press. 2004. 273 pages. amazon
Perception and Memory in Chess. Studies in the Heuristics of the Professional Eye. Adriaan de Groot & Fernand Gobet. Van Gorcum. 1996. 315 pages.
Philosophy Looks at Chess. Edited by Benjamin Hale. Open Court. 2008. 236 pages. review
Practical Chess Psychology. Amatzia Avni. Batsford. 2001. 160 pages. chesscafe.com
Predicament in 2 Dimensions. Ariel Mengarini. Thinkers’ Press. 1979. 105 pages. amazon.uk
Psychology in Chess. Nikolai Krogius. RHM Press. 1976. 243 pages. amazon
Schachpsychologie. Reinhard Munzert. Beyer Verlag. 1998. 390 pages. amazon.de
Secrets of a Grandpatzer. Malibu Chess Press. Kenneth Colby. 1979. 139 pages. amazon
The Art of Learning. An Inner Journey to Optimal Performance. Josh Waitzkin. Free Press. 2007. 265 pages. amazon
The Chess Mind. Cranberg and Albert. Guilford Press. 1988. 190 pages.
The Chess Mind. Gerald Abrahams. A Penguin Handbook. 1960. 346 pages. National Library Of Australia
The Genius and the Misery of Chess. Zhivko Kaikamjozov. Mongoose Press. 2008. 224 pages. amazon.uk
The Grandmaster’s Mind. Amatzia Avni. Gambit. 2004. 176 pages. amazon
The Inner Game of Chess. How to Calculate and Win. Andrew Soltis. McKay Chess Library. 1995. 359 pages. amazon
The Psychology of Chess Skill. Dennis Holding. Lawrence Erlbaum Associates. 1985. 271 pages. amazon
The Psychology of Chess. Hartston and Wason. Facts on File. 1984. 138 pages. amazon
The Psychology of the Chess Player. Reuben Fine. Dover. 1967. 74 pages. amazon
Think Like a Grandmaster. Kotov. Batsford. 1994. 200 pages. amazon
Thought and Choice in Chess. A. D. De Groot. Basic Books. 1965. 463 pages. amazon
Train Like a Grandmaster. Kotov. Batsford. 1981. 124 pages. amazon
Winning Chess Psychology. Wilf Holloway. Schachfirma Fruth. 1997. 212 pages.
Winning Chess Psychology 2. Wilf Holloway. 233 pages, see Wilfred Holloway from Schachversand Niggemann
Winning with Chess Psychology. Benko and Hochberg. McKay Chess Library. 1991. 264 pages. amazon

References

^ CHESS: A psychiatrist matches wits with Fritz - review from ChessBase, May 18, 2002
^ Chessgames of Ernest F Pecci from chessgames.com

Up one Level

Chrilly Donninger

GerdIsenberg — Mon, 19 Dec 2016 13:49:22 GMT

Home * People * Chrilly Donninger

		Christian (Chrilly) Donninger, an Austrian computer scientist, statistician and professional computer chess, games and trading optimization programmer. He holds a Ph.D. in Mathematical Statistics from Vienna University of Technology ^[1] ^[2] and worked at Institute of Advanced Studies, Vienna and Siemens, until he became freelance chess programmer in 1993. Chrilly is author and co-author of various chess programs, most notably Nimzo and the FPGA chess entity Hydra under the patronage of the Pal Group of Companies ^[3] and Sheikh Tahnoon Bin Zayed Al Nahyan ^[4] ^[5] of Abu Dhabi, United Arab Emirates, discontinued in 2006 ^[6], while Chrilly continued programming on the game theory related topic of bank trading optimization software for stock-markets ^[7]. Since 2007 he is chief scientist for the Sibyl financial project of PAL group, and maintains the Sibyl Godot Finance Server along with Steffen Jakob ^[8]. Besides, since 2010, Chrilly is lecturer in Quantitative Finance at the University of Jena ^[9].
Chrilly Donninger ^[10]

Selected Publications

Photos

David Bronstein vs. Nimzo by Chrilly, Johan de Koning kibitzing, Aegon 1997 ^[11]


Chrilly Donninger and Dieter Steinwender, Aegon 1997 ^[12]		Chrilly celebrating Nimzo's victory IPCCC 1998 ^[13]

Chrilly's Programs

Nimzo (Nimzo Guernica, Nimzo 3, Nimzo 98, Nimzo 2000)
Minimax a didactical open source program in Basic, with Dieter Steinwender ^[14]
Hydra 97 with Alex Kure
Tiger Grenadier
Schweinehund
Brutus (FPGA)
Hydra

Null Move

In 1993 Chrilly Donninger published the famous Null Move paper in the ICCA Journal ^[15] and made Null Move popular to a great audience of computer chess researchers and programmers. Since then, also due to the concrete implementation in pseudo C, Null Move became standard in modern chess programs.

232

Donninger developed the Auto232 protocol ^[16] ^[17] not only to interface with the external Chess 232 Board to make playing PC programs a dedicated experience, but to play automatic matches between different computers via the serial RS-232 communication ports. The Interface software was able to "hook" the input and output of various commercial PC chess programs.
With the advent and wider distribution of the standardized computer chess protocols such as the Chess Engine Communication Protocol and the Universal Chess Interface, supported by graphical user interfaces as well as chess programs, Auto232 became more and more obsolete.

CHE

Chrilly introduced a Graphical Language for Expressing Chess Knowledge in Nimzo, CHE ^[18] ^[19], which was apparently used as a root-preprocessor. Time Management issues were also on Chrilly's track ^[20] ^[21] .

Guernica

Nimzo Guernica ^[22] was Donninger's first program, a manifest of Chrilly's Anti-war engagement.

Pablo Picasso, Guernica from Wikipedia

Éclat

Chrilly Donninger had strong objections and repugnance against the Iraq War, which began on March 20, 2003 with the United States-led invasion. His pacifism in conjunction with counter Americanism was justified by the traumatic experience of his father during World War II in Austria. Chrilly, at the same time somehow related with hosting of the upcoming Graz WCCC 2003 event, emotionally overacted and sent hatred e-mails to American computer chess programmers, which led to a boycott of the WCCC by those programmers and others, most notably by Bruce Moreland ^[23] . Chrilly later apologized, but the hurt was already too big.

Writer

Chrilly is regularly column writer in the German chess magazines KARL ^[24] and Kaissiber ^[25] . He also wrote for Modul, PC Schach, Computerschach und Spiele^[26] and the ICGA Journal.

Selected Publications

1987 ...

Chrilly Donninger (1987). Mathematische, statistische und computergestützte Methoden der Netzwerkanalyse. (Mathematical, statistical and programming methods for the Analysis of networks), Ph.D. thesis, Vienna University of Technology ^[27]

1990 ...

Chrilly Donninger (1992). The Relation of Mobility, Strategy and the Mean Dead Rabbit in Chess. Heuristic Programming in AI 3
Chrilly Donninger (1993). Null Move and Deep Search: Selective-Search Heuristics for Obtuse Chess Programs. ICCA Journal, Vol. 16, No. 3
Ingo Althöfer, Chrilly Donninger, Ulf Lorenz, Valentin Rottmann (1994). On Timing, Permanent Brain and Human Intervention. Advances in Computer Chess 7
Chrilly Donninger (1994). A La Recherche du Temps Perdu: `That was easy'. ICCA Journal, Vol. 17, No. 1
Chrilly Donninger (1994). Die Kunst des Nichtstuns. CSS 2/94, pdf (German)

1995 ...

Chrilly Donninger (1996). Zauberlehrling - Das Auto232-Protokoll im Detail. CSS 1/96, pdf (German)
Chrilly Donninger (1996). CHE: A Graphical Language for Expressing Chess Knowledge. ICCA Journal, Vol. 19, No. 4
Chrilly Donninger, Klaus Manhart (1997). Der PC lernt Schach - Das Spiel der Könige. DOS, April 1997, pdf
Chrilly Donninger (1999). Computer machen keine Fehler. CSS 2/99, pdf (German)
Chrilly Donninger (1999). Der Fortschritt ist nicht aufzuhalten - Chrilly Donninger über Endspieldatenbanken. CSS 6/99, pdf (German)

2000 ...

Chrilly Donninger (2000). W. Steinitz gegen L. Gott. Kaissiber Nr. 15, pdf (German)
Wenzel Mraček (2003). Zu Besuch bei Christian „Chrilly“ Donninger. pdf (German)
Chrilly Donninger, Alex Kure, Ulf Lorenz (2004). Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program. IPDPS’04
Chrilly Donninger, Ulf Lorenz (2004). The Chess Monster Hydra in Field Programmable Logic and Application, 14th International Conference, FPL 2004, Leuven, Belgium, August 30-September 1, 2004. Proceedings, pp 927-932. Springer Berlin / Heidelberg, ISBN 978-3-540-22989-6, pdf
Carl Bicknell (2004). Interview with Chrilly Donninger, Subject: Hydra. Selective Search 113, pp. 19, pdf hosted by Mike Watters

2005 ...

Chrilly Donninger, Ulf Lorenz (2005). The Hydra project. Xcell Journal, Issue 53, pp. 94–97.
Chrilly Donninger (2005). Shredder gegen Hydra in Abu Dhabi. CSS online (German)
Chrilly Donninger, Ulf Lorenz (2005). Innovative Opening-Book Handling. Advances in Computer Games 11, pdf

Forum Posts

I know something of Dr.Donninger by Chrilly Donninger, Hiarcs Forum, October 10, 2007

External Links

Chrilly Donninger from Wikipedia
Chrilly's ICGA Tournaments
Sibyl Godot: Finance Server by Chrilly Donninger and Steffen Jakob
Sibyl Godot: Finance Server - Chrilly Donninger
Geschichten aus dem Hochland (German)
Donninger, Chrilly from computer-go.info
Meet the Authors by Ed Schröder
Donninger: Widmungen, ChessBase Spotlights (German)
Denkspiele und mehr - Chrillys Ecke (German) by Lars Bremer
Donninger, Christian from Schachcomputer.info - Wiki (German)
Jan Louwman, 1924 – 2002 Eric van Reem and Dr Christian Donninger remembering Jan Louwman, at ChessBase.com
Does Kasparov play 2800 Elo against a computer? by Chrilly Donninger, ChessBase News, August 26, 2003
Parallele Schachprogrammierung, ChessBase News, September, 16, 2003 (German)
From Brutus to Hydra - The mathematician Donninger about the evolution of his chess program, Danube University Krems, January 19, 2004
Workshop Jena 2008: Analysis, Design, and Programming of Games pictorial report by Ingo Althöfer

References

^ Chrilly Donninger (1987). Mathematische, statistische und computergestützte Methoden der Netzwerkanalyse. (Mathematical, statistical and programming methods for the Analysis of networks), Ph.D. thesis, Vienna University of Technology
^ TU Vienna mentioned in Curriculum Vitae - Christian "Chrilly" Donninger (pdf)
^ Pal Group of Companies
^ Al Nahyan family from Wikipedia
^ First Gulf Bank - Key people - Vice-Chairman - Wikipedia
^ Hydra (chess) from Wikipedia
^ Das Programm der Langen Nacht der Wissenschaft - STERNSTUNDEN. Lange Nacht der Wissenschaften Jena 25.11.2011 (German)
^ Sibyl Godot Finance Server by Chrilly Donninger and Steffen Jakob
^ Curriculum Vitae - Christian "Chrilly" Donninger (pdf)
^ from the Photo Composition of the Participants, DOCCC 1999, Dutch Open Computer Chess Championship 1999 old CSVN site
^ David Bronstein vs. Nimzo, Photo by Thorsten Czub from Aegon 1996-97
^ Chrilly Donninger and Dieter Steinwender, Photo by Thorsten Czub from Aegon 1996-97
^ Ein Besuch in Paderborn 1998 by Thorsten Czub
^ Minimax in BASIC converted to WinBoard by Thomas McBurney
^ Chrilly Donninger (1993). Null Move and Deep Search: Selective-Search Heuristics for Obtuse Chess Programs. ICCA Journal, Vol. 16, No. 3
^ AUTO232.TXT - Technische Spezifikation des 232-Protokolls (German) by Harald Faber, rgcc, January 08, 1997
^ Auto232 player - Auto232 and Winboard by Aaron Tay, hosted by Ron Murawski
^ Chrilly Donninger (1996). CHE: A Graphical Language for Expressing Chess Knowledge. ICCA Journal, Vol. 19, No. 4
^ CHE docs in English / Nimzo 3 version by Mike S., CCC, November 22, 2001
^ Chrilly Donninger (1994). A la Recherche du Temps Perdu: 'That was easy'. ICCA Journal, Vol. 17, No. 1
^ Ingo Althöfer, Chrilly Donninger, Ulf Lorenz, Valentin Rottmann (1994). On Timing, Permanent Brain and Human Intervention. Advances in Computer Chess 7
^ Guernica from Wikipedia
^ Why I am not going to the Graz WCCC by Bruce Moreland, CCC, April 01, 2003
^ KARL das kulturelle Schachmagazin (German)
^ Kaissiber Info in English
^ Dr. Christian Donninger - Computerschach und Spiele Author profile
^ Amazon.de: Dr. Christian Donninger "vulgo Chrilly"s Rezension von Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data

What links here?

Page	Date Edited
3rd Computer Olympiad	Jul 25, 2017
8th Computer Olympiad	Jul 22, 2017
Advances in Computer Chess 7	Oct 28, 2014
Advances in Computer Games 11	Dec 27, 2016
Alex Kure	Aug 27, 2016
Andreas Mader	Dec 30, 2017
Auto232	Feb 25, 2018
Basic	Jan 3, 2018
Belle	Jan 18, 2018
Betsabe	Jul 23, 2017
Book Learning	Jan 1, 2017
Bruce Moreland	Jan 20, 2016
Brutus	Dec 24, 2016
Brutus NL	Aug 22, 2016
CCT1	Dec 30, 2012
CCT2	Sep 7, 2012
Che ES	Aug 18, 2015
Checkmate	Apr 13, 2018
Chess 232 Board	Jun 19, 2016
Chrilly Donninger	Dec 19, 2016
Computerschach und Spiele	May 16, 2016
Conferences	Dec 18, 2017
CXG Star Chess	Jun 23, 2017
David Bronstein	Oct 28, 2014
Debugging	Jan 20, 2018
DelphiMax	Apr 3, 2013
Depth Reduction R	Oct 4, 2017
Dieter Steinwender	Jul 4, 2016
DOCCC 1999	Aug 15, 2015
Eiko Bleicher	Apr 24, 2014
En passant	Jan 16, 2018
Endgame Tablebases	Mar 6, 2018
Entering Moves	Sep 7, 2017
Enterprise	Jun 23, 2017
Erdogan Günes	Jul 7, 2017
Eric White	Jan 27, 2016
Fabien Rybka Letter	Feb 23, 2014
Fail-Soft	Jun 2, 2017
Ferret	Jan 7, 2016
FPGA	Jul 9, 2016
Frank Schneider	Jan 7, 2016
Frans Morsch	Jun 23, 2017
Fritz	Feb 26, 2018
Greif	May 17, 2016
GridChess	Jul 13, 2016
Hardware	Jan 20, 2018
Helmut Weigel	Dec 2, 2017
Hossa	Jan 7, 2016
Hydra	Aug 17, 2016
Hydra 97	Jan 1, 2017
ICGA Journal	Dec 21, 2017
ICGA Journal Awards to Include	May 21, 2015
ICT 2004	Aug 17, 2016
Ingo Althöfer	May 4, 2017
Ingo Althöfer reports to include	Jan 26, 2017
InmiChess	Mar 6, 2014
IPCCC 1991	Jun 9, 2016
IPCCC 1998	Feb 25, 2018
IPCCC 2002	May 31, 2014
IPCCC 2004	Dec 1, 2014
IPCCC 2005	Aug 21, 2015
Jan Louwman	Dec 4, 2016
Johan Havegheer	Feb 2, 2013
Kanguruh	Jan 13, 2013
Karsten Müller	Oct 19, 2017
Knowledge	Jul 22, 2017
Languages	Nov 26, 2017
Lars Bremer	Aug 1, 2013
List (Program)	Jan 7, 2016
Loop (Program)	Mar 14, 2017
Martin Bauer	Apr 3, 2013
Mate Threat Extensions	Apr 14, 2012
Michael Ehrig	May 17, 2016
Minimax (program)	Dec 27, 2013
Mobility	Jan 17, 2018
Modul	Dec 30, 2017
Mohammed Nasir Ali	Dec 3, 2014
MTD(f)	Jul 17, 2017
Newcrest Technology	Jan 26, 2016
Nimzo	Dec 30, 2017
Null Move Pruning	Dec 2, 2017
Opening Book	Feb 26, 2018
Oracle	Sep 4, 2016
PC Schach	Dec 30, 2017
People	Feb 28, 2018
Piece-Square Tables	Mar 31, 2018
Planning	Feb 12, 2018
Pondering	Dec 9, 2017
Pruning	Jan 1, 2018
Quest	Mar 26, 2017
Queue	Apr 4, 2017
Rainer Feldmann	Dec 19, 2016
Rajah	Sep 12, 2012
Reinhold Gellner	Jun 15, 2016
Ruffian	Jun 6, 2017
Rybka	Mar 27, 2017
Schweinehund	May 15, 2014
Score	Apr 14, 2018
Steffen A. Jakob	Jan 7, 2016
Strategy	Jan 18, 2018
Thomas Mally	Dec 30, 2017
Thomas McBurney	Jul 30, 2017
Time Management	Mar 20, 2018
Ulf Lorenz	Dec 22, 2016
Valentin Rottmann	Jan 7, 2016
Vasik Rajlich	Sep 23, 2017
Vienna University of Technology	Dec 7, 2017
Warp	Nov 26, 2017
WCCC 1992	Feb 26, 2018
WCCC 1999	Jul 13, 2017
WCCC 2002	Nov 24, 2017
WCCC 2003	Apr 2, 2017
WCCC 2007	Jan 2, 2017
Werner Inmann	Mar 6, 2014
WMCCC 1993	Dec 30, 2017
WMCCC 1995	Jan 3, 2018
WMCCC 1996	Sep 15, 2016
WMCCC 1997	Apr 4, 2017
WMCCC 2000	Feb 27, 2018
Wolfgang Zugrav	Jul 13, 2016

Up one level

Csaba Szepesvári

GerdIsenberg — Mon, 23 May 2016 09:32:08 GMT

Home * People * Csaba Szepesvári

		Csaba Szepesvári, a Hungarian computer scientiest with research interests in applications of statistical techniques in AI, and Reinforcement Learning ^[1]. Csaba Szepesvári worked at the Computer and Automation Research Institute of the Hungarian Academy of Sciences, and is actually Associate Professor ^[2] at the Department of Computing Science, University of Alberta and is principal investigator of the RLAI ^[3] group. In 2006, together with Levente Kocsis, Csaba Szepesvári introduced UCT (Upper Confidence bounds applied to Trees), a new algorithm that applies bandit ideas to guide Monte-Carlo planning ^[4].
Csaba Szepesvári ^[5]

Selected Publications

Selected Publications

^[6] ^[7]

1994 ...

Csaba Szepesvári, Lászlo Balázs, András Lõrincz (1994). Topology learning solved by extended objects: a neural network model. pdf
Csaba Szepesvári (1998). Reinforcement Learning: Theory and Practice. in Proceedings of the 2nd Slovak Conference on Artificial Neural Networks, zipped ps

2005 ...

Levente Kocsis, Csaba Szepesvári, Mark Winands (2005). RSPSA: Enhanced Parameter Optimization in Games. Advances in Computer Games 11, pdf
Levente Kocsis, Csaba Szepesvári (2006). Universal Parameter Optimisation in Games Based on SPSA. Machine Learning, Special Issue on Machine Learning and Games, Vol. 63, No. 3
Levente Kocsis, Csaba Szepesvári (2006). Bandit based Monte-Carlo Planning. ECML-06, LNCS/LNAI 4212, pp. 282-293. introducing UCT, pdf
Levente Kocsis, Csaba Szepesvári, Jan Willemson (2006). Improved Monte-Carlo Search. pdf
András György, Levente Kocsis, Ivett Szabó, Csaba Szepesvári (2007). Continuous Time Associative Bandit Problems IJCAI-07, 830-835. pdf
Jean-Yves Audibert, Rémi Munos, Csaba Szepesvári (2007). Tuning Bandit Algorithms in Stochastic Environments. pdf
Richard Sutton, Csaba Szepesvári, Hamid Reza Maei (2008). A Convergent O(n) Algorithm for Off-policy Temporal-difference Learning with Linear Function Approximation, pdf (draft)
Rémi Munos, Csaba Szepesvári (2008). Finite time bounds for sampling based fitted value iteration. Journal of Machine Learning Research, 9:815-857, 2008. pdf, pdf
Hamid Reza Maei, Csaba Szepesvári, Shalabh Bhatnagar, Doina Precup, David Silver, Richard Sutton (2009). Convergent Temporal-Difference Learning with Arbitrary Smooth Function Approximation. Accepted in Advances in Neural Information Processing Systems 22, Vancouver, BC. December 2009. MIT Press. pdf
Richard Sutton, Hamid Reza Maei, Doina Precup, Shalabh Bhatnagar, David Silver, Csaba Szepesvári, Eric Wiewiora. (2009). Fast Gradient-Descent Methods for Temporal-Difference Learning with Linear Function Approximation. In Proceedings of the 26th International Conference on Machine Learning (ICML-09). pdf
Jean-Yves Audibert, Rémi Munos, Csaba Szepesvári (2009). Exploration-exploitation trade-off using variance estimates in multi-armed bandits. Theoretical Computer Science, 410:1876-1902, 2009, pdf

2010 ...

István Szita, Csaba Szepesvári (2010). Model-based reinforcement learning with nearly tight exploration complexity bounds. ICML 2010
István Szita, Csaba Szepesvári (2011). Agnostic KWIK learning and efficient approximate reinforcement learning. Journal of Machine Learning Research - Proceedings Track 19
Sylvain Gelly, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Levente Kocsis, David Silver, Csaba Szepesvári (2012). The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions. Communications of the ACM, Vol. 55, No. 3, pdf preprint

External Links

Homepage of Csaba Szepesvári from University of Alberta
Csaba, Szepesvári, PhD. Senior Research Scientist from Hungarian Academy of Sciences
Introduction to Reinforcement Learning, videolecture by Csaba Szepesvári, 2008

References

What links here?

Page	Date Edited
Advances in Computer Games 11	Dec 27, 2016
Arkadiusz Nowakowski	Mar 17, 2015
Automated Tuning	Feb 27, 2018
Csaba Szepesvári	May 23, 2016
David Silver	Feb 11, 2018
Doina Precup	Feb 12, 2018
Eric Wiewiora	May 23, 2016
Go	Jan 24, 2018
Hamid Reza Maei	May 9, 2015
István Szita	Aug 4, 2015
Jan Willemson	Dec 27, 2016
Jean-Yves Audibert	Apr 29, 2015
Learning	Feb 20, 2018
Levente Kocsis	Dec 23, 2016
Marc Schoenauer	Jun 13, 2017
Mark Winands	Sep 19, 2017
Michèle Sebag	May 23, 2016
Monte-Carlo Tree Search	Apr 26, 2018
Nicolò Cesa-Bianchi	May 30, 2015
Olivier Teytaud	Jan 7, 2017
Paul Fischer	May 20, 2015
People	Feb 28, 2018
Peter Auer	May 29, 2015
Planning	Feb 12, 2018
Reinforcement Learning	Feb 12, 2018
Rémi Munos	Dec 8, 2017
Richard Sutton	Feb 20, 2018
Shalabh Bhatnagar	Aug 24, 2015
SPSA	May 8, 2017
Sylvain Gelly	Dec 31, 2016
Temporal Difference Learning	Feb 20, 2018
UCT	Jan 22, 2018
University of Alberta	Feb 20, 2018
Volodymyr Mnih	Dec 8, 2017

Up one level

Danny Kopec

GerdIsenberg — Sat, 01 Oct 2016 09:40:32 GMT

Home * People * Danny Kopec

		Danny Kopec, (February 28, 1954 – June 12, 2016 ^[1]) was an American computer scientist, associate professor at the Brooklyn College ^[2], international chess master, chess and computer chess writer and assistant tournament director and reporter of various ACM North American Computer Chess Championships ^[3] , chess programmer and Opening Book Author ^[4] . Along with Larry Harris et al., Danny Kopec was co-author of Dartmouth CP ^[5], competing the ACM 1973 ^[6] . In 1975 Kopec graduated from Dartmouth College and later wrote his Ph.D. in Machine Intelligence at the University of Edinburgh, Thesis: Human and Machine Representations of Knowledge, supervisor Donald Michie ^[7] . In 1982 Danny Kopec and Ivan Bratko designed the Bratko-Kopec Test ^[8] ^[9]. Danny Kopec died on June 12, 2016 from pancreatic cancer ^[10].
Danny Kopec ^[11]

Photos

Chess Endgames

Selected Publications

Photos


IM Danny Kopec ^[12]

Chess Endgames

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

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.

Selected Publications

^[14] ^[15] ^[16]

1977 ...

Danny Kopec (1977). Recent developments in computer chess. Firbush News 7 Edinburgh: Machine Intelligence Research Unit, University of Edinburgh (ed. Donald Michie), pdf
Ivan Bratko, Danny Kopec, Donald Michie (1978). Pattern-Based Representation of Chess Endgame Knowledge. The Computer Journal, Vol. 21, No. 2, pp. 149-153. pdf
Danny Kopec (1979). Rook v knight by Computer. Research Memorandom MIP-R-125, Machine Intelligence Research Unit, University of Edinburgh. Also published in Chess (1983). Vol. 47, Nos. 895-896, pp. 288-295. Sutton Coldfield, England. pdf

1980 ...

Danny Kopec, Tim Niblett (1980). How Hard is the Play of the King-Rook-King-Knight Ending? Advances in Computer Chess 2, pdf
Ivan Bratko, Danny Kopec (1982). A Test for Comparison of Human and Computer Performance in Chess. Advances in Computer Chess 3, pdf
Danny Kopec, Ivan Bratko (1982). The Bratko-Kopec experiment: a comparison of human and computer performance in chess. Advances in Computer Chess 3
Danny Kopec, Donald Michie (1983). Mismatch between machine representations and human concepts: dangers and remedies. FAST series No. 9 report. European Community, Brussels. pdf
Danny Kopec, Enrique Irazoqui, Ivan Bratko (1983). The Updated Bratko-Kopec Test. Computer Chess Digest Annual pp. 45-63
Danny Kopec (1983). Human and Machine Representations of Knowledge. Ph.D. thesis, University of Edinburgh, supervisor: Donald Michie
Danny Kopec (1984). Report from New York - The 4th World Computer Chess Championship. Computer Chess Digest Annual 1984 » WCCC 1983
Danny Kopec (1984). The Canadian Computer Chess Invitational Championship (CCCIC) 1984. ICCA Journal, Vol. 7, No. 3
Danny Kopec, Monroe Newborn (1985). ACM's Fifteenth North American Computer Chess Championship. Communications of the ACM, Vol. 28, No. 7, reprinted in The Sixteenth ACM North American Computer Chess Championship, Denver Colorado, October 13-15, 1985, pdf from The Computer History Museum
Danny Kopec (1985). Chess Computers - A critical descriptive Analysis of the currently available commercial Chess Computers. Abacus Vol. 2 No. 4, Editor-shortened version as pdf, pdf » Super Constellation, Elite
Danny Kopec, Monroe Newborn, Winston Yu (1986). Experiments in Chess Cognition. Advances in Computer Chess 4, pdf
Danny Kopec, Monty Newborn (1986). Belle and Mephisto Dallas Capture Computer Chess Title at the FJCC. reprinted in The ACM's Eighteenth North American Computer Chess Championship from The Computer History Museum, pdf
Monty Newborn, Danny Kopec (1988). Results of ACM's Eighteenth Computer Chess Championship. Communications of the ACM, Vol. 31, No. 8, pdf
Danny Kopec, Mike Valvo (1988). Report on The ACM 19th North American Computer-Chess Championship. ICCA Journal, Vol. 11, No. 4 » ACM 1988
Danny Kopec, Ed Northam, David Podber, Yehya Fouda (1989). The Role of Connectivity in Chess. Workshop on New Directions in Game-Tree Search, pdf
Monty Newborn, Danny Kopec (1989). Results of The Nineteenth ACM North American Computer Chess Championship. Communications of the ACM, Vol. 32, No. 10, pdf, reprinted in The Twentieth ACM North American Computer Chess Championship from The Computer History Museum, pdf

1990 ...

Danny Kopec (1990). Advances in Man-Machine Play. Computers, Chess, and Cognition, pp. 9-32, pdf
Monroe Newborn, Danny Kopec (1990). The Twentieth ACM North American Computer Chess Championship. in The 21st Annual ACM North American Computer Chess Championship from The Computer History Museum, pdf » ACM 1989
Monty Newborn, Danny Kopec (1991). The 21st ACM North American Computer Chess Championship. Communications of the ACM, Vol. 34, No. 11, online » ACM 1990
Hans Berliner, Danny Kopec, Ed Northam (1991). A taxonomy of concepts for evaluating chess strength: examples from two difficult categories. Advances in Computer Chess 6, pdf
Danny Kopec, Monroe Newborn, Michael Valvo (1992). The 22d Annual ACM International Chess Championship. in The 23rd ACM International Computer Chess Championship from The Computer History Museum, pdf » ACM 1991
Danny Kopec, Michael Valvo (1993). The 23rd ACM International Computer-Chess Championship. ICCA Journal, Vol. 16, No. 1 » ACM 1993
Shawn Benn, Danny Kopec (1993). The Bratko-Kopec Test Recalibrated. ICCA Journal, Vol. 16, No. 3, pdf ^[17]
Christopher Chabris, Danny Kopec (1993). The 4th Harvard Cup Human versus Computer Chess Challange. ICCA Journal, Vol. 16, No. 4 » Harvard Cup 1993
Danny Kopec, Monroe Newborn, Michael Valvo (1994). The 23rd ACM NACCC in Indianapolis. in The 24th ACM International Computer Chess Championship from The Computer History Museum, pdf » ACM 1993
Danny Kopec (1994). The Fifth Harvard Cup Human Versus Computer Intel Chess Challenge. pdf
Christopher Chabris, Danny Kopec (1994). Report on the Fifth Harvard Cup Human versus Computer Intel Chess Challenge. ICCA Journal, Vol. 17, No. 4 » Harvard Cup 1994
Danny Kopec, Hal Terrie (1998). Test, Evaluate, and Improve your Chess. 1st Edition

2000 ...

Danny Kopec, Hal Terrie (2003). Test, Evaluate, and Improve your Chess. 2nd Edition
Danny Kopec, Daniel Cox, Tony Marsland (2004). Chapter 63: Search. in The Computer Science and Engineering Handbook, 2nd Edition, Allen B. Tucker (editor), CRC Press, 2004, 63-1 to 63-26. pdf (Draft 2003)
Jill Cirasella, Danny Kopec (2006). The History of Computer Games. pdf

2010 ...

Stephen Lucci, Danny Kopec (2011). Artificial Intelligence in the 21st Century. Mercury Learning and Information
Danny Kopec, Hal Terrie (2013). Test, Evaluate, and Improve your Chess: A Knowledge-Based Approach. 3rd Edition, CreateSpace Independent Publishing Platform, Barnes & Noble, NIC, Schach Niggemann
Danny Kopec, Shweta Shetty, Christopher Pileggi (2014). Artificial Intelligence Problems and Their Solutions. Mercury Learning and Information

External Links

Danny Kopec from Wikipedia
Kopec Chess Services
About International Master Dr. Danny Kopec
Danny Kopec's Academic Resume (Brooklyn College)
The Kopec System KidsChess
Test, Evaluate and Improve Your Chess, a Knowledge-Based Approach by IM Danny Kopec and Hal Terrie
Danny Kopec - How to Visualize Chess Combinations Promo, YouTube Video » Tactics, Combination, Strategy

References

^ International Master Danny Kopec, 1954-2016 - US Chess by Frank Niro, June 22, 2016
^ Dr. Danny Kopec Associate Professor Brooklyn College
^ The 21st Annual ACM North American Computer Chess Championship 1990, pdf from The Computer History Museum
^ Danny Kopec - Summary of Qualifications and Education 1991; Developer of Opening Book for Sargon V chess computer as Consultant for Mediagenic Inc., Menlo Park, California.
^ Danny Kopec. (1977). Recent developments in computer chess. Firbush News 7 Edinburgh: Machine Intelligence Research Unit, University of Edinburgh (ed. D. Michie), pdf
^ 4th North American CC Championship, Aug. 1973, Atlanta USA from CSVN Computerschaak Computer Chess History Pages
^ Danny Kopec - Summary of Qualifications and Education
^ The Kopec Chess Services - The Bratko-Kopec Test
^ Sanny: Some test positions for you post in rec.games.chess.misc August 18, 2008
^ International Master Danny Kopec, 1954-2016 - US Chess by Frank Niro, June 22, 2016
^ Danny Kopec - Brooklyn College - RateMyProfessors.com
^ About International Master Dr. Danny Kopec
^ I remember Donald Michie (1923 – 2007) « A Programmers Place by Maarten van Emden, June 12, 2009
^ ICGA Reference Database (pdf)
^ Publications
^ Publications prior to the year 2000
^ Revised version of the paper Comparison and Testing of Six Commercial Computer Chess Programs, presented at the WCCC 1992 - Workshop: The Impact of Computer Chess on AI Research by Tony Marsland

What links here?

Page	Date Edited
ACM 1982	Jul 19, 2016
ACM 1984	Jul 19, 2016
ACM 1985	Jun 21, 2017
ACM 1986	Dec 5, 2017
ACM 1987	Dec 5, 2017
ACM 1988	Dec 5, 2017
ACM 1989	Jun 7, 2016
ACM 1990	Jun 7, 2016
ACM 1991	Nov 25, 2017
ACM 1993	Oct 30, 2017
Advances in Computer Chess 2	Dec 25, 2017
Advances in Computer Chess 3	Jul 23, 2015
Advances in Computer Chess 4	Jan 22, 2018
Advances in Computer Chess 6	Dec 17, 2016
Alen Shapiro	May 3, 2015
Alvin M. Despain	Feb 17, 2015
Artificial Intelligence	Apr 9, 2018
BCP	Dec 30, 2015
Bebe	Dec 23, 2017
Berkeley Chess Microprocessor	May 22, 2013
Bratko-Kopec Test	Jun 1, 2015
Canadian Computer Chess Invitational Championship 1984	Mar 2, 2013
Cartoons	Dec 1, 2017
Chess Challenger	Dec 27, 2017
Chess Monster	Jun 21, 2017
ChipTest	Jun 19, 2016
Christopher Chabris	Aug 15, 2015
Chunking	Jun 12, 2017
Claude Jarry	Jan 7, 2016
Cognition	Dec 8, 2017
Combination	Oct 25, 2016
Computer Chess Reports	May 15, 2016
Computers, Chess, and Cognition	Dec 28, 2016
Connectivity	Mar 6, 2016
Danny Kopec	Oct 1, 2016
Dart	Jan 19, 2018
Dartmouth College	Dec 16, 2016
Dartmouth CP	Jan 19, 2018
David Podber	Jan 5, 2015
Dedicated Chess Computers	Feb 20, 2018
Delicate Brute	Jun 7, 2016
Donald Michie	Dec 23, 2017
Ed Northam	Sep 4, 2016
Elite	Oct 1, 2016
Endgame	Sep 18, 2017
Enrique Irazoqui	Nov 22, 2014
Evaluation	Feb 1, 2018
Fidelity	Jan 7, 2016
Fidelity Electronics	Dec 1, 2017
Games	Feb 20, 2018
Gerlach van Beinum	Mar 21, 2013
Hal Terrie	Feb 19, 2015
Hans Berliner	Jun 10, 2017
Harvard Cup 1993	Nov 8, 2016
Harvard Cup 1994	Apr 21, 2014
History	Jan 2, 2018
ICGA Journal	Dec 21, 2017
Ira Baxter	Dec 22, 2017
Ivan Bratko	Aug 16, 2017
Jacques Middlecoff	Jun 21, 2017
James Testa	Feb 17, 2015
Jan Derksen	Apr 1, 2016
Jill Cirasella	Apr 16, 2015
John Poduska, Jr.	Aug 2, 2016
Knowledge	Jul 22, 2017
L'Excentrique	Jan 7, 2016
Larry Harris	Apr 3, 2013
Levy versus Deep Thought 1989	Jun 2, 2015
Maarten van Emden	May 23, 2016
Marius Olafsson	Jan 9, 2016
Match Statistics	Mar 31, 2018
Mathematician	Apr 9, 2018
Mephisto Dallas	Sep 1, 2017
Michael Valvo	Feb 26, 2018
Monroe Newborn	Dec 23, 2017
Nuchess	Apr 3, 2017
Patsoc	Jan 7, 2016
Pattern Recognition	Sep 8, 2017
Pawn Structure	Oct 2, 2017
People	Feb 28, 2018
Philidor	Jan 7, 2016
Pion	May 22, 2016
Playing Strength	Mar 31, 2018
SD Chess	Dec 22, 2017
Shawn Benn	Jan 2, 2015
Shy	Jul 19, 2016
StarTech	Oct 20, 2016
Strategy	Jan 18, 2018
Super Constellation	Oct 1, 2016
Tactics	Jan 12, 2018
Test-Positions	Feb 25, 2018
Tim Niblett	May 22, 2014
Timeline	Jan 3, 2018
Tony Marsland	Nov 27, 2017
University of Edinburgh	Nov 26, 2017
WCCC 1980	Dec 25, 2017
WCCC 1983	Jan 20, 2018
WCCC 1989	Dec 5, 2017
WCCC 1992	Feb 26, 2018
WMCCC 1986	Jan 7, 2016
Xenarbor	Sep 6, 2014
Yehya Fouda	Jan 5, 2015
Zerker	Jun 9, 2016

Up one level

Dennis Breuker

GerdIsenberg — Tue, 20 Dec 2016 06:46:53 GMT

Home * People * Dennis Breuker

		Dennis M. Breuker, a Dutch computer and games scientist. He made his M.Sc. at the Computer Science Department of the Leiden University and his Ph.D. at the Computer Science Department of the Maastricht University, where he was author and co-author of various papers with focus on search algorithms, the utilization of the Transposition Table and Graph History Interaction (GHI). Memory versus Search in Games is the title of his Ph.D. thesis ^[1] , a recommended reading for every chess programmer.
Dennis Breuker

Programs

Selected Publications

Programs

Dennis is author of the chess program Duck, already written during his studies in Leiden, with later improvements when he was in Maastricht. As co-author of the Othello program Aida, Dennis Breuker won the silver medal during the 4th Computer Olympiad 1992 in London ^[2] . A further chess program by Dennis Breuker, AliBaba, was written for testing various hashing algorithms - with the permission of the author, a modified version is available from Dann Corbit's site ^[3] and was adopted to WinBoard by Jim Ablett ^[4] .

Selected Publications

^[5]

1992 ...

Dennis Breuker, Victor Allis, Jaap van den Herik, Bob Herschberg (1992). A Database as a Second. ICCA Journal, Vol. 15, No. 1
Dennis Breuker, Jacco Gnodde (1992). The AST 4th Computer Olympiad. ICCA Journal, Vol. 15, No. 3 » 4th Computer Olympiad
Dennis Breuker, Jos Uiterwijk (1992). The 12th Dutch Computer-Chess Championship. ICCA Journal, Vol. 15, No. 4 » DOCCC 1992
Dennis Breuker, Victor Allis, Jaap van den Herik (1994). How to Mate: Applying Proof-Number Search. Advances in Computer Chess 7, reprint as Mate in 38: Applying Proof-Number Search from Ed Schröder's Programmer's Stuff site
Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (1994). Replacement Schemes for Transposition Tables. ICCA Journal, Vol. 17, No. 4
Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (1996). Replacement Schemes and Two-Level Tables. ICCA Journal, Vol. 19, No. 3
Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (1997). Information in Transposition Tables. Advances in Computer Chess 8
Dennis Breuker (1998). Memory versus Search in Games. Ph.D. thesis, Maastricht University, pdf via Dennis Breuker's page
Dap Hartmann (1998). Dennis Breuker: Memory versus Search in Games. ICCA Journal, Vol. 21, No. 4
Dennis Breuker, Jaap van den Herik, Jos Uiterwijk, Victor Allis (1998). A Solution to the GHI Problem for Best-First Search. CG 1998

2000 ...

Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (2000). Solving 8 × 8 Domineering. Theoretical Computer Science, Vol. 230, pp. 195-206. ISSN 0304-3975.
Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (2001). The PN2-Search Algorithm. Advances in Computer Games 9
Dennis Breuker, Jaap van den Herik, Jos Uiterwijk, Victor Allis (2001). A Solution to the GHI Problem for Best-First Search. Theoretical Computer Science, Vol. 252, Nos. 1-2, pp. 121-149.

External Links

References

^ Dennis Breuker (1998). Memory versus Search in Games. Ph.D. thesis, Maastricht University, pdf via Dennis Breuker's page
^ Dennis Breuker's ICGA Tournaments
^ cap.connx.com - /Alibaba/
^ Alibaba (Dennis Breuker - 1995) with winboard support by Jim Ablett, CCC, December 31, 2008
^ ICGA Reference Database (pdf)

What links here?

Page	Date Edited
3rd Computer Olympiad	Jul 25, 2017
4th Computer Olympiad	Jul 15, 2017
Advances in Computer Chess 7	Oct 28, 2014
Advances in Computer Chess 8	Jun 26, 2017
Advances in Computer Games 9	Nov 15, 2016
AliBaba	Aug 17, 2014
Ares	Jun 9, 2016
Bob Herschberg	Dec 13, 2016
CG 1998	May 28, 2015
Chessmate	Dec 12, 2016
Dennis Breuker	Dec 19, 2016
DOCCC 1992	Dec 12, 2016
DOCCC 2000	Aug 15, 2015
Duck	Dec 12, 2016
Eugene Nalimov	Dec 23, 2016
Graph History Interaction	Oct 16, 2017
Hash Table	Jan 1, 2018
Hector	Nov 11, 2016
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Jos Uiterwijk	Aug 11, 2017
Leiden University	Jul 5, 2016
Maastricht University	May 15, 2017
Mate Search	Oct 22, 2016
Mathematician	Apr 9, 2018
Memory	Dec 8, 2017
Move Generation	Jan 29, 2018
Nalimov Tablebases	Dec 23, 2016
NegaScout	Jul 6, 2016
Othello	Jan 4, 2018
People	Feb 28, 2018
Principal Variation Search	Oct 22, 2017
Proof-number search	Jan 22, 2018
Rajah	Sep 12, 2012
Recommended Reading	Nov 17, 2017
Repetitions	Jan 16, 2018
Transposition Table	Apr 19, 2018
Uncertainty Cut-Offs	Jul 21, 2015
Victor Allis	Dec 19, 2016
Zobrist Hashing	Jan 22, 2018

Up one level

Don Beal

GerdIsenberg — Thu, 27 Jul 2017 18:44:15 GMT

Home * People * Don Beal

		Donald Francis (Don) Beal, a British computer scientist and computer games researcher, Emeritus staff from the Queen Mary and Westfield College of London, Department of Computer Science ^[1]. Don Beal researched and published on various computer chess related topics, for instance search pathology, null move quiescence search, integrated bounds and values, temporal difference learning and retrograde analysis. Selected publications were summarized in his Ph.D. thesis The Nature of MINIMAX Search ^[2] , he was author and co-author of several chess programs competing at various CC Tournaments, and was long time board member of the ICCA as Secretary-Treasurer ^[3], contributor of multiple Advances in Computer Chess Conferences, as well as editor of the ACC 4, ACC 5 and ACC 6 conference proceedings. Don Beal advocated and organized Uniform-Platform Computer Chess Championship ^[4], an approach to compare programs without hardware dependence.
Don Beal, WCCC 1986 ^[5]

Photos

Don's Programs

See also

Selected Publications

Photos



Don Beal's BCP still in the assembly stage, 1983 ^[6]

Don Beal, Thompson, Newborn and Botvinnik, WCCC 1983 ^[7]

Don's Programs

Don Beal is author and co-author of following chess programs ^[8] :

and the Lines of Action program:

Apprentice

Selected Publications

^[9] ^[10] ^[11]

1978

Don Beal (1978). Handicapping Computer Chess Programs. ICCA Newsletter, Vol. 1, No. 2

1980 ...

Don Beal, Mike Clarke (1980). The Construction of Economical and Correct Algorithms for King and Pawn against King. Advances in Computer Chess 2
Don Beal (1980). An analysis of minimax in Advances in Computer Chess 2
Don Beal (1982). Benefits of minimax search in Advances in Computer Chess 3
Tony Harrington (1983). Alphabetical Chess. Personal Computer World, June 1983 » BCP
Don Beal (1983). Recent progress in understanding minimax search. in Proceedings of ACM National Conference, New York, October 1983
Don Beal (1984). Mixing Heuristic and Perfect Evaluations: Nested Minimax. ICCA Journal, Vol. 7, No. 1
Don Beal (1984). Mating Sequences in the Quiescence Search. ICCA Journal, Vol. 7, No. 3
Don Beal (1986). Selective Search without Tears. ICCA Journal, Vol. 9, No. 2
Don Beal (1986). Turbo GameWorks: Tools for Turbo Pascal. (Review) ICCA Journal, Vol. 9, No. 2 » Turbo Chess
Don Beal (1989). Experiments with the Null Move. Advances in Computer Chess 5, a revised version is published (1990) under the title A Generalized Quiescence Search Algorithm. Artificial Intelligence, Vol. 43, No. 1, edited version in (1999). The Nature of MINIMAX Search. Ph.D. thesis, Chapter 10
David Levy, Don Beal (Eds.) (1989). Heuristic Programming in Artificial Intelligence - The First Computer Olympiad. Ellis Horwood » 1st Computer Olympiad

1990 ...

Don Beal (1990). A Generalized Quiescence Search Algorithm. Artificial Intelligence, Vol. 43, No. 1
David Levy, Don Beal (Eds.) (1991). Heuristic Programming in Artificial Intelligence - The Second Computer Olympiad. Ellis Horwood » 2nd Computer Olympiad
Don Beal (1991). Report on the 11th World Microcomputer Chess Championship. ICCA Journal, Vol. 14, No. 2 » WMCCC 1991
Don Beal (1991). Report on the 22nd ACM International Computer Chess Championship. ICCA Journal, Vol. 14, No. 4 » ACM 1991
John Roycroft, Don Beal (1991). To Make Dumb Endgame Databases Speak. Advances in Computer Chess 6
Don Beal (1992). The 1992 QMW Uniform-Platform Autoplay Computer-Chess Tournament. ICCA Journal, Vol. 15, No. 3 » UPCCC 1992
Don Beal (1993). Report on the QMW 1993 Uniform-Platform Computer-Chess Championship. ICCA Journal, Vol. 16, No. 3 » UPCCC 1993 ^[12]
Don Beal, Martin C. Smith (1994). Random Evaluations in Chess. ICCA Journal, Vol. 17, No. 1
Don Beal, Martin C. Smith (1994). Random Evaluations in Chess. Advances in Computer Chess 7
Don Beal (1994). The QMW's Uniform-Platform Computer-Chess Tournament. ICCA Journal, Vol. 17, No. 1
Don Beal (1994). Report on the QMW Uniform-Platform World Championship 1994. ICCA Journal, Vol. 17, No. 3 » UPCCC 1994
Don Beal (1995). An Integrated-Bounds-and-Values (IBV) Numeric Scale for Minimax Searches. ICCA Journal, Vol. 18, No. 2 » Integrated Bounds and Values
Hin-Kwok Tsang and Don Beal (1995). The 8th World Computer-Chess Championship. ICCA Journal, Vol. 18, No. 2 » WCCC 1995
Don Beal, Martin C. Smith (1995). Quantification of Search-Extension Benefits. ICCA Journal, Vol. 18, No. 4
Don Beal, Martin C. Smith (1996). Multiple Probes of Transposition Tables. ICCA Journal, Vol. 19, No. 4
Don Beal, Martin C. Smith (1997). Learning Piece Values Using Temporal Differences. ICCA Journal, Vol. 20, No. 3
Don Beal, Martin C. Smith (1998). First Results from Using Temporal Difference Learning in Shogi. CG 1998
Don Beal (1999). The 9th World Computer-Chess Championship: the Search-Engine Features of the Programs. ICCA Journal, Vol. 22, No. 3 » WCCC 1999
Don Beal, Martin C. Smith (1999). Learning Piece-Square Values using Temporal Differences. ICCA Journal, Vol. 22, No. 4
Don Beal, Martin C. Smith (1999). Temporal Coherence and Prediction Decay in TD Learning. IJCAI 1999, pdf
Don Beal (1999). The Nature of MINIMAX Search. Ph.D. thesis, IKAT, Maastricht University, pdf

2000 ...

Don Beal, Martin C. Smith (2001). Temporal difference learning applied to game playing and the results of application to Shogi. Theoretical Computer Science, Vol. 252, Nos. 1-2
Ren Wu, Don Beal (2001). Computer Analysis of some Chinese Chess Endgames. Advances in Computer Games 9
Ren Wu, Don Beal (2001). Fast, Memory-efficient Retrograde Algorithms.ICGA Journal, Vol. 24, No. 3 ^[13] ^[14]
Ren Wu, Don Beal (2001). Parallel Retrograde Analysis on Different Architectures. in IEEE 10th Conference in High Performance Distributed Computing, August 2001
Ren Wu, Don Beal (2001). Solving Chinese Chess Endgames by Database Construction. Information Sciences, Vol. 135, Nos. 3-4
Don Beal (2002). Learn from your opponent - but what if he/she/it knows less than you? in Jean Retschitzki, Rosita Haddad-Zubel (eds.) Step by Step.
Ren Wu, Don Beal (2002). A memory efficient retrograde algorithm and its application to solve Chinese Chess endgames. in Richard J. Nowakowski (ed.) More Games of No Chance
Don Beal (2006). Review of a nullmove-quiescence search mechanism from 1986. (Draft) ^[15]

Forum Posts

computer chess tournament by Don Beal, rec.games.chess, May 15, 1992
QMW uniform-platform computer chess tournament by Don Beal, rec.games.chess, August 18, 1992 » UPCCC 1992
QMW computer chess by Don Beal, rec.games.chess, August 19, 1993 » UPCCC 1993
Re: Human VS computer by Don Beal, rec.games.chess, July 11, 1994 » Search with Random Leaf Values
World Computer Chess Championship by Don Beal, rec.games.chess, March 16, 1995 » WCCC 1995
ICCA issues by Don Beal, rgcc, January 27, 1997 » ICCA, ICGA
Re: mate threat extension/null move by Don Beal, CCC, October 04, 2004 » Mate Threat Extensions, Null Move and WAC booster
Null move in quiescence search idea from Don Beal, 1986 by Eelco de Groot, CCC, Aug 17, 2009 » Don Beal's Null Move Quiescence Search

External Links

Don Beal's ICGA Tournaments

References

^ School of Electronic Engineering and Computer Science - Honorary, Retired and Visiting Staff
^ Don Beal (1999). The Nature of MINIMAX Search. Ph.D. thesis
^ Jaap van den Herik (2000). From Cognition to Perception. ICGA Journal, Vol. 23, No. 4
^ QMW "Uniform Platform" Computer-Chess Tournament from the old CSVN site
^ László Lindner, A SZÁMÍTÓGÉPES SAKK KÉPEKBEN című melléklete - The pictures of the Beginning of Chess Computers
^ Image by Tony Harrington, from: Tony Harrington (1983). Alphabetical Chess. Personal Computer World, June 1983, pdf hosted by Mike Watters
^ Photo Gift of Monroe Newborn from The Computer History Museum
^ Don Beal's ICGA Tournaments
^ DBLP: Donald F. Beal
^ ICGA Reference Database (pdf)
^ Don Beal's Publications
^ QMW computer chess by Don Beal, rec.games.chess, August 19, 1993
^ Generating egtbs ICGAJ by Tony Werten, CCC, December 04, 2001, with reference to Computing endgames with few men by Urban Koistinen
^ Wu / Beal retrograde analisys algorithm by Alvaro Jose Povoa Cardoso, Winboard Forum, March 10, 2007
^ courtesy of Don Beal and Carey Bloodworth, Re: Antique chess programs by Carey, CCC, December 16, 2015

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
2nd Computer Olympiad	Jul 12, 2017
6th Computer Olympiad	Jul 22, 2017
Josue Forte	Feb 11, 2012
Abyss	Aug 5, 2017
ACM 1991	Nov 25, 2017
Advances in Computer Chess 2	Dec 25, 2017
Advances in Computer Chess 3	Jul 23, 2015
Advances in Computer Chess 4	Jan 22, 2018
Advances in Computer Chess 5	Dec 2, 2017
Advances in Computer Chess 6	Dec 17, 2016
Advances in Computer Chess 7	Oct 28, 2014
Advances in Computer Games 9	Nov 15, 2016
Alvaro Cardoso	Jan 12, 2018
Andy Walker	Dec 9, 2016
Ares	Jun 9, 2016
Automated Tuning	Feb 27, 2018
BCP	Dec 30, 2015
Beal	Dec 28, 2017
Brainstorm	Jun 24, 2017
Capture Extensions	Oct 26, 2012
CCC	Mar 19, 2018
Centaur	Mar 24, 2017
CG 1998	May 28, 2015
Checkmate	Apr 13, 2018
Chinese Chess	Jan 16, 2018
Cilkchess	Jan 21, 2016
Cray Blitz	Dec 25, 2017
Cumulus	Jan 7, 2016
David Levy	Jan 3, 2017
Delicate Brute	Jun 7, 2016
Don Beal	Jul 27, 2017
ECCC 1976	Sep 6, 2017
ECCC 1979	Sep 9, 2017
Échec	Jan 7, 2016
Endgame Bitbases	Apr 5, 2017
Endgame Tablebases	Mar 6, 2018
Eugen	Jan 7, 2016
Evaluation	Feb 1, 2018
Extensions	Apr 19, 2018
Ferret	Jan 7, 2016
Fritz	Feb 26, 2018
Gideon	Feb 26, 2018
GNU Chess	Jan 21, 2018
Harry Nelson	Jul 26, 2017
Hegener & Glaser	Dec 18, 2017
Hiarcs	Feb 25, 2018
Ian Kennedy	Nov 7, 2016
ICCA	Mar 9, 2012
ICGA Journal	Dec 21, 2017
ICGA Journal Awards to Include	May 21, 2015
Innovation	Jun 12, 2016
Integrated Bounds and Values	Jan 13, 2013
International Computer Chess Tournament 1984	Dec 21, 2017
John Roycroft	Apr 24, 2016
Jos Uiterwijk	Aug 11, 2017
Josué Forte	Mar 23, 2014
Kaare Danielsen	Feb 19, 2017
Ken Thompson	Sep 8, 2017
KPK	May 12, 2016
Learning	Feb 20, 2018
Martin C. Smith	May 23, 2016
Massachusetts Institute of Technology	Jan 24, 2017
Mate Threat Extensions	Apr 14, 2012
Material	Mar 31, 2018
Mathematician	Apr 9, 2018
Matheus	Oct 21, 2014
Matt Craighead	Nov 30, 2014
Max Bramer	May 20, 2014
MChess	Feb 26, 2018
Mephisto Best-Publication Awards to Include	Dec 8, 2016
Michael Gherrity	May 8, 2015
Mike Clarke	May 23, 2016
Mikhail Botvinnik	Jul 15, 2017
Minimax	Dec 29, 2017
Mirage	Jul 12, 2016
Monroe Newborn	Dec 23, 2017
Move Ordering	Feb 27, 2018
NegaC*	Dec 17, 2016
Neptune	Nov 11, 2016
Neural Networks	Mar 12, 2018
NotChess	Nov 1, 2016
Now	Jan 7, 2016
Null Move Observation	Dec 30, 2015
Null Move Pruning	Dec 2, 2017
Othello	Jan 4, 2018
Pascal	Nov 28, 2016
Patzer (K)	Jul 18, 2012
Pawnder	Feb 8, 2012
People	Feb 28, 2018
Personal Computer World	Apr 12, 2013
Phoenix	May 8, 2017
Piece-Square Tables	Mar 31, 2018
Playing Strength	Mar 31, 2018
Point Value	Mar 31, 2018
Prochess	Jan 7, 2016
Pseudorandom number generator	May 11, 2017
Psycho	Nov 7, 2016
Queen Mary, University of London	Jul 12, 2017
Quest	Mar 26, 2017
Quiescence Search	Aug 19, 2017
Ren Wu	Jul 23, 2017
Retrograde Analysis	Mar 21, 2017
Reverse Futility Pruning	Jun 2, 2017
Robert Hyatt	Dec 25, 2017
Ronald de Man	Nov 20, 2017
SAL	Dec 7, 2017
Schach	Jan 7, 2016
Score	Apr 14, 2018
Search Pathology	Nov 26, 2017
Search with Random Leaf Values	Apr 23, 2018
Selectivity	Jan 12, 2018
Shogi	Feb 19, 2018
SOS	Apr 5, 2017
Tapered Eval	Jan 9, 2018
Temporal Difference Learning	Feb 20, 2018
The King	Jan 21, 2018
Tom Pronk	Jan 7, 2016
Tony Harrington	Sep 26, 2014
Transposition Table	Apr 19, 2018
Turbo Chess	Feb 19, 2017
Uniform-Platform Computer Chess Championship	Mar 25, 2011
University of Alberta	Feb 20, 2018
UPCCC 1992	Mar 9, 2012
UPCCC 1993	Mar 6, 2015
UPCCC 1994	Mar 9, 2012
Urban Koistinen	Apr 20, 2014
WCCC 1974	Jan 19, 2018
WCCC 1977	Dec 22, 2017
WCCC 1980	Dec 25, 2017
WCCC 1983	Jan 20, 2018
WCCC 1986	Jul 27, 2017
WCCC 1992	Feb 26, 2018
WCCC 1995	Jul 12, 2017
WCCC 1999	Jul 13, 2017
Werner Koch	Jan 8, 2016
Win at Chess	Sep 25, 2017
WMCCC 1991	Sep 18, 2016

Up one level

Donald Michie

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

Home * People * Donald Michie

		Donald Michie, (November 11, 1923 – July 7, 2007 ^[1] ^[2] ^[3] ) was a British researcher and pioneer in artificial intelligence and game theory. During World War II, Michie worked with Alan Turing at Bletchley Park, with Jack Good and Shaun Wylie et al. in the section Newmanry headed by Max Newman, contributing to crack the German Lorenz cipher ^[4] ^[5]. In 1947-48, along with Wylie, Michie designed Machiavelli, a rival of Turing's Turochamp program ^[6] ^[7]. Michie was head of the University of Edinburgh's Department of Machine Intelligence from 1965 until 1985 ^[8] , when he left to found the Turing Institute in Glasgow ^[9]. Michie researched on game theory and computer games and chess. He was a close friend of David Levy and involved in the famous Levy Bet with John McCarthy, which occurred during an AI-workshop in Edinburgh ^[10] , where Michie affirmed McCarthy to take the challenge by David Levy and even want to share the bet on McCarthy's site ^[11] .
Donald Michie ^[12]

Selected Publications

Photos



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

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

Machine Learning

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

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

The Need for Search

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

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

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

Chess Endgames

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

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

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

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

Solving Chess?

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

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

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

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

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

AI as Sport

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

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

Selected Publications

^[33] ^[34]

1945

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

1960 ...

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

1970 ...

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

1980 ...

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

1990 ...

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

External Links

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

References

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

What links here?

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

Up one level

Hans Berliner

GerdIsenberg — Sat, 10 Jun 2017 22:17:34 GMT

Home * People * Hans Berliner

		Hans Jack Berliner, (January 27, 1929 - January 13, 2017) was a German born, American Computer Scientist and Professor Emeritus from Carnegie Mellon University ^[1], Pittsburgh, Pennsylvania. Hans Berliner was Grandmaster of Correspondence Chess, International Master for over-the-board chess and was Correspondence Chess World Champion from 1965 until 1968. Hans Berliner made his Ph.D. Thesis in 1974 at Carnegie Mellon about computer chess: Chess as Problem Solving: The Development of a Tactics Analyser ^[2] under the supervision of Allen Newell. Berliner contributed as co-author to the Technology Chess Program. He was author of the chess programs J. Biit, CAPS, Patsoc, along with Murray Campbell co-author of the chunking pawn endgame program Chunker, and lead the team in developing the HiTech chess entity - namely Carl Ebeling, Murray Campbell, Gordon Goetsch and Chris McConnell. Beside other things, Hans Berliner's research was about pattern knowledge and creation and implementation of the best-first tree search algorithm called B* ^[3], also used in HiTech.
Hans Berliner ^[4]

Pages with Berliner Quotes

See also

Selected Publications

Chess Programs

BKG 9.8

In the late 70s at Carnegie Mellon University, Hans Berliner developed the Backgammon playing program BKG 9.8 for the PDP-10 to research the principles of evaluation for another game than chess with a much higher branching factor of more than 800 at every node ^[5]. Early versions of BKG played badly even against weak players, but Berliner noticed that its critical mistakes were always at transitions apparently due to evaluation discontinuity. He applied principles of fuzzy logic to smooth out the transition between phases, and by July 1979, BKG 9.8 was strong enough to play against the ruling world champion Luigi Villa. It won the match 7–1, becoming the first computer program to defeat a world champion in any game. Berliner states that the victory was largely a matter of luck, as the computer received more favorable dice rolls ^[6] ^[7].

Photos



Hans Berliner and Carl Ebeling, developers of HiTech at Carnegie Mellon University ^[8]

Cray Blitz vs. HiTech, WCCC 1986 ^[9]

Quotes

James Gillogly

Quote by James Gillogly on Berliner's Technology Program contribution ^[10]:

Acknowledgements: I am indebted to Hans Berliner, World Correspondence Chess Champion, who developed the elegant techniques used in the positional analysis, and whose patient discussion helped to clarify many of the conceptional problems. The basic idea of the Technology Program is due in large part to Allen Newell.

Alex Bell

Quote by Alex Bell from his report on Advances in Computer Chess 1 ^[11]:

A number of experts were invited to give papers. on their work, including Dr Mikhail Donskoy of the USSR, one of the authors of the world champion program, KAISSA. Unfortunately Donskoy was unable to attend, a disappointment only mitigated by the presence from the US of Dr Hans Berliner, of Carnegie-Mellon. Berliner is the world correspondence chess champion and has also spent the last eight or nine years programming computers to play the game. To most people in the practical, model building side of the subject, ie making a program play the computer game, Berliner is THE expert. Although full of good, implementable ideas he has no illusions as to the limitations of such chess programs.
--
The conference itself lasted one and a half days and the papers (depending on the listener) ranged from the profound to the puerile. I have no desire to repeat my own personal views, indeed as one of the organisers I helped to provide a platform for speakers whose views I found astonishing. What did seem evident to me was that the majority of the audience fell into one of three categories. One group is the artificial intelligentsia. They fully understand the difficulties of the problem and are still thinking about how to solve it. The second group are the let's get on and program something crunchers, the model makers, the people who can make big computers float round the room whistling God save the Queen. These people absolutely refuse to put anything remotely resembling knowledge, chess or otherwise, into their programs if they can avoid it, believing that if the result plays good chess then it can be more easily adapted to attempt other, more useful, decision making problems. The third group is the most important, these are the people who are new to the subject, the people who say, It sounds like a fascinating problem and I'd like to know what's going on.

Hans Berliner fits into two of these categories, his talk covered the AI approach and the crunchers, but he is hardly a newcomer. He was the first speaker and the domain of his talk was chess tactics with emphasis on recognising situations and dealing with them explicitly. He is full of good ideas and techniques which are relevant to the problem of selecting the right move in a game of chess and, more important, showed clearly how each idea and technique could be implemented in a computer.

Hans Berliner

Hans Berliner about his role in the HiTech team ^[12]:

I have been responsible for doing the pattern knowledge and most of the opening book, and acting as moderator for the many fine discussions that we have about how to improve HiTech in the various areas that need work.

Pages with Berliner Quotes

1. CAPS
2. Hans Berliner
3. HiTech
4. J. Biit

Selected Publications

^[13] ^[14]

1970 ...

Hans Berliner (1970). Experiences Gained in Constructing and Testing a Chess Program. IEEE Symposium System Science and Cybernetics, reprinted in David Levy (ed.) (1988). Computer Games I.
Hans Berliner (1973). Some Necessary Conditions for a Master Chess Program. IJCAI 1973
Hans Berliner (1974). Chess as Problem Solving: The Development of a Tactics Analyser. Ph.D. thesis, Carnegie Mellon University
Hans Berliner (1977). A Representation and Some Mechanisms for a Problem-Solving Chess Program. Advances in Computer Chess 1
Hans Berliner (1977). BKG - A Program that Plays Backgammon. Technical Report, Carnegie Mellon University, reprinted in David Levy (ed.) (1988). Computer Games I.
Hans Berliner (1977). Experiences in Evaluation with BKG, a Program That Plays Backgammon. IJCAI 1977, hosted by Backgammon Galore
Hans Berliner, Richard Greenblatt, Jacques Pitrat, Arthur Samuel, David Slate (1977). Panel on Computer Game Playing. IJCAI 1977, pdf
Crispin Perdue, Hans Berliner (1977). EG: a case study in problem solving with king and pawn endings. IJCAI 1977
Hans Berliner (1977). The B* Tree Search Procedure: Best-first Search Combined with Branch and Bound. Computer Science Department. Carnegie Mellon University
Hans Berliner (1978). A Chronology of Computer Chess and its Literature. Artificial Intelligence, No. 10, pp. 201–214.
Hans Berliner (1979). The B*-Tree Search Algorithm - A Best-First Proof Procedure. Artificial Intelligence, Vol. 12, No. 1, pp. 23-40. ISSN 0004-3702.
Hans Berliner (1979). On the Construction of Evaluation Functions for Large Domains. IJCAI 1979, Vol. 1, hosted by Backgammon Galore

1980 ...

Hans Berliner (1980). Backgammon Computer Program Beats World Champion. Artificial Intelligence, Vol. 14, hosted by Backgammon Galore, reprinted in David Levy (ed.) (1988). Computer Games I.
Hans Berliner (1980). Computer Backgammon. Scientific American, Vol. 242, No. 6, hosted by Backgammon Galore
Hans Berliner (1981). An Examination of Brute Force Intelligence. IJCAI 1981
Hans Berliner (1982). Search vs. knowledge: an analysis from the domain of games. Technical Report Department of Computer Science, Carnegie Mellon University
Hans Berliner (1983). Search. Artificial Intelligence Syllabus, Department of Computer Science, Carnegie Mellon University
Murray Campbell, Hans Berliner (1983). A Chess Program That Chunks. AAAI 1983 49-53, pdf
Hans Berliner (1984). Search vs. knowledge: An analysis from the domain of games. In A. Elithorn and R. Banerji (Eds.), Artificial and Human Intelligence (pp. 105-117). New York, NY: Elsevier.
Hans Berliner, Murray Campbell (1984). Using Chunking to Solve Chess Pawn Endgames. Artificial Intelligence, Vol. 23, No. 1, pp. 97-120. ISSN 0004-3702.
Hans Berliner, Gordon Goetsch (1984). A quantitative study of search methods and the effect of constraint satisfaction, Tech. Rept. CMU-CS-84-147, Department of Computer Science, Carnegie Mellon University
Hans Berliner, Gordon Goetsch (1985). A Study of Search Methods: The Effect of Constraint Satisfaction and Adventurousness. IJCAI 1985, pdf
Hans Berliner (1985). Computer Chess at Carnegie Mellon University. Advances in Computer Chess 4
Hans Berliner (1985). Goals, Plans, and Mechanisms: Non-symbolically in an Evaluation Surface. Presentation at Evolution, Games, and Learning, Center for Nonlinear Studies, Los Alamos National Laboratory, May 21.
Hans Berliner (1985). HiTech wins North American Computer-Chess Championship. ICCA Journal, Vol. 8, No. 4 » ACM 1985
Hans Berliner (1985). The 1985 Fredkin Competition. ICCA Journal, Vol. 8, No. 4
Hans Berliner, Carl Ebeling (1986). The SUPREM Architecture: a new Intelligent Paradigm. Artificial Intelligence, Vol. 28, No. 1, pp. 3-8.
Hans Berliner (1987). Some Innovations Introduced by Hitech. ICCA Journal, Vol. 10, No. 3
Hans Berliner (1988). Pennsyvania State Chess Championship - HiTech Becomes First Computer Senior Master. AI Magazine Volume 9 Number 3 (© AAAI), pdf
Hans Berliner (1989). What is still needed in Game Tree Search. Workshop on New Directions in Game-Tree Search
Hans Berliner (1989). Some Innovations Introduced by Hitech. Advances in Computer Chess 5
Hans Berliner, Gordon Goetsch, Murray Campbell, Carl Ebeling (1989). Measuring the Performance Potential of Chess Programs. Advances in Computer Chess 5
Hans Berliner (1989). The Human versus Computer Match 1989. ICCA Journal, Vol. 12, No. 3 » Aegon 1989
Hans Berliner (1989). Deep Thought Wins Fredkin Intermediate Prize. AI Magazine Volume 10 Number 2, pdf
Hans Berliner, Carl Ebeling (1989). Pattern Knowledge and Search: The SUPREM Architecture. Artificial Intelligence, Vol. 38, No. 2, pp. 161-198. ISSN 0004-3702.
Revised as Hans Berliner, Carl Ebeling (1990). Hitech. Computers, Chess, and Cognition

1990 ...

Hans Berliner, Carl Ebeling (1990). Hitech. Computers, Chess, and Cognition
Hans Berliner, Gordon Goetsch, Murray Campbell, Carl Ebeling (1990). Measuring the Performance Potential of Chess Programs. Artificial Intelligence, Vol. 43, No. 1
Hans Berliner, Danny Kopec, Ed Northam (1991). A taxonomy of concepts for evaluating chess strength: examples from two difficult categories. Advances in Computer Chess 6, pdf
Hans Berliner (1992). Allen Newell 1927-1992, In Memoriam. ICCA Journal, Vol. 15, No. 3
Hans Berliner (1993). Losing the Human Edge. BYTE, May, p. 282.
Hans Berliner (1993). Playing Computer Chess in the Human Style. ICCA Journal, Vol. 16, No. 3 » CC Sapiens
Critique about Mikhail Botvinnik ^[15] ^[16] ^[17]
Hans Berliner, Chris McConnell (1995). B* Probability Based Search. Carnegie Mellon University, ps
Hans Berliner (1996). Why did Kasparov Blink? ICCA Journal, Vol. 19, No. 2 » Kasparov versus Deep Blue 1996 ^[18]
Hans Berliner, Chris McConnell (1996). B* probability based search. Artificial Intelligence, Vol. 86, No. 1 pp. 97-156. ISSN 0004-3702.
Hans Berliner (1999). The System: A World Champion's Approach to Chess. Gambit Publications, ISBN 1-901983-10-2 ^[19]^[20]^[21]

2000 ...

Hans Berliner (2001). HERBERT A. SIMON (1916-2001): A LIFE'S APPRAISAL. ICCA Journal, Vol. 24, No. 1
Gardner Hendrie (2005). Oral History of Hans Berliner. pdf and video from The Computer History Museum

External Links

Hans Berliner from Wikipedia
World Chess Hall of Fame: Hans Berliner
Hans Berliner from The Computer History Museum
Oral History of Hans Berliner, Interviewed by Gardner Hendrie, March 7, 2005, The Computer History Museum, pdf
Hans Berliner's ICGA tournaments
chessgames.com - games of Hans Berliner
Chess piece value, the Hans Berliner's system from Wikipedia
Hans Berliner, Master Chess Player and Programmer, Dies at 87 by Dylan Loeb McClain, The New York Times, January 16, 2017 ^[22]
Hans Berliner, chess master and programmer, dies at 87 by Frederic Friedel, ChessBase New, January 18, 2017

References

^ Carnegie Mellon, School of Computer Science
^ Hans Berliner (1974). Chess as Problem Solving: The Development of a Tactics Analyser. Ph.D. thesis, Carnegie Mellon University
^ The B* tree search algorithm: A best-first proof procedure from ScienceDirect.com
^ WCCC 1986 Video capture at 24:34 during interview by Albrecht Fölsing at 24:14 before the final game Cray Blitz vs. HiTech
^ Hans Berliner (1977). Experiences in Evaluation with BKG, a Program That Plays Backgammon. IJCAI 1977, hosted by Backgammon Galore
^ Hans Berliner from Wikipedia
^ Hans Berliner (1980). Backgammon Computer Program Beats World Champion. Artificial Intelligence, Vol. 14
^ Cray Blitz vs. HiTech, WCCC 1986, Photo from Historic Pictures by Ed Schröder
^ James Gillogly (1972). The Technology Chess Program. Artificial Intelligence, Vol. 3, pp. 145-163. ISSN 0004-3702. Reprinted (1988) in Computer Chess Compendium
^ 1975 Press Releases - Techniques for playing the end game from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
^ Hans Berliner (1988). Pennsyvania State Chess Championship - HiTech Becomes First Computer Senior Master. AI Magazine Volume 9 Number 3 (© AAAI), pdf
^ DBLP: Hans J. Berliner
^ ICGA Reference Database (pdf)
^ Kasparov missed Beautiful win; Botvinnik's Program muffs analysis by Hans Berliner, rgcc, July 9, 1993
^ Hans Berliner against Mikhail Botvinnik by Alexander Timofeev
^ Berliner paper about Botvinnik by Shane Hudson, rgc, September 10, 1994
^ Why did Kasparov blink? by Tom King, rgcc, March 22, 1999
^ White to play and win - discussion on Berliner's The System from Wikipedia
^ The System: A World Champion's Approach to Chess Reviewed by Jeremy Silman
^ My (the) System discussion on Berliner's The System from rgcc, January 13, 2000
^ Hans Berliner, Master Chess Player and Programmer, Dies at 87 by John E Jack, CCC, January 17, 2017

What links here?

Page	Date Edited
ACM 1970	Jun 13, 2015
ACM 1985	Jun 21, 2017
ACM 1988	Dec 5, 2017
ACM 1989	Jun 7, 2016
ACM 1990	Jun 7, 2016
ACM 1991	Nov 25, 2017
ACM 1993	Oct 30, 2017
Advances in Computer Chess 1	Oct 22, 2015
Advances in Computer Chess 4	Jan 22, 2018
Advances in Computer Chess 5	Dec 2, 2017
Advances in Computer Chess 6	Dec 17, 2016
Aegon 1989	Jan 22, 2017
Aegon 1990	Mar 26, 2017
Aegon 1993	Mar 26, 2017
Alexander Timofeev	Dec 7, 2016
Allen Newell	Jun 12, 2017
Andrew James Palay	Oct 9, 2012
Andrew Koenig	Dec 22, 2017
Andy Gruss	Jun 13, 2015
Aron Eisenpress	Jul 8, 2012
Arthur Samuel	May 29, 2016
Artificial Intelligence	Apr 9, 2018
B*	Nov 27, 2017
Backgammon	Dec 22, 2017
Ben Yalow	Jan 21, 2013
Brute-Force	Jul 27, 2017
CAPS	Dec 23, 2017
Capture Extensions	Oct 26, 2012
Carl Ebeling	May 23, 2016
Carnegie Mellon University	Feb 12, 2018
CC Sapiens	Oct 29, 2014
CCCP (US)	Dec 22, 2017
Chris McConnell	Jan 7, 2016
Chunker	Jul 12, 2016
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Computers, Chess, and Cognition	Dec 28, 2016
Danny Kopec	Oct 1, 2016
David Slate	Jul 19, 2016
Deep Blue	Aug 1, 2017
Deep Thought	Dec 5, 2016
Doubled Pawn	Mar 27, 2017
Ed Northam	Sep 4, 2016
Edward Fredkin	Oct 27, 2013
Evaluation	Feb 1, 2018
Evaluation Discontinuity	Oct 9, 2017
Frederic Friedel	Jan 6, 2018
Games	Feb 20, 2018
Gordon Goetsch	Jan 7, 2016
Hans Berliner	Jun 10, 2017
Harry Nelson	Jul 26, 2017
Herbert Simon	Feb 11, 2016
History	Jan 2, 2018
HiTech	Mar 31, 2018
Horizon Effect	Sep 10, 2017
ICGA Journal	Dec 21, 2017
Iterative Deepening	Jun 23, 2017
J. Biit	Jan 17, 2017
Jacques Pitrat	Aug 7, 2015
James Schuyler	Feb 19, 2012
Kasparov versus Deep Blue 1996	Mar 26, 2017
Kasparov versus Deep Thought 1989	Mar 26, 2017
Kenneth W. Church	Nov 12, 2014
Knowledge	Jul 22, 2017
Larry Slomer	Jun 13, 2015
Learning	Feb 20, 2018
Match Statistics	Mar 31, 2018
Mathematician	Apr 9, 2018
Michael Halbherr	Jun 15, 2015
Mikhail Botvinnik	Jul 15, 2017
Murray Campbell	Jun 2, 2017
NeuroChess	Dec 7, 2017
Nimzo	Dec 30, 2017
Oracle	Sep 4, 2016
Othello	Jan 4, 2018
Patsoc	Jan 7, 2016
Pattern Recognition	Sep 8, 2017
Paul S. Rosenbloom	Jun 13, 2017
Pawn Endgame	Oct 11, 2017
People	Feb 28, 2018
Peter Jansen	Jan 31, 2016
Pioneer	Dec 23, 2017
Planning	Feb 12, 2018
Playing Strength	Mar 31, 2018
Point Value	Mar 31, 2018
Rebel	Feb 25, 2018
Richard Greenblatt	Jan 19, 2016
Richard Karp	Apr 30, 2015
Richard Korf	Dec 29, 2017
Rival	Jul 30, 2017
Robert Blumofe	Jun 15, 2015
Rocinante	Feb 19, 2018
Scientific American	Jun 5, 2017
Search	Feb 1, 2018
StarTech	Oct 20, 2016
Steven M. Bellovin	Dec 14, 2017
Strategy	Jan 18, 2018
Tactics	Jan 12, 2018
Tapered Eval	Jan 9, 2018
Tech	Apr 20, 2018
Walter Faxon	Mar 6, 2015
WCCC 1983	Jan 20, 2018
WCCC 1986	Jul 27, 2017
WCCC 1989	Dec 5, 2017
WCCC 1992	Feb 26, 2018
WCCC 1995	Jul 12, 2017
William Chase	Jan 21, 2016
Yuli Zhou	Jun 15, 2015

Up one level

Helmut Horacek

GerdIsenberg — Mon, 31 Oct 2016 20:53:08 GMT

Home * People * Helmut Horacek

		Helmut Horacek, an Austrian computer scientist, mathematician and AI-researcher with focus on natural language processing affiliated with the German Research Centre for Artificial Intelligence, Saarbrücken ^[1], and Saarland University. During the early 80, along with Hermann Kaindl, Marcus Wagner and Roland Schreier, Helmut Horacek was co-author of the chess program Merlin, competing at various ACM North American Computer Chess Championships and two World Computer Chess Championships in the 80s ^[2]. He is further author of the Pawn Endgame program PawnKing, which was also subject of his Ph.D. thesis, co-supervised by Wilhelm Barth from Vienna University of Technology and Curt Christian from University of Vienna ^[3]. As elaborated in his 1983 paper ^[4], PawnKing relies on pawn- and king-pattern with bitboards as well as path algorithms to guide the search in his knowledge-based move selection and evaluation approach.
Helmut Horacek ^[5]

See also

Selected Publications

Selected Publications

^[6] ^[7]

1980 ...

Helmut Horacek, Marcus Wagner (1981). Das Schachprogramm Merlin, Verbesserung von Laufzeit-Effizient, Eröffnungsbibliothek und Bewertungsfunktion. 4. Tagung "Berichte aus Informatik-Instituten" (German) ^[8]
Helmut Horacek, Marcus Wagner (1982). Das Programm Merlin - Unterschiede zu konventionellen Schachprogrammen. OeGAI Journal, 1982 (German)
Helmut Horacek (1982). Ein Modell für Schachbauernendspiele mit menschlichen Problemlösungstechniken. Ph.D. thesis, Department of Computer Science, University of Vienna, supervisors Curt Christian (University of Vienna) and Wilhelm Barth (Vienna University of Technology).
Helmut Horacek (1982). Construction of Planned Move Trees for Chess Pawn Endings. Sigart Newsletter 80, pp. 163-168.
Helmut Horacek (1983). Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings. ICCA Journal, Vol. 6, No. 3
Helmut Horacek (1984). Some Conceptual Defects of Evaluation Functions. ECAI-84, Pisa, Elsevier
Helmut Horacek (1986). The Fifth World Computer Chess Championship. ICCA Journal, Vol. 9, No. 2
Helmut Horacek (1986, 1989). The Fifth World Computer Chess Championship Cologne, 1986. Research Unit for Information Science and Artificial Intelligence, University of Hamburg from Kings Move - Welcome to the 1989 AGT World Computer Chess Championship. pg 21, pdf from The Computer History Museum (Abridged from ICGA Journal, Vol. 9, No. 2)
Hermann Kaindl, Helmut Horacek, Marcus Wagner (1986). Selective Search versus Brute Force. ICCA Journal, Vol. 9, No. 3
Hermann Kaindl, Marcus Wagner, Helmut Horacek (1988). Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees: The Details. Tech. Report #50, Department of Statistics and Computer Science, Vienna University of Technology, Austria.
Hermann Kaindl, Marcus Wagner, Helmut Horacek (1989). Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees. Workshop on New Directions in Game-Tree Search
Helmut Horacek (1989). Reasoning with Uncertainty in Computer Chess. Advances in Computer Chess 5

1990 ...

Russel Block, Helmut Horacek (1990). Generating Referring Expressions using Multiple Knowledge Sources. COLING-90 (ed. H. Karlgen), Vol. 2, pp. 24-29, Helsinki.
Hermann Kaindl, Reza Shams, Helmut Horacek (1991). Minimax Search Algorithms with and without Aspiration Windows. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 13, No. 12
Reza Shams, Hermann Kaindl, Helmut Horacek (1991). Using Aspiration Windows for Minimax Algorithms. IJCAI 1991, pdf
Helmut Horacek (1993). Computer Chess, its Impact on Artificial Intelligence. ICCA Journal, Vol. 16, No. 1 » WCCC 1992 - Workshop

2000 ...

Helmut Horacek (2000). Towards Understanding Conceptual Differences Between Minimaxing and Product-Propagation. ECAI 2000,
Helmut Horacek (2003). A Best-First Search Algorithm for Generating Referring Expressions. EACL 2003
Helmut Horacek (2008). Towards Designing Operationalizable Models of Man-Machine Interaction Based on Concepts from Human Dialog Systems. NLDB 2008
Helmut Horacek (2008). A High-Level Categorization of Explanation A Case Study with a Tutoring System. ExaCt 2008

2010 ...

Florin Haque, Helmut Horacek (2015). Generating Referential Descriptions Involving Relations by a Best-First Searching Procedure – A System Demo. ENLG 2015 , pdf

External Links

References

^ Bloomsbury - Helmut Horacek
^ Merlin's ICGA Tournaments
^ Helmut Horacek (1982). Ein Modell für Schachbauernendspiele mit menschlichen Problemlösungstechniken. Ph.D. thesis, Department of Computer Science, University of Vienna, supervisors Curt Christian (University of Vienna) and Wilhelm Barth (Vienna University of Technology)
^ Helmut Horacek (1983). Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings. ICCA Journal, Vol. 6, No. 3
^ From the workshop on Explanation-aware Computing ExaCt 2008 in Patras, Greece. flickr
^ ICGA Reference Database (pdf)
^ dblp: Helmut Horacek
^ Werner DePauli-Schimanovich (2006). Europolis 6. Informatik für Spiele und Verkehr. Extension der Mengenlehre, Herausgeber: Franz Pichler, Universitätsverlag Rudolf Trauner, ISBN 978-3-85487-946-6, (SG7) Merlin (ein ComputerChess-Programm) s. 171 (German), Google Books

What links here?

Page	Date Edited
ACM 1984	Jul 19, 2016
ACM 1986	Dec 5, 2017
Advances in Computer Chess 5	Dec 2, 2017
Artificial Intelligence	Apr 9, 2018
Aspiration Windows	Nov 1, 2017
Best-First	Dec 29, 2017
Bobby	Jan 7, 2016
Brute-Force	Jul 27, 2017
Chess 0.5	Nov 20, 2016
Chess 0.5X	Nov 5, 2015
Chess Game	Mar 28, 2017
Depth-First	Jun 25, 2016
Evaluation	Feb 1, 2018
Helmut Horacek	Oct 31, 2016
Hermann Kaindl	Oct 31, 2016
ICGA Journal	Dec 21, 2017
International Computer Chess Tournament 1984	Dec 21, 2017
Marcus Wagner	Jan 7, 2016
Mathematician	Apr 9, 2018
Merlin	Jan 20, 2018
Pawn Endgame	Oct 11, 2017
PawnKing	Sep 5, 2014
People	Feb 28, 2018
Planning	Feb 12, 2018
Pruning	Jan 1, 2018
Reza Shams	Oct 31, 2016
Roland Schreier	Aug 6, 2011
Search	Feb 1, 2018
Selectivity	Jan 12, 2018
University of Hamburg	Jan 20, 2018
Vaxchess	Jan 7, 2016
Vienna University of Technology	Dec 7, 2017
WCCC 1983	Jan 20, 2018
WCCC 1986	Jul 27, 2017
WCCC 1989	Dec 5, 2017
WCCC 1992	Feb 26, 2018
Werner DePauli-Schimanovich-Göttig	Nov 12, 2017

Up one level

Herbert Simon

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

Home * People * Herbert Simon

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

Selected Publications

Photos



Herbert Simon and Allen Newell, 1958 ^[4]

Herbert Simon ^[5]

NSS

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

Quotes

John McCarthy

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

Hans Berliner

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

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

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

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

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

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

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

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

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

George W. Baylor

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

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

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

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

Fernand Gobet

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

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

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

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

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

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

Chess Projects

Autobiography

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

Selected Publications

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

1956 ...

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

1960 ...

^[17]

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

1970 ...

^[18]

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

1980 ...

^[21]

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

1990 ...

^[22]

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

2000 ...

^[24]

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

External Links

References

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

What links here?

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

Up one level

Hermann Kaindl

GerdIsenberg — Mon, 31 Oct 2016 20:52:06 GMT

Home * People * Hermann Kaindl

		Hermann Kaindl, an Austrian computer scientist, games researcher and since 2003 full professor at the Vienna University of Technology, where he already defended his Ph.D. under supervision of Wilhelm Barth ^[1] ^[2]. Kaindl was senior consultant with the division of program and systems engineering at Siemens AG Austria ^[3]. Concurrently to his work in the industry, Kaindl has given lectures in computer science at the Technical University of Vienna since 1984, where he received the venia docendi in applied computer science (Praktische Informatik) in 1989 ^[4]. As student, Hermann Kaindl was primary author of the chess program Merlin, along with Helmut Horacek, Marcus Wagner and Roland Schreier, competing at various ACM North American Computer Chess Championships and two World Computer Chess Championships in the 80s ^[5].
Hermann Kaindl ^[6]

See also

Selected Publications

Selected Publications

^[7]^[8]^[9]

1978

Hermann Kaindl, Werner Schimanovich (1978). Catrin - Mathematical 2-person-game. University of Vienna

1980 ...

Hermann Kaindl (1981). Realisierung von langfristigem Planen und Massnahmen gegen den Horizont-Effekt im Computer-Schach. Doctoral Dissertation. Vienna University of Technology
Hermann Kaindl (1982). Dynamic Control of the Quiescence Search in Computer Chess. Cybernetics and Systems Research (ed. R. Trappl), pp. 973-977. North-Holland, Amsterdam. » Quiescence Search
Hermann Kaindl (1982). Positional Long-Range Planning in Computer Chess. Advances in Computer Chess 3, also published as Hermann Kaindl (1983). Positional Long-Range Planning in Computer Chess. Vienna University of Technology, Austria.
Hermann Kaindl (1982). Quiescence Search in Computer Chess. SIGART Newsletter, 80, pp. 124-131. Reprinted (1983) in Computer-Game-Playing: Theory and Practice, pp. 39-52. Ellis Horwood Ltd., Chichester. » Quiescence Search
Hermann Kaindl (1983). Searching to Variable Depth in Computer Chess. Proceedings of IJCAI 83, pp. 760-762. Karlsruhe. pdf
Hermann Kaindl (1985). What Happened with AI's Drosophila? ÖGAI 1985: 194-203
Hermann Kaindl, Helmut Horacek, Marcus Wagner (1986). Selective Search versus Brute Force. ICCA Journal, Vol. 9, No. 3
Hermann Kaindl (1988). Minimaxing Theory and Practice. AI Magazine, Vol. 9, No. 3, pp. 69-76. pdf
Hermann Kaindl (1988). Useful Statistics from Tournament Programs. ICCA Journal, Vol. 11, No. 4
Hermann Kaindl, Marcus Wagner, Helmut Horacek (1988). Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees: The Details. Tech. Report #50, Department of Statistics and Computer Science, Vienna University of Technology, Austria.
Hermann Kaindl, Marcus Wagner, Helmut Horacek (1989). Comparing Various Pruning Algorithms on Very Strongly Ordered Game Trees. Workshop on New Directions in Game-Tree Search
Hermann Kaindl (1989). Towards a Theory of Knowledge. Advances in Computer Chess 5
Hermann Kaindl, Anton Scheucher (1989). The Reason for the Benefits of Minmax Search. Proc. of the 11 th IJCAI, pp. 322–327, Detroit, MI.

1990 ...

Hermann Kaindl (1990). Tree Searching Algorithms. Computers, Chess, and Cognition, pp. 133-158
Hermann Kaindl, Reza Shams, Helmut Horacek (1991). Minimax Search Algorithms with and without Aspiration Windows. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 13, No. 12
Reza Shams, Hermann Kaindl, Helmut Horacek (1991). Using Aspiration Windows for Minimax Algorithms. IJCAI 1991, pdf
Gerhard Mehlsam, Hermann Kaindl, Wilhelm Barth (1991). Feature Construction during Tree Learning. GWAI 1991: 50-61.
Hermann Kaindl, Anton Scheucher (1992). Reasons for the Effect of Bounded Look-Ahead Search. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 22, No. 5, pp. 992-1007.
Gerhard Mehlsam, Hermann Kaindl, Wilhelm Barth (1995). Feature Construction during Tree Learning. GOSLER Final Report 1995: 391-403
Hermann Kaindl, Gerhard Kainz, Angelika Leeb, Harald Smetana (1995). How to use limited memory in heuristic search. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Canada, pp. 236-242. pdf

2000 ...

Johannes Fürnkranz, Bernhard Pfahringer, Hermann Kaindl, Stefan Kramer (2000). Learning to Use Operational Advice. ECAI-00, pdf
Hermann Kaindl, Stefan Kramer (2006). Are Automated Traceability Checks Needed? ISOneWorld 2006

External Links

References

^ Hermann Kaindl (1981). Realisierung von langfristigem Planen und Massnahmen gegen den Horizont-Effekt im Computer-Schach. Doctoral Dissertation. Vienna University of Technology
^ Werner DePauli-Schimanovich (2006). Europolis 6. Informatik für Spiele und Verkehr. Extension der Mengenlehre, Herausgeber: Franz Pichler, Universitätsverlag Rudolf Trauner, ISBN 978-3-85487-946-6, (SG7) Merlin (ein ComputerChess-Programm) s. 171 (German), Google Books
^ Univ.Prof. Dipl.-Ing. Dr.techn. Hermann Kaindl
^ Siemens AG Österreich
^ Merlin's ICGA Tournaments
^ Univ.Prof. Dipl.-Ing. Dr. Hermann Kaindl
^ ICGA Reference Database (pdf)
^ Johannes Fürnkranz - Research Areas (Selected Publications)
^ DBLP: Hermann Kaindl

What links here?

Page	Date Edited
ACM 1984	Jul 19, 2016
ACM 1986	Dec 5, 2017
Advances in Computer Chess 3	Jul 23, 2015
Advances in Computer Chess 5	Dec 2, 2017
Artificial Intelligence	Apr 9, 2018
Aspiration Windows	Nov 1, 2017
Bernhard Pfahringer	May 23, 2016
Best-First	Dec 29, 2017
Brute-Force	Jul 27, 2017
Chess 0.5	Nov 20, 2016
Computers, Chess, and Cognition	Dec 28, 2016
Depth	Feb 25, 2018
Depth-First	Jun 25, 2016
Extensions	Apr 19, 2018
Gerhard Mehlsam	May 23, 2016
Helmut Horacek	Oct 31, 2016
Hermann Kaindl	Oct 31, 2016
Horizon Effect	Sep 10, 2017
ICGA Journal	Dec 21, 2017
International Computer Chess Tournament 1984	Dec 21, 2017
Johannes Fürnkranz	Feb 26, 2018
Jos Uiterwijk	Aug 11, 2017
Knowledge	Jul 22, 2017
Learning	Feb 20, 2018
Marcus Wagner	Jan 7, 2016
Mathematician	Apr 9, 2018
Memory	Dec 8, 2017
Merlin	Jan 20, 2018
People	Feb 28, 2018
Planning	Feb 12, 2018
Pruning	Jan 1, 2018
Quiescence Search	Aug 19, 2017
Reza Shams	Oct 31, 2016
Roland Schreier	Aug 6, 2011
Search	Feb 1, 2018
Search Statistics	Jan 16, 2018
Selectivity	Jan 12, 2018
Stefan Kramer	Apr 1, 2016
Strategy	Jan 18, 2018
Vienna University of Technology	Dec 7, 2017
WCCC 1983	Jan 20, 2018
WCCC 1986	Jul 27, 2017
WCCC 1989	Dec 5, 2017
Werner DePauli-Schimanovich-Göttig	Nov 12, 2017
Wilhelm Barth	Oct 8, 2017

Up one level

Hiroyuki Iida

GerdIsenberg — Fri, 11 Aug 2017 16:00:55 GMT

Home * People * Hiroyuki Iida

		Hiroyuki Iida, a Japanese computer scientist and computer games researcher with focus on Game-refinement theory, Opponent Model Search, and Computer Shogi. Hiroyuki Iida is Professor at Japan Advanced Institute of Science and Technology (JAIST), and head of the games laboratory ^[1]^[2]. Before, he was affiliated with the Shizuoka University, Hamamatsu, and was postdoctoral researcher at Maastricht University. He received his Ph.D. on Heuristic Theories on Game-Tree Search from Tokyo University of Agriculture and Technology, Tokyo ^[3] . Hiroyuki Iida is a professional 6-dan Shogi player, and co-author of the Shogi program Tacos, the four times Gold medal winner at Computer Olympiads ^[4] . He is member of the Board of the ICGA as Secretary-Treasurer and Section Editor of the ICGA Journal.
Hiroyuki Iida ^[5]

Photos

Selected Publications

Photos

Hiroyuki Iida watching TACOS ^[6]

Selected Publications

^[7] ^[8]

1990 ...

Hiroyuki Iida, Yoshiyuki Kotani (1991). Computer Shogi. The Proceedings of Game Playing System Workshop, pp. 42-48. ICOT, Tokyo, Japan.
Hiroyuki Iida, Jos Uiterwijk (1992). How to Become a Shogi Grandmaster. Proceedings of The First European Shogi Workshop, Heidelberg, Germany, Vol. 1, pp. 25-29. Shogi Deutschland and EMBL.
Hiroyuki Iida (1993). Shogi in Europe. Uniprint, University of Limburg.
Hiroyuki Iida, Jos Uiterwijk (1993). Thoughts on Grandmaster-like Strategies. Proceedings of The Second European Shogi Workshop. Shogi Deutschland and EMBL, Heidelberg, Germany.
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (1993). Opponent-Model Search. Technical Report CS 93-03, University of Limburg. ISSN 0922-8721.
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1993). Potential Applications of Opponent-Model Search. Part 1: The Domain of Applicability. ICCA Journal, Vol. 16, No. 4
Hiroyuki Iida (1994). Heuristic Theories on Game-Tree Search. Ph.D. thesis, Tokyo University of Agriculture and Technology, Tokyo. ISBN 4-944082-02-9
Hiroyuki Iida, Jos Uiterwijk, Yoshiyuki Kotani (1994). Tutoring Strategy in Game Playing. 1st Game Programming Workshop (Japanese)
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1994). Potential Applications of Opponent-Model Search. Part 2. Risks and strategies. ICCA Journal, Vol. 17, No. 1
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1994). Thoughts on the Application of Opponent-Model Search. Advances in Computer Chess 7

1995 ...

Masayuki Fujii, Hiroyuki Iida, Yoshiyuki Kotani (1995). Prediction of an opponent's move using opponent's time effectively. 2nd Game Programming Workshop
Yoshiyuki Kotani, Hiroyuki Iida (1995). Which moves should be pruned - classification of Shogi Moves and Ratio of Played Moves. 2nd Game Programming Workshop
Hiroyuki Iida, Yoshiyuki Kotani, Jos Uiterwijk (1995). Tutoring Strategies in Game-Tree Search. ICCA Journal, Vol. 18, No. 4, extended abstract as pdf
Hiroyuki Iida, Fuminari Abe (1996). Brinkmate Search. 3rd Game Programming Workshop
Hirofumi Nakaie, Hiroyuki Iida, Yoshiyuki Kotani (1996). A Method of Applying Opening Book Data to Non-Recorded Positions. 3rd Game Programming Workshop
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (1996). A Game-Tree Model Including an Opponent Model. Proceedings of the Eighth Dutch Conference on Artificial Intelligence (NAIC'96) (eds. J.-J.Ch. Meyer and L.C. van der Gaag), pp. 223-234. Utrecht University
Hitoshi Matsubara, Hiroyuki Iida, Jos Uiterwijk (1996). A Shogi-Computer Test Set. ACM Conference on Computer Science
Hiroyuki Iida, Yoshiyuki Kotani, Jos Uiterwijk, Jaap van den Herik (1997). Gains and Risks of OM Search. Advances in Computer Chess 8
Hitoshi Matsubara, Hiroyuki Iida, Reijer Grimbergen (1997). Chess, Shogi, Go, natural developments in game research. pdf

1998 ...

Jaap van den Herik, Hiroyuki Iida (eds.) (1998). Computers and Games. CG 1998
Xinbo Gao, Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (1998). A Speculative Strategy. CG 1998
Hiroyuki Iida, Jin Yoshimura, Kazuro Morita, Jos Uiterwijk (1998). Retrograde Analysis of the KGK Endgame in Shogi: Its Implications for Ancient Heian Shogi. CG 1998
Makoto Sakuta, Hiroyuki Iida (1999). Solving Problems with Uncertainty: A case study using Tsuitate-Tsume-Shogi. 5th Game Programming Workshop
Nobusuke Sasaki, Hiroyuki Iida (1999). Report on the First Open Computer-Amazons Championship. ICCA Journal, Vol. 22, No. 1
Nobusuke Sasaki, Hiroyuki Iida, Tsuyoshi Hashimoto (1999). Evolutionary Changes of Chess-like Games: A Study Using Self-play Experiments. Joho Shori Gakkai Shinpojiumu Ronbunshu, Vol. 99, No. 14 (Japanese)

2000 ...

Hiroyuki Iida, Martin Müller (2000). Report on the Second Open Computer-Amazons Championship. ICGA Journal, Vol 23, No. 1
Jaap van den Herik, Hiroyuki Iida (eds.) (2000). Games in AI Research. Universiteit Maastricht
H. Watanabe, Hiroyuki Iida, Jos Uiterwijk (2000). Automatic Composition of Shogi Mating Problems. in Jaap van den Herik, Hiroyuki Iida (eds.) (2000). Games in AI Research.
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik. (2000). Cooperative Strategies for Pair Playing. in Jaap van den Herik, Hiroyuki Iida (eds.) (2000). Games in AI Research.
Hiroyuki Iida (2000). YSS wins Shogi Tournament. ICGA Journal, Vol. 23, No. 3 » 5th Computer Olympiad
Makoto Sakuta, Hiroyuki Iida, Jin Yoshimura (2000). A Deterministic Approach for Solving Kriegspiel-like Problems. 5th Computer Olympiad Workshop
Tsuyoshi Hashimoto, Yoichiro Kajihara, Hiroyuki Iida (2000). Brinkmate Search in Computer Shogi. 5th Computer Olympiad Workshop
Makoto Sakuta, Hiroyuki Iida (2000). Solving Kriegspiel-like Problems: Exploiting a Transposition Table. ICGA Journal, Vol 23, No. 4, pdf
Makoto Sakuta, Hiroyuki Iida, Jin Yoshimura (2000). Solving Problems under {Uncertainty Paradigm}. Proceedings of International Conference on Advances in Infrastructure for Electronic Business, Science and Education on the Internet (SSGRR 2000), L'Aquila, Italy. (in CD-ROM).

2001

Makoto Sakuta, Hiroyuki Iida (2001). The Performance of PN*, PDS, and PN Search on 6x6 Othello and Tsume-Shogi. Advances in Computer Games 9
Nobusuke Sasaki, M. Hirasawa, Tsuyoshi Hashimoto, Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (2001). Hira, a Four-handed Shogi Program. Advances in Computer Games 9
Tsuyoshi Hashimoto, Yoichiro Kajihara, Nobusuke Sasaki, Hiroyuki Iida, Jin Yoshimura (2001). An Evaluation Function for Amazons. Advances in Computer Games 9
Masahiro Seo, Hiroyuki Iida, Jos Uiterwijk (2001). The PN*-Search Algorithm: Applications to Tsume-Shogi. Artificial Intelligence, Vol. 129, Nos. 1-2
Xinbo Gao, Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (2001). Strategies anticipating a difference in search depth using opponent-model search. Theoretical Computer Science, Vol. 252, Nos. 1–2
Hiroyuki Iida (2001). 8QP wins Amazons tournament. ICGA Journal, Vol. 24, No. 3 » 6th Computer Olympiad
Makoto Sakuta, Hiroyuki Iida (2001). AND/OR-tree Search Algorithms in Shogi Mating Search. ICGA Journal, Vol. 24, No. 4

2002

Makoto Sakuta, Tsuyoshi Hashimoto, Jun Nagashima, Hiroyuki Iida (2002). Endgame-search techniques developed in shogi: application to Lines of Action. In Caulfield, H. et al., editor, Proceedings of JCIS 2002, pages 458-460.
Hiroyuki Iida, Makoto Sakuta, Jeff Rollason (2002). Computer Shogi. Artificial Intelligence, Vol. 134, Elsevier, CiteSeerX
Jun Nagashima, Masahumi Taketoshi, Yoichiro Kajihara, Tsuyoshi Hashimoto, Hiroyuki Iida (2002). An Efficient Use of Piece-Square Tables in Computer Shogi.
Hiroyuki Iida (2002). Control Freak wins Dots-and-Boxes tournament. ICGA Journal, Vol. 25, No. 3 » 7th Computer Olympiad
Hiroyuki Iida (2002). Dynamic-Information Games. 7th Computer Olympiad Workshop
Makoto Sakuta, Tsuyoshi Hashimoto, Jun Nagashima, Jos Uiterwijk, Hiroyuki Iida (2002). Application of the killer-tree heuristic and the lambda-search method to lines of action. ^[9]
Hiroyuki Iida, Nobuo Takeshita, Jin Yoshimura (2002). A metric for entertainment of boardgames: its implication for evolution of chess variant. IWEC 2002: Makuhari, Japan

2003 ...

Tsuyoshi Hashimoto, Jun Nagashima, Makoto Sakuta, Jos Uiterwijk, Hiroyuki Iida (2003). Automatic realization-probability search. Internal report, Dept. of Computer Sciences, Shizuoka University, Hamamatsu, Japan
Hiroyuki Iida, Kazutoshi Takahara, Jun Nagashima, Yoichiro Kajihara, Tsuyoshi Hashimoto (2004). An Application of Game-Refinement Theory to Mah Jong. ICEC'2004

2005 ...

Hiroyuki Iida (2005). Towards Dynamics of Intelligence in the Field of Games. Advances in Computer Games 11 - Invited Lecture
Junichi Hashimoto, Tsuyoshi Hashimoto, Hiroyuki Iida (2007). Context Killer Heuristic and Its Application to Computer Shogi. CGW 2007 » Killer Heuristic
Julien Kloetzer, Hiroyuki Iida, Bruno Bouzy (2007). The Monte-Carlo approach in Amazons. CGW 2007, pdf
Toru Ueda, Tsuyoshi Hashimoto, Junichi Hashimoto, Hiroyuki Iida (2008). Weak Proof-Number Search. CG 2008
Alessandro Cincotti, Hiroyuki Iida (2008). The Game of Synchronized Domineering. CG 2008
Alessandro Cincotti, Shigetaka Komori, Hiroyuki Iida (2008). The Game of Synchronized Triomineering and Synchronized Tridomineering. International Journal of Computational and Mathematical Sciences 2:3 2008, pdf
Julien Kloetzer, Hiroyuki Iida, Bruno Bouzy (2008). A Comparative Study of Solvers for Amazons Endgames. CIG'08, pdf
Julien Kloetzer, Hiroyuki Iida, Bruno Bouzy (2009). Playing Amazons Endgames. ICGA Journal, Vol. 32, No. 3, pdf

2010 ...

Hiroyuki Iida (2011). The 2011 Japan Prize Awarded to Unix Pioneers. ICGA Journal, Vol. 34, No. 1
Yuichiro Sato, Alessandro Cincotti, Hiroyuki Iida (2012). An Analysis of Voting Algorithm in Games. ECAI CGW 2012
Kristian Spoerer, Toshihisa Okaneya, Kokolo Ikeda, Hiroyuki Iida (2013). Further Investigations of 3-Member Simple Majority Voting for Chess. CG 2013
Jaap van den Herik, Hiroyuki Iida, Aske Plaat (2013). The 8th Computers and Games Conference. ICGA Journal, Vol. 36, No. 3 » CG 2013
Taichi Ishitobi, Alessandro Cincotti, Hiroyuki Iida (2013). Shape-Keeping Technique and Its Application to Checkmate Problem Composition. 2013 AIIDE Workshop
Jaap van den Herik, Hiroyuki Iida, Aske Plaat, Johanna Hellemons (2013). The Brain and Mind Sports Olympiad. ICGA Journal, Vol. 36, No. 3 » 17th Computer Olympiad
Jaap van den Herik, Hiroyuki Iida, Aske Plaat (2013). The 8th Computers and Games Conference (Part 2). ICGA Journal, Vol. 36, No. 4 » CG 2013
Jaap van den Herik, Hiroyuki Iida, Aske Plaat, Johanna Hellemons (2013). The Brain and Mind Sports Olympiad (Part 2). ICGA Journal, Vol. 36, No. 4 » 17th Computer Olympiad
Jaap van den Herik, Hiroyuki Iida, Aske Plaat (eds.) (2014). Computers and Games: 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers. LNCS 8427, Springer, ISBN-13: 978-3-319-09164-8 » CG 2013 ^[10]

2015 ...

Taichi Ishitobi, Aske Plaat, Hiroyuki Iida, Jaap van den Herik (2015). Reducing the Seesaw Effect with Deep Proof Number Search. Advances in Computer Games 14
Yuichiro Sato, Hiroyuki Iida, Jaap van den Herik (2015). Transfer Learning by Inductive Logic Programming. Advances in Computer Games 14
Mohd Nor Akmal Khalid, Umi Kalsom Yusof, Hiroyuki Iida, Taichi Ishitobi (2015). Critical Position Identiﬁcation in Games and Its Application to Speculative Play. ICAART 2015
Mohd Nor Akmal Khalid, E. Mei Ang, Umi Kalsom Yusof, Hiroyuki Iida, Taichi Ishitobi (2015). Identifying Critical Positions Based on Conspiracy Numbers. Agents and Artificial Intelligence, ICAART 2015 - Revised Selected Papers
Danilo Carvalho, Minh Le Nguyen, Hiroyuki Iida (2017). An Analysis of Majority Voting in Homogeneous Groups for Checkers: Understanding Group Performance through Unbalance. Advances in Computer Games 15, ResearchGate

External Links

References

^ ICGA: Lines of Action by Mark Winands
^ Research Center for Computers and Games - Members
^ Hiroyuki Iida (1994). Heuristic Theories on Game-Tree Search. Ph.D. thesis, Tokyo University of Agriculture and Technology, Tokyo. ISBN 4-944082-02-9
^ Shogi at the Computer Olympiad
^ Hiroyuki Iida Profile from Japan Advanced Institute of Science and Technology
^ World Computer Shogi Championship 2006 - AI Factory newsletter article Spring 2006 by Reijer Grimbergen
^ ICGA Reference Database (pdf)
^ Hiroyuki Iida Author profile from ACM Portal
^ ScienceDirect - Information Sciences : Application of the killer-tree heuristic and the lambda-search method to lines of action
^ Dap Hartmann (2014). A Statue of unremitting Devotion. Revised Selected papers CG 2013. (Review) ICGA Journal, Vol. 37, No. 3

What links here?

Page	Date Edited
10th Computer Olympiad	Jul 22, 2017
11th Computer Olympiad	Jul 22, 2017
12th Computer Olympiad	Jul 22, 2017
15th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
20th Computer Olympiad	Feb 5, 2018
5th Computer Olympiad	Jan 17, 2017
6th Computer Olympiad	Jul 22, 2017
7th Computer Olympiad	Jul 23, 2017
8th Computer Olympiad	Jul 22, 2017
Advances in Computer Chess 7	Oct 28, 2014
Advances in Computer Chess 8	Jun 26, 2017
Advances in Computer Games 10	Dec 30, 2016
Advances in Computer Games 11	Dec 27, 2016
Advances in Computer Games 14	Aug 11, 2017
Advances in Computer Games 15	Aug 12, 2017
Advances in Computer Games 9	Nov 15, 2016
Alessandro Cincotti	Jan 23, 2016
Amazons	Aug 12, 2017
Andreas Junghanns	Jun 26, 2017
Aske Plaat	Jun 26, 2017
Bob Herschberg	Dec 13, 2016
Bruno Bouzy	Aug 12, 2017
CG 1998	May 28, 2015
CG 2000	May 26, 2015
CG 2008	Jan 3, 2017
CG 2013	Jul 18, 2017
CGW 2007	Jan 2, 2017
Checkers	Dec 23, 2017
Checkmate	Apr 13, 2018
Chess	Jan 21, 2018
Chess Problems, Compositions and Studies	Feb 19, 2018
Conspiracy Numbers	Dec 29, 2017
Dap Hartmann	Jun 10, 2017
ECAI CGW 2012	May 21, 2015
Ernst A. Heinz	Mar 6, 2017
Fail-High Reductions	Mar 6, 2014
Games	Feb 20, 2018
Go	Jan 24, 2018
Hideki Kato	Jan 6, 2017
Hiroyuki Iida	Aug 11, 2017
Hitoshi Matsubara	Feb 7, 2017
ICGA	Jul 8, 2017
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
JAIST	Jan 23, 2016
Jeff Rollason	Dec 23, 2016
Jin Yoshimura	Dec 22, 2016
Johanna Hellemons	Jan 8, 2017
Jos Uiterwijk	Aug 11, 2017
Julien Kloetzer	Jan 4, 2017
Jun Nagashima	Dec 23, 2016
Junichi Hashimoto	Jan 4, 2017
Kazutoshi Takahara	May 23, 2016
Ken Thompson	Sep 8, 2017
Killer Heuristic	Sep 14, 2017
Kokolo Ikeda	Mar 15, 2016
KriegSpiel	Sep 5, 2017
Learning	Feb 20, 2018
Lines of Action	Feb 5, 2018
Maastricht University	May 15, 2017
Makoto Sakuta	Dec 22, 2016
Martin Müller	Aug 12, 2017
Masahiro Seo	Dec 31, 2013
Masahumi Taketoshi	Dec 2, 2013
Michael Buro	Dec 21, 2016
Mohd Nor Akmal Khalid	Jan 23, 2016
Monte-Carlo Tree Search	Apr 26, 2018
Nobusuke Sasaki	Jan 19, 2016
Null Move Pruning	Dec 2, 2017
Opponent Model Search	Aug 14, 2017
Othello	Jan 4, 2018
People	Feb 28, 2018
Piece-Square Tables	Mar 31, 2018
Pondering	Dec 9, 2017
ProbCut	Mar 25, 2016
Proof-number search	Jan 22, 2018
Pruning	Jan 1, 2018
Reijer Grimbergen	Jan 4, 2017
Retrograde Analysis	Mar 21, 2017
Richard Korf	Dec 29, 2017
Search	Feb 1, 2018
Selectivity	Jan 12, 2018
Shogi	Feb 19, 2018
SOMA	Mar 25, 2015
Static Exchange Evaluation	Dec 14, 2017
Strategy	Jan 18, 2018
Taichi Ishitobi	Jan 23, 2016
Tony Marsland	Nov 27, 2017
Toru Ueda	Dec 31, 2016
Tsuyoshi Hashimoto	Jan 3, 2017
Umi Kalsom Yusof	Jan 23, 2016
Unix	Jun 28, 2015
WCCC 2010	Jan 6, 2017
Who's Who	Sep 6, 2017
Xinbo Gao	May 28, 2015
Yngvi Björnsson	Jun 26, 2017
Yoichiro Kajihara	Dec 23, 2016
Yoshiyuki Kotani	Dec 27, 2016

Up one level

Ingo Althöfer

GerdIsenberg — Thu, 04 May 2017 10:49:49 GMT

Home * People * Ingo Althöfer

		Ingo Althöfer, a German mathematician, computer scientist, game researcher, game inventor, and full professor at Faculy for Mathematics and Computer Science ^[1], Friedrich Schiller University of Jena ^[2]. Ingo Althöfer's professional as well as private research interests cover a broad range of AI-issues, search algorithms, evaluation, creating and inventing new, interesting games such as EinStein würfelt nicht! ^[3] ^[4] , and triple-brain (3-Hirn) (two- or k-best mode, where an arbiter instance choses from the best moves provided by one or more chess-programs) ^[5] ^[6]. 3-Hirn has become a "brand name" for books, games and software, distributed by Ingo's small publishing company 3-Hirn-Verlag.
Ingo Althöfer ^[7]

Selected Publications

Photos

Chess960CWC 2005

Chess960CWC 2005: Peter Svidler, Arbiter Ingo Althöfer and Roland Pfister ^[8]

Tilburg 2011

Ingo Althöfer and Richard J. Lorentz playing EinStein würfelt nicht! at the 16th Computer Olympiad, 2011 ^[9]

3-Hirn's Motto

By Christian Posthoff and Günter Reinemann 1987 ^[10] ^[11] :
Nicht
Der Mensch kann, aber die Maschine nicht...
oder
Der Mensch kann nicht, aber die Maschine kann...
sondern
Der Mensch kann, aber Mensch und Maschine zusammen können (viel mehr).

Not
Humans can, but machine can not...
or
Humans cannot, but machine can...
but
Humans can, but humans and machine together can (much more).

Selected Publications

^[12] ^[13] ^[14]

1985 ...

Ingo Althöfer (1985). Das 3-Hirn - Entscheidungsteilung im Schach. Computerschach und Spiele, pp. 20-22.
Ingo Althöfer (1986). Asymptotic Properties of Certain Competition Systems in Artificial Intelligence and Ecology. Ph.D. thesis, University of Bielefeld, advisor Rudolf Ahlswede ^[15]
Ingo Althöfer (1988). Das 3-Hirn-Konzept. MODUL, pp. 42-46
Ingo Althöfer (1988). Root Evaluation Errors: How they Arise and Propagate. ICCA Journal, Vol. 11, Nos. 2/3
Ingo Althöfer (1988). On the Complexity of Searching Game Trees and Other Recursion Trees. Journal of Algorithms, Vol. 9, No. 4
Ingo Althöfer (1989). An Incremental Negamax Algorithm. Advances in Computer Chess 5
Ingo Althöfer (1989). Generalized Minimax Algorithms are no Better Error Correctors than Minimax Itself. Advances in Computer Chess 5
Ingo Althöfer (1989). Retrograde Analysis and two Computerizable Definitions of the Quality of Chess Games. ICCA Journal, Vol. 12, No. 2
Ingo Althöfer (1989). A Summary of some Results in Theoretical Game Tree Search and the 'Dreihirn'-Experiment. Workshop on New Directions in Game-Tree Search

1990 ...

Ingo Althöfer (1990). Compressing Chess Games with the Help of a fast Deterministic Chess Program. ICCA Journal, Vol. 13, No. 4
Ingo Althöfer, Klaus-Uwe Koschnick (1991). On the convergence of “Threshold Accepting”. Applied Mathematics and Optimization, Vol. 24, No. 1 » Simulated Annealing
Ingo Althöfer (1991). On pathology in game tree and other recursion tree models. Habilitation Thesis (June 1991), Faculty of Mathematics, University of Bielefeld.
Ingo Althöfer (1991). An Additive Evaluation Function in Chess. ICCA Journal, Vol. 14, No. 3
Ingo Althöfer (1991). Selective trees and majority systems: two experiments with commercial chess computers. Advances in Computer Chess 6
Ingo Althöfer (1991): Data compression using an intelligent generator: The storage of chess games as an example. Artificial Intelligence, Vol. 52, No. 1
Rudolf Ahlswede, Ingo Althöfer (1991). The Asymptotic Behaviour of Diameters in the Average. University of Bielefeld, zipped ps
Ingo Althöfer, Torsten Sillke (1992). An "Average Distance" Inequality for Subsets of the Cube. Journal of Combinatorial Theory, Series B, Vol. 56
Ingo Althöfer (1992). On Asymmetries in Chess Programs. ICCA Journal, Vol. 15, No. 1
Ingo Althöfer (1992). Move Ordering by Time Ordering. Correspondence, ICCA Journal, Vol. 15, No. 2 » Root Move Ordering
Ingo Althöfer, Bernhard Balkenhol (1992). A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Algorithm. Artificial Intelligence, Vol. 52, No. 2
Ingo Althöfer (1993). A Parallel Game Tree Search Algorithm with a Linear Speedup. Journal of Algorithms, Vol. 15, No. 2
Ingo Althöfer (1993). Das 3-Hirn - Eine Zwischenbilanz. Computerschach und Spiele
Ingo Althöfer (1993). On Telescoping Linear Evaluation Functions. ICCA Journal, Vol. 16, No. 2 ^[16]
Ingo Althöfer, Klaus-Uwe Koschnick (1993). On the Deterministic Complexity of Searching Local Maxima. Discrete Applied Mathematics, Vol. 43, No. 2
Ingo Althöfer, Chrilly Donninger, Ulf Lorenz, Valentin Rottmann (1994). On Timing, Permanent Brain and Human Intervention. Advances in Computer Chess 7
Ingo Althöfer, Bernhard Walter (1994). Weak Zugzwang: Statistics on some Chess Endgames. ICCA Journal, Vol. 17, No. 2

1995 ...

Ingo Althöfer, Imre Leader (1995). Correlation of Boolean Functions and Pathology in Recursion Trees. SIAM Journal on Discrete Mathematics, Vol. 8, No. 4
Ingo Althöfer (1996). Doppelfritz mit Chef. Computerschach und Spiele, October. pp. 33-36
Ingo Althöfer (1996). Meine Geschichte mit dem Mehrvarianten-Modus. Computerschach und Spiele. December, p. 56.
Ingo Althöfer (1997). A Symbiosis of Man and Machine Beats Grandmaster Timoshchenko. ICCA Journal, Vol. 20, No. 1
Ingo Althöfer (1997). On the k-best Mode in Computer Chess: Measuring the Similarity of Move Proposals. ICCA Journal, Vol. 20, No. 3
Ingo Althöfer (1998). LIST-3-HIRN vs. Grandmaster Yusupov. - A Report on a Very Experimental Match, Part I: The Games. ICCA Journal, Vol. 21, No. 1
Ingo Althöfer (1998). 13 Jahre 3-Hirn – Meine Schach-Experimente mit Mensch-Maschinen-Kombinationen. ISBN 3-00-003100-6. ^[17]
Ingo Althöfer (1999). Advanced Shuffle Chess with Technical Improvements. ICCA Journal, Vol. 22, No. 4

2000 ...

Ingo Althöfer, Ning Cai, Gunter Dueck, Levon Khachatrian, Mark S. Pinsker, András Sárközy, Ingo Wegener, Zhen Zhang (Eds.) (2000). Numbers, Information and Complexity. 50 articles in honour of Rudolf Ahlswede, Kluwer Academic Publishers, Boston
Ingo Althöfer (2000). A One-Sided Advanced Chess Match. Part 1: The Games. ICGA Journal, Vol. 23, No. 3
Ingo Althöfer (2001). Grandmaster Chess with one-sided Computer Help. ICGA Journal, Vol. 24, No.4
Ingo Althöfer (2002). Clobber – A New Game with Very Simple Rules. ICGA Journal, Vol. 25, No. 2
Ingo Althöfer (2002). Inventing Game Variants with Computer Help. 7th Computer Olympiad Workshop
Ingo Althöfer, Raymond Georg Snatzke (2002). Playing Games with Multiple Choice Systems. CG 2002
Ingo Althöfer (2003). A 20-Choice Experiment in Go for Human+Computer. ICGA Journal, Vol. 26, No. 2
Ingo Althöfer, Jens Lieberum, Johan de Koning, Stefan Meyer-Kahlen, Thomas Rolle, Jörg Sameith (2003). Five visualizations of the k-best mode. ICGA Journal, Vol. 26, No. 3 ^[18]
Ingo Althöfer (2003). Computer-Aided Game Inventing. Friedrich Schiller University of Jena, pdf
Ingo Althöfer (2004). Improved game play by multiple computer hints. Theoretical Computer Science, Vol. 313, No. 3

2005 ...

Ingo Althöfer, Susanne Heuser (2005). Randomised Evaluations in Single-Agent Search. ICGA Journal, Vol. 28, No. 1
Ingo Althöfer (2008). On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations. Technical Report, pdf » Monte-Carlo Tree Search

2010 ...

Ingo Althöfer (2010). Automatic Generation and Evaluation of Recombination Games. Doctoral Dissertation by Cameron Browne, Review, ICGA Journal, Vol. 33, No. 4 ^[19]
Ingo Althöfer (2010). Game Self-Play with Pure Monte-Carlo: The Basin Structure. pdf » Monte-Carlo Tree Search

2011

Ingo Althöfer (2011). John Tromp in the Style of David Levy: 4-0 win in the Go bet. ICGA Journal, Vol. 34, No. 2 » John Tromp ^[20]
Ingo Althöfer (2011). On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness. Advances in Computer Games 13
Ingo Althöfer (2011). On Games with Random-Turn Order and Monte Carlo Perfectness. ICGA Journal, Vol. 34, No. 4

2012

Ingo Althöfer (2012). The Origin of Dynamic Komi. ICGA Journal, Vol. 35, No. 1
Ingo Althöfer (2012). Side Report: Popular Video Livestream. ICGA Journal, Vol. 35, No. 1 » Advances in Computer Games 13
Ingo Althöfer (2012). PAN wins Clobber Tournament. ICGA Journal, Vol. 35, No. 1 » 16th Computer Olympiad
Ingo Althöfer (2012). Havannah – The Old Man and the C’s. ICGA Journal, Vol. 35, No. 4 » Havannah

2013

Ingo Althöfer (2013). Remarks on History and Presence of Game Tree Search and Research. Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede. Lecture Notes in Computer Science, Springer, ISBN 978-3-642-36898-1
Ingo Althöfer, Wesley Turner (2013). Anomalies of Pure Monte Carlo Search in Monte Carlo Perfect Games. CG 2013
Ingo Althöfer (2013). The wild Years are gone: Monte Carlo in Smoother Waters. Conference Report CG 2013, ICGA Journal, Vol. 36, No. 3
Ingo Althöfer (2013). PAN Wins Clobber Tournament - King of Clobber - De Koning and his PAN. ICGA Journal, Vol. 36, No. 3 » 17th Computer Olympiad, Johan de Koning

2014

Ingo Althöfer, Roland Voigt (2014). Spiele, Rätsel, Zahlen. Springer Spektrum, ISBN 978-3-642-55301-1, Zusatzmaterial (German) ^[21]
Ingo Althöfer, Raymond Georg Snatzke (2014). The codecentric Go Challenge 2014: Franz-Josef Dickhut vs. CRAZY STONE. ICGA Journal, Vol. 37, No. 4 ^[22] ^[23] ^[24]

2015 ...

Ingo Althöfer, Matthias Beckmann, Friedrich Salzer (2015). On some Random Walk Games with Micro Control. Advances in Computer Games 14
Ingo Althöfer, Michael Hartisch (2015). The Effect of Biasing Win Conditions. Game & Puzzle Design, Vol. 1, No. 1
Ingo Althöfer (2015). Obituary: John Nash, A Beautiful Mind has Gone. ICGA Journal, Vol. 38, No. 2 » John Nash ^[25] ^[26]
Michael Hartisch, Ingo Althöfer (2015). Optimal Robot Play in Certain Chess Endgame Situations. ICGA Journal, Vol. 38, No. 3
Ingo Althöfer, Richard J. Lorentz, Matthias Beckmann (2015). Advances in Computer Games Conference 2015. Report, ICGA Journal, Vol. 38, No. 3 » Advances in Computer Games 12
Ingo Althöfer (2015). HANFRIED wins EinStein Würfelt Nicht! Tournament. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad | EWN

2016

Raphael Thiele, Ingo Althöfer (2016). An Analysis of Majority Systems with Dependent Agents in a Simple Subtraction Game. CG 2016
Ingo Althöfer (2016). Computer-Aided Go: Chess as a Role Model. CG 2016

Forum Posts

Re: AEGON news 2: dreihirn by Stefan Meyer-Kahlen, rgcc, April 24, 1996 » Aegon 1996
A diary on 3-Hirn chess by Ingo Althöfer, rgcc, December 27, 1996
3-Hirn History: Game 12 by Ingo Althöfer, rgcc, March 29, 1997 » Aegon 1992, Zugzwang (Program)
Multi-Fritz with Boss versus IM R. Vasquez by Ingo Althöfer, CCC, March 09, 1999 » Fritz ^[27]
Artikel von John Nunn by Ingo Althöfer, CSS Forum, January 08, 2014 (German) ^[28]

External Links

Pictorial reports

Pictorial reports and Games by Ingo Althöfer

25. Spielautorentreffen in Göttingen 2005 by Karsten Höser (German)
"EinStein würfelt nicht" - Das Turnier in Jena (German), EinStein würfelt nicht! with Theo van der Storm
Karl's Race, A Game on Karl Scherer's Alternating Tiling, 2006
CeBIT 2007 Spiele erfinden mit Computer-Hilfe (German)
Lange Nacht der Wissenschaften - Long Night of Sciences Jena - 2007
Workshop Jena 2008: Analysis, Design, and Programming of Games
Chrilly Donninger, Stefan Meyer-Kahlen, Frank Schneider and Eiko Bleicher et al.
Games in Shanghai
Lange Nacht der Wissenschaften - Long Night of Sciences, Jena - 2009
Lange Nacht der Wissenschaften - Long Night of Sciences, Jena - 2011
Games and Aesthetics: Play beyond Zero Sums, September 2011 and February 2013
Computer Olympiad 2011 - Clobber » Clobber
"EinStein würfelt nicht" in the Computer Olympiad 2011
Schneider von Gent:, March 2013
Old Lego Bricks in our Washing Machine, June 18 and 29, and July 05, 2013
Match: Lee Sedol vs AlphaGo , March 09, 2016 » AlphaGo

References

^ Fakultaet fuer Mathematik und Informatik
^ Prof. Dr. Ingo Althöfer - Chair Operations Research
^ A challenge to Theo van der Storm! by Ingo Althöfer, CCC, March 04, 2005
^ K-Best Visualisations
^ A diary on 3-Hirn chess by Ingo Althöfer, rgcc, December 27, 1996
^ Ingo Althöfer Homepage
^ Zahlenmeister - Die Chess Classic Mainz 2005 aus der Sicht eines Taschenrechners (German), Photo courtesy Eric van Reem
^ Photo by Gerd Isenberg. November 23, 2011
^ Jörg Sameith (2002). Entscheidungs-Unterstützung im Multiple-Choice-Modus - Realisierung eine k-Best-Algorithmus für das Spiel "Connections". Diplomarbeit
^ Christian Posthoff, Günter Reinemann, Computerschach - Schachcomputer, Berlin: Akademie-Verl., (1987), ISBN-13: 978-3055002281 available from Biblioman.de
^ ICGA Reference Database (pdf)
^ Prof. Dr. Ingo Althöfer - Selected Publications
^ dblp: Ingo Althöfer
^ Rudolf Ahlswede PhD Theses
^ Re: Zappa Report by Ingo Althöfer, CCC, December 30, 2005
^ Ingo Althöfer - 13 Jahre 3-Hirn at WCCC 1999, Photographer Gerhard Hund
^ K-Best Visualisations
^ Cameron Browne (2008). Automatic Generation and Evaluation of Recombination Games, Doctoral Dissertation, Queensland University of Technology, pdf
^ The Shodan Go Bet
^ Spiele, Zahlen, Rätsel by Karsten Müller, ChessBase.de, October 20, 2014 (German)
^ Franz-Josef Dickhut from Wikipedia, Rémi Coulom
^ codecentric go challenge 2014: Interviews with Franz-Josef Dickhut and Rémi Coulom - codecentric Blog by Raymond Georg Snatzke , October 1, 2014
^ codecentric go challenge 2014: Final Interviews - codecentric Blog by Raymond Georg Snatzke, November 27, 2014
^ John Forbes Nash, Jr. from Wikipedia
^ A Beautiful Mind (film) from Wikipedia
^ Rodrigo Vásquez Schroder - Wikipedia
^ John Nunn (2013). Discoveries in R+2P vs. R+P Endings. ICGA Journal, Vol. 36, No. 3

What links here?

Page	Date Edited
More Links
15th Computer Olympiad	Aug 12, 2017
16th Computer Olympiad	Aug 12, 2017
17th Computer Olympiad	Aug 12, 2017
18th Computer Olympiad	Feb 5, 2018
19th Computer Olympiad	Sep 19, 2017
7th Computer Olympiad	Jul 23, 2017
Advances in Computer Chess 5	Dec 2, 2017
Advances in Computer Chess 6	Dec 17, 2016
Advances in Computer Chess 7	Oct 28, 2014
Advances in Computer Games 13	Jan 7, 2017
Advances in Computer Games 14	Aug 11, 2017
Aegon 1992	Jan 22, 2017
Aegon 1993	Mar 26, 2017
Aegon 1996	Jan 22, 2017
Alpha-Beta	Jan 28, 2018
AlphaZero	Feb 10, 2018
AMD	Mar 9, 2018
Andrew Lin	Jul 9, 2016
Anthony Cozzie	Nov 5, 2016
Arts	Nov 5, 2017
Asymmetric evaluation	Nov 17, 2016
Automated Tuning	Feb 27, 2018
Bernd Brügmann	Jul 30, 2016
Bernhard Balkenhol	Oct 26, 2013
Bernhard Walter	Dec 31, 2015
Breakthrough (Game)	Aug 11, 2017
Cameron Browne	Dec 30, 2017
CG 2002	Jun 9, 2015
CG 2013	Jul 18, 2017
CG 2016	Dec 18, 2017
Chess	Jan 21, 2018
Chess Game	Mar 28, 2017
Chess960CWC 2005	Jan 1, 2016
Chrilly Donninger	Dec 19, 2016
Clever & Smart	Jan 20, 2017
Clobber	May 16, 2017
Computer Chess Reports	May 15, 2016
Computerschach und Spiele	May 16, 2016
Conferences	Dec 18, 2017
Conspiracy Numbers	Dec 29, 2017
Deep Blue	Aug 1, 2017
Eiko Bleicher	Apr 24, 2014
EinStein würfelt nicht!	Aug 11, 2017
Endgame	Sep 18, 2017
Endgame Tablebases	Mar 6, 2018
Evaluation	Feb 1, 2018
Frank Schneider	Jan 7, 2016
Fritz	Feb 26, 2018
Games	Feb 20, 2018
Go	Jan 24, 2018
Greif	May 17, 2016
Günther Schrüfer	Jan 7, 2016
Havannah	Jan 8, 2017
Hermann	Dec 7, 2017
Hideki Kato	Jan 6, 2017
Hydra 97	Jan 1, 2017
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
Ingo Althöfer reports to include	Jan 26, 2017
Iterative Deepening	Jun 23, 2017
Jakob Erdmann	Mar 16, 2016
Jan Krabbenbos	Jan 8, 2018
Jens Lieberum	Jan 2, 2017
Johan de Koning	Jul 3, 2017
John Nunn	Dec 9, 2017
John Tromp	Jan 6, 2017
Jörg Sameith	Mar 16, 2016
Karsten Müller	Oct 19, 2017
Kasparov versus Deep Blue 1997	Aug 1, 2017
Klaus-Uwe Koschnick	Jan 10, 2017
Kramnik versus Deep Fritz 2002	Oct 16, 2017
Matej Guid	Jan 6, 2018
Mathematician	Apr 9, 2018
Mephisto Lyon	Sep 1, 2017
Michael Buro	Dec 21, 2016
Michael Ehrig	May 17, 2016
Michael Hartisch	Aug 11, 2017
Monte-Carlo Tree Search	Apr 26, 2018
Move Ordering	Feb 27, 2018
Nine Men’s Morris	Dec 17, 2016
Opponent Model Search	Aug 14, 2017
Ossi Weiner	Dec 18, 2017
Othello	Jan 4, 2018
People	Feb 28, 2018
Pondering	Dec 9, 2017
Quiescence Search	Aug 19, 2017
Raymond Georg Snatzke	May 26, 2015
Recursion	Nov 18, 2017
Rémi Coulom	Feb 5, 2018
Retrograde Analysis	Mar 21, 2017
Richard J. Lorentz	Aug 11, 2017
Robots	Feb 20, 2018
Search	Feb 1, 2018
Search Pathology	Nov 26, 2017
Search with Random Leaf Values	Apr 23, 2018
Simulated Annealing	May 8, 2017
Sören Walter Perrey	Oct 22, 2013
Stefan Meyer-Kahlen	Jun 19, 2017
Theo van der Storm	Apr 5, 2017
Theodore Tegos	Jan 1, 2017
Therese Horey	May 4, 2014
Thomas Mally	Dec 30, 2017
Time Management	Mar 20, 2018
Timo Haupt	Jan 8, 2016
UCT	Jan 22, 2018
Ulf Lorenz	Dec 22, 2016
Valentin Rottmann	Jan 7, 2016
Victor Allis	Dec 19, 2016
WCCC 1989	Dec 5, 2017
WCCC 2015	Jun 13, 2017
WCCC 2016	Sep 18, 2017
WCCC 2017	Dec 31, 2017
WCSC 2013	Aug 17, 2016
WCSC 2015	Jun 13, 2017
WCSC 2016	Sep 18, 2017
Wesley Turner	Jan 7, 2017
WMCCC 1997	Apr 4, 2017
x86-64	Mar 6, 2018
Zappa	Oct 24, 2017
Zillions of Games	May 29, 2017

Up one level

Wikispaces : chessprogramming - items matching description

Alexander Reinefeld

Table of Contents

Chess Programs

Murks

MicroMurks

Search Algorithms

Negascout

RecSSS* and RecDual*

Selected Publications

1982 ...

1990 ...

2000 ...

External Links

References

What links here?

Andreas Junghanns

Table of Contents

Selected Publications

1994 ...

2000 ...

External Links

References

What links here?

Andrew Barto

Table of Contents

Selected Publications

External Links

References

What links here?

Arie de Bruin

Table of Contents

Photos

Selected Publications

1990 ...

1995 ...

2000 ...

External Links

References

What links here?

Arthur Samuel

Table of Contents

Photos

Quotes

See also

Selected Publications

External Links

References

What links here?

Aske Plaat

Table of Contents

See also

Selected Publications

1994

1995

1996

1997 ...

2000 ...

2010 ...

2015 ...

External Links

References

What links here?

Bob Herschberg

Table of Contents

Biography

Poems

Quotes

Selected Publications

1966

1977

1982

1984

1985

1986

1987

1988

1989

1990

1991