Wikispaces : chessprogramming - items matching description

A. Harry Klopf

GerdIsenberg — Fri, 29 Dec 2017 21:47:34 GMT

Home * People * A. Harry Klopf

		A. Harry Klopf, an American senior scientist for machine intelligence, since the early 70s affiliated with the Avionics Directorate, Wright Laboratory and Air Force Research Laboratory, Aeronautical Systems Center, Wright-Patterson Air Force Base, Ohio. His research focused on reinforcement learning, and adaptive behavior as approaches to the analysis of natural intelligence and the synthesis of machine intelligence ^[1]. Temporal difference learning has one root in Klopf's work on animal learning psychology ^[2] - beside Arthur Samuel's pioneering work on his self learning Checkers player in the late 50s ^[3] ^[4].
A. Harry Klopf ^[5]

Selected Publications

Selected Publications

^[6]

1970 ...

A. Harry Klopf (1972). Brain Function and Adaptive Systems - A Heterostatic Theory. Air Force Cambridge Research Laboratories, Special Reports, No. 133, pdf ^[7]
A. Harry Klopf (1975). A Comparison of Natural and Artificial Intelligence. ACM SIGART Bulletin, No. 52

1980 ...

A. Harry Klopf (1982). The Hedonistic Neuron: A Theory of Memory, Learning, and Intelligence. Hemisphere Publishing Corporation, University of Michigan ^[8]
A. Harry Klopf (1987). A Neuronal Model of Classical Conditioning. Technical Report, Air Force Wright Aeronautical Laboratories ^[9]
A. Harry Klopf (1988). A Theoretical Neuronal Learning Mechanism That Predicts the Basic Categories of Classical Conditioning Phenomena. in Cellular Mechanisms of Conditioning and Behavioral Plasticity

1990 ...

A. Harry Klopf, Scott E. Weaver, James S. Morgan (1993). A Hierarchical Network of Control Systems that Learn: Modeling Nervous System Function During Classical and Instrumental Conditioning. Adaptive Behavior, Vol. 1, No. 3
Mance E. Harmon, Leemon C. Baird III, A. Harry Klopf (1995). Reinforcement Learning Applied to a Differential Game. Adaptive Behavior, Vol. 4, No. 1, pdf
Leemon C. Baird III, Mance E. Harmon, A. Harry Klopf (1996). Reinforcement Learning: An Alternative Approach to Machine Intelligence. pdf

2000 ...

Jeffrey D. Johnson, Wei Li, Jinghong Li, A. Harry Klopf (2001). A Computational Model of Learned Avoidance Behavior in a One-Way Avoidance Experiment. Adaptive Behavior, Vol. 9, No. 2

References

^ "About the Authors" from Leemon C. Baird III, Mance E. Harmon, A. Harry Klopf (1996). Reinforcement Learning: An Alternative Approach to Machine Intelligence. pdf
^ A. Harry Klopf (1972). Brain Function and Adaptive Systems - A Heterostatic Theory. Air Force Cambridge Research Laboratories, Special Reports, No. 133, pdf
^ Arthur Samuel (1959). Some Studies in Machine Learning Using the Game of Checkers. IBM Journal July 1959
^ Richard Sutton, Andrew Barto (1998). Reinforcement Learning: An Introduction. MIT Press, 6.10 Bibliographical and Historical Remarks
^ Image from Leemon C. Baird III, Mance E. Harmon, A. Harry Klopf (1996). Reinforcement Learning: An Alternative Approach to Machine Intelligence. pdf
^ dblp: A. Harry Klopf
^ Heterostasis from Wikipedia
^ Hedonism from Wikipedia
^ Classical conditioning from Wikipedia

What links here?

Page	Date Edited
A. Harry Klopf	Dec 29, 2017
Artificial Intelligence	Apr 9, 2018
Learning	Feb 20, 2018
Memory	Dec 8, 2017
Neural Networks	Mar 12, 2018
People	Feb 28, 2018
Reinforcement Learning	Feb 12, 2018
Temporal Difference Learning	Feb 20, 2018

Up one level

Aamir Syed

GerdIsenberg — Fri, 08 Sep 2017 20:05:58 GMT

Selected Publications

External Links

References

What links here?

Home * People * Aamir Syed

Aamir Syed,
an Indian American game designer, and student at Birchwood Elementary School ^[1] . Along with his father Omar Syed, he designed the game Arimaa when he was four years old, and was eponym of the game ("Arimaa" is "Aamir" spelled backwards plus an initial "a") ^[2] .

Selected Publications

Omar Syed, Aamir Syed (2003). Arimaa - A New Game Designed to be Difficult for Computers. ICGA Journal, Vol. 26, No. 2

External Links

References

What links here?

Page	Date Edited
Aamir Syed	Sep 8, 2017
Arimaa	Jan 4, 2017
ICGA Journal	Dec 21, 2017
Omar Syed	Sep 8, 2017
People	Feb 28, 2018

Up one level

Aaron Becker

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

Home * People * Aaron Becker

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

Selected Publications

Selected Publications

^[4] ^[5]

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

Forum Posts

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

External Links

References

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

What links here?

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

Up one level

Aaron L. Futer

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

Selected Publications

^[2]

Edward Komissarchik, Aaron L. Futer (1974). Ob Analize Ferzevogo Endshpilya pri Pomoshchi EVM. (Analysis of a queen endgame using an IBM computer) Problemy Kybernetiki, Vol. 29, pp. 211-220. English translation by Christian Posthoff, revised in ICCA Journal, Vol. 9, No. 4 (1986)
A. G. Alexandrov, A. M. Baraev, Ya. Yu. Gol'fand, Edward Komissarchik, Aaron L. Futer (1977). Computer analysis of rook end game. Avtomatika i Telemekhanika, No. 8, 113–117
A. G. Alexandrov, Vladimir Arlazarov, A. M. Baraev, Ya. Yu. Gol'fand, V. N. Deza, T. P. Il’ina, Edward Komissarchik, Anatoly Uskov, I. A. Faradzhev, Aaron L. Futer (1977). Processing of large files of information on the example of the analysis of the rook’s end game. Programming and Computer Software, No. 3
Aaron L. Futer (1978). Programming endgames with few pieces. Soviet Physics. Doklady, No. 23
Aaron L. Futer (1978). Computerized transposition of high-order matrices. Programming and Computer Software, No. 4
Vladimir Arlazarov, Aaron L. Futer (1979). Computer Analysis of a Rook End-Game. Machine Intelligence 9 (eds. Jean Hayes Michie, Donald Michie and L.I. Mikulich), pp. 361-371. Ellis Horwood, Chichester. Reprinted in Computer Chess Compendium
Edward Komissarchik, Aaron L. Futer (1986). Computer Analysis of a Queen Endgame. ICCA Journal, Vol. 9, No. 4 ^[3]

External Links

Futer A L from Math-Net.Ru

References

^ Ernst Zermelo (1913). Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels Proc. Fifth Congress Mathematicians, (Cambridge 1912), Cambridge Univ. Press 1913, 501–504. Translation: On an Application of Set Theory to the Theory of the Game of Chess see Appendix in Schwalbe and Walker: Zermelo and the Early History of Game Theory (pdf)
^ ICGA Reference Database (pdf)
^ Subject: brute-force vs. intuition in math & chess by Bill Dubuque, August 1996

What links here?

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

Up one level

Aaron Tay

GerdIsenberg — Mon, 24 Mar 2014 20:11:07 GMT

Home * People * Aaron Tay

		Aaron Tay Chee Hsien, a Singaporean Resource Librarian at National University of Singapore ^[1] , computer chess enthusiast and WinBoard promoter. He wrote computer chess articles on various topics ^[2] , and his FAQ on Winboard and Chess Engines ^[3] is continued in Winboard and Chess Engines FAQ of Ron Murawski's Computer-Chess Wiki.
Aaron Tay ^[4]

Forum Posts

Question about EPD by Aaron Tay, CCC, February 20, 2001 » Extended Position Description
Looking for a position by Aaron Tay, CCC, December 02, 2001 » WCCC 1977, Duchess - Kaissa

External Links

Aaron Tay's Page - Library 2.0
FAQ on Winboard and Chess Engines, hosted by Ron Murawski
Chess engines articles by Aaron Tay, hosted by Ron Murawski
What can Winboard do? by Aaron Tay, March 01, 2002, hosted by Ron Murawski
Beginner's Guide to running Computer Chess Tournament
Twitter / Aaron Tay: Let's play Chess ...

References

What links here?

Page	Date Edited
Aaron Tay	Mar 24, 2014
Arena	Mar 16, 2018
Auto232	Feb 25, 2018
Chess 232 Board	Jun 19, 2016
Chess Engine Communication Protocol	Mar 4, 2018
Chessmaster	Jan 21, 2018
Chrilly Donninger	Dec 19, 2016
Duchess	Dec 22, 2017
Endgame Tablebases	Mar 6, 2018
Extended Position Description	Dec 2, 2017
Günter Rehburg	Nov 5, 2010
People	Feb 28, 2018
Temporal Difference Learning	Feb 20, 2018
WCCC 1977	Dec 22, 2017
WinBoard	Mar 4, 2018
WinBoard Engines	Dec 20, 2015

Up one level

Aart Bik

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

Compiler Architect

Java Compiler

Vectorization

Selected Publications

Home * People * Aart Bik

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

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

Compiler Architect

Java Compiler

Quote from Aart homepage ^[5] :

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

Vectorization

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

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

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

Selected Publications

^[9] ^[10]

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

Forum Posts

2005 ...

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

2010 ...

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

2015 ...

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

External Links

References

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

What links here?

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

Up one level

Abdallah Saffidine

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

Home * People * Abdallah Saffidine

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

Selected Publications

Selected Publications

^[4]

2009

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

2010 ...

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

2011

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

2012

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

2013

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

2014

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

2015 ...

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

External Links

References

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

What links here?

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

Up one level

Abdul Mateen Khan

GerdIsenberg — Wed, 03 Dec 2014 16:55:12 GMT

Home * People * Abdul Mateen Khan

Engines

References

What links here?

Abdul Mateen Khan,
a computer scientist from the United Arab Emirates and IT manager in PAL Group of Companies ^[1] since 2006. He received his M.Sc. in CS from New York Institute of Technology in 2008 ^[2], and was lead programmer of Hydra and principle author of the chess engines Cryptic ^[3] and Shark, in 2008 mentioned on the now defunct Hydra site, and from May 2008 until December 2009 on Wikipedia ^[4] ^[5].

Engines

Cryptic runs on modern high speed multi-processor CPU. It is programmed in mixed C and Assembly Language. It is aimed to be the world's top single machine Chess Engine.
Shark is network based deep search meta engine. It is based on unique idea by which it reaches to depth of 25+ easily with the help of only 6 CPUs in less than a minute. Currently a dual core CPU takes more than an hour to reach to this depth.

References

^ Pal Group of Companies
^ PAL Group of Companies - PAL IT Department | PAL Group
^ Cryptic- a powerful neglected engine by Magnus Friedmann, Rybka Forum, August 19, 2011
^ Hydra (chess): 13:34, 30 May 2008 by 80.227.14.13
^ Hydra (chess): 13:57, 16 December 2009‎ by 217.165.22.102

What links here?

Page	Date Edited
Abdul Mateen Khan	Dec 3, 2014
Hydra	Aug 17, 2016
People	Feb 28, 2018

Up one level

Abdullah Al-Ghaznawi

GerdIsenberg — Sat, 25 Apr 2015 17:17:12 GMT

External Links

References

What links here?

Home * People * Abdullah Al-Ghaznawi

Abdullah Al-Ghaznawi,
an Egyptian electrical engineer, computer scientist and game developer. He holds a Bachelor's Degree in 2014 from Sinai University ^[1], and his interests include game design, programming , machine learning, chess and computer chess, he is author of a chess engine ^[2]. On his homepage, Abdullah Al-Ghaznawi hosts the tutorial Winglet, Writing a Chess Program in 99 Steps on Winglet by Stef Luijten ^[3].

External Links

References

^ Abdullah Al-Ghaznawi | LinkedIn
^ Abdullah Al-Ghaznawi | Elance
^ winglet, writing a chess program in 99 steps by Stef Luijten, hosted by Abdullah Al-Ghaznawi
^ copy was taken in ‎March ‎07, ‎2013, images and archives included

What links here?

Page	Date Edited
Abdullah Al-Ghaznawi	Apr 25, 2015
People	Feb 28, 2018
Winglet	Apr 26, 2015

Up one level

Adam Berent

aberent — Tue, 06 Jul 2010 15:46:30 GMT

Home * People * Adam Berent

		Adam Berent, Canadian computer programmer and developer of various shareware programs ^[1] , including the chess engine ChessBin.com with C# source code and explanation supplied. Adam Berent is also the creator of popular online chess websites GeeksWithChess.com FreeChessOnline.info and LiveChess.info ^[2] . You can find out more about Adam Berent on his website:AdamBerent.com
Adam Berent ^[3]

References

^ Software by Adam Berent
^ ChessBin.com Computer Chess Information and Resources
^ Articles by Adam Berent from The Code Project

What links here?

Page	Date Edited
Adam Berent	Jul 6, 2010
Chess Champion Pocket Chess	Sep 19, 2014
ChessBin.com	Jan 6, 2012
Distance	Sep 25, 2015
Evaluation	Feb 1, 2018
Hash Table	Jan 1, 2018
King Safety	Feb 14, 2018
People	Feb 28, 2018
Piece-Square Tables	Mar 31, 2018
Profiling	Sep 15, 2016
Recommended Reading	Nov 17, 2017
Search	Feb 1, 2018

Up one level

Adam Hair

GerdIsenberg — Sat, 14 Jan 2017 22:09:27 GMT

Home * People * Adam Hair

		Adam Hair, an American computer chess aficionado, notably working with Miguel A. Ballicora on testing Gaviota ^[1] , and member of CCRL, the Computer Chess Rating Lists ^[2] . In January 2012, he published a survey of evidence from both perspectives concerning the Rybka Controversy and ICGA Investigations, as hosted by Ed Schröder ^[3] .
Adam Hair ^[4]

Selected Publications

Selected Publications

Adam Hair (2012). The Rybka Investigation: A Survey Of Evidence From Both Perspectives. hosted by Ed Schröder » Rybka Controversy
Don Dailey, Adam Hair, Mark Watkins (2014). Move Similarity Analysis in Chess Programs. Entertainment Computing, Vol. 5, No. 3, preprint as pdf ^[5]

Forum Posts

SPRT and Engine testing by Adam Hair, CCC, December 13, 2010 » SPRT
Rybka Investigation : Survey Of Evidence by Adam Hair, CCC, January 10, 2012
Pawn Advantage, Win Percentage, and Elo by Adam Hair, CCC, April 15, 2012
Elo Increase per Doubling by Adam Hair, CCC, May 07, 2012
Adam Hair's article on Pairwise comparison of engines by Charles Roberson, CCC, May 19, 2015 ^[6]
The effective speedup from 1 to 8 cpus for SF and Komodo by Adam Hair, CCC, May 31, 2015 » Parallel Search, Stockfish, Komodo
Stockfish benchmark data by Adam Hair, OpenChess Forum, November 27, 2016 » Stockfish
SF Progression since Fishtest inception by Adam Hair, CCC, January 14, 2017 » Fishtest ^[7]

External Links

References

What links here?

Page	Date Edited
Adam Hair	Jan 14, 2017
CCC	Mar 19, 2018
CCRL	Dec 13, 2017
Chess Challenger	Dec 27, 2017
Clones	Jan 16, 2017
Counter	Nov 13, 2017
Cutechess-cli	Jan 6, 2018
Depth	Feb 25, 2018
Don Dailey	Dec 7, 2016
Engine Rating Lists	Dec 13, 2017
Games	Feb 20, 2018
Gaviota	Jan 21, 2018
GUI	Mar 16, 2018
Harm Geert Muller	Mar 31, 2018
InBetween	Jan 21, 2018
iota	Feb 10, 2016
Komodo	Mar 6, 2018
Luca Hemmerich	Jun 19, 2017
Mark Watkins	Dec 6, 2017
Match Statistics	Mar 31, 2018
Mephisto (H)	Dec 18, 2017
Parallel Search	Dec 30, 2017
Pawn Advantage, Win Percentage, and Elo	Dec 20, 2017
People	Feb 28, 2018
Plisk	Dec 31, 2014
Recommended Reading	Nov 17, 2017
Robot Adversary	Mar 14, 2015
Rybka	Mar 27, 2017
Rybka Controversy	Jan 18, 2018
Stockfish	Apr 7, 2018
Super Constellation	Oct 1, 2016
TCEC Season 7	Jan 23, 2015
TCEC Season 8	Nov 30, 2015
Temporal Difference Learning	Feb 20, 2018
Test-Positions	Feb 25, 2018
Usurpator	Jul 30, 2017
Utilities	Jan 20, 2018
Vice	Mar 8, 2016
Wb2UCI	Feb 1, 2018
WBEC	Feb 27, 2016
Xpdnt	Sep 13, 2015

Up one Level

Adam Kujawski

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

Publications

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

External Links

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

References

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

What links here?

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

Up one Level

Adam Marczyk

GerdIsenberg — Thu, 26 Jul 2012 17:50:09 GMT

Home * People * Adam Marczyk

Adam Marczyk,
an American atheist ^[1]^[2] and scientist with focus on Genetic Algorithm and Evolutionary Computation ^[3]. He is member of a group of volunteers to handle the maintenance of the TalkOrigins Archive.

References

What links here?

Page	Date Edited
Adam Marczyk	Jul 26, 2012
Automated Tuning	Feb 27, 2018
Genetic Programming	Dec 26, 2017
Ghost	Feb 2, 2018
Learning	Feb 20, 2018
People	Feb 28, 2018

Up one level

Adam Oellermann

GerdIsenberg — Sat, 15 Feb 2014 10:45:03 GMT

Home * People * Adam Oellermann

		Adam Oellermann, a South African ^[1] Pastor of Milestone Christian Fellowship ^[2] ^[3], IT consultant and software developer, resident of Girvan, South Ayrshire, Scotland . As games and chess programmer, he is author of the chess engine Blikskottel, and the Draughts program Deep Brew ^[4]. Adam further maintains A Beginner's Guide to Chess Programming ^[5].
Adam Oellermann ^[6]

Forum Posts

Re: New winboard engine Blikskottel 0.4 ? by Adam Oellermann, CCC, June 12, 2001
Re: These days anybody can write a chess program.Johan de Koning [interview] by Adam Oellermann, CCC, August 29, 2001
Blikskottel - New Version by Adam Oellermann, CCC, October 25, 2001

External Links

References

What links here?

Page	Date Edited
Adam Oellermann	Feb 15, 2014
Blikskottel	Feb 15, 2014
People	Feb 28, 2018
Recommended Reading	Nov 17, 2017

Up one level

Adi Botea

GerdIsenberg — Mon, 22 Jan 2018 16:47:26 GMT

Home * People * Adi Botea

		Adi Botea, a computer scientist at IBM Research in Dublin, Ireland, previously affiliared with Australian National University and NICTA, with research interests in AI planning, heuristic search, and games. He holds a Ph.D. from University of Alberta about AI Planning and Search ^[1], and was involved in developing of the pathfinding algorithm HPA* (Hierarchical Path-Finding A) ^[2]^[3], and Macro-FF* ^[4], a planner obtained by adding macro-operators on top of the fast forward planning system ^[5].
Adi Botea ^[6]

Selected Publications

External Links

References

What links here?

Selected Publications

^[7] ^[8]

Adi Botea (2002). Using Abstraction for Heuristic Search and Planning. Research Summary. In Proceedings of the 5th International Symposium on Abstraction, Reformulation, and Approximation SARA-02, volume 2371 of Lecture Notes in Artificial Intelligence, 326-327, Kananaskis, AB, Canada.
Adi Botea, Martin Müller, Jonathan Schaeffer (2002). Using Abstraction for Planning in Sokoban. CG 2002
Adi Botea, Martin Müller, Jonathan Schaeffer (2004). Near Optimal Hierarchical Path-Finding. In Journal of Game Development, volume 1, issue 1, 7-28, pdf
Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer (2004). Macro-FF. In Booklet of 4th International Planning Competition, 15-17.
Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer (2005). Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. Journal of Artificial Intelligence Research 24 (2005) 581-621, pdf
Adi Botea (2006). Improving AI Planning and Search with Automatic Abstraction. PhD Thesis, University of Alberta, pdf
Ko-Hsin Cindy Wang, Adi Botea (2008). Fast and Memory-Efficient Multi-Agent Pathfinding. ICAPS'08, pdf
Akihiro Kishimoto, Alex Fukunaga, Adi Botea (2009). Scalable, Parallel Best-First Search for Optimal Sequential Planning. In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS-2009) (Best Paper Award), pages 201-208, pdf

External Links

References

^ Adi Botea (2006). Improving AI Planning and Search with Automatic Abstraction. PhD Thesis, University of Alberta, pdf
^ Adi Botea, Martin Müller, Jonathan Schaeffer. (2004). Near Optimal Hierarchical Path-Finding. In Journal of Game Development, volume 1, issue 1, 7-28, pdf
^ A* Pathfinding for Beginners by Patrick Lester
^ Adi Botea - Macro-FF
^ Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer (2005). Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. Journal of Artificial Intelligence Research 24 (2005) 581-621, pdf
^ Adi Botea - Google Scholar Citations
^ dblp: Adi Botea
^ Adi Botea - Publications

What links here?

Page	Date Edited
Adi Botea	Jan 22, 2018
Akihiro Kishimoto	Jan 22, 2018
Australian National University	Jun 30, 2014
CG 2002	Jun 9, 2015
Jonathan Schaeffer	Jan 29, 2018
Markus Enzenberger	May 23, 2016
Martin Müller	Aug 12, 2017
Mathematician	Apr 9, 2018
People	Feb 28, 2018
Planning	Feb 12, 2018
University of Alberta	Feb 20, 2018

Up one level

Adriaan de Groot

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

Home * People * Adriaan de Groot

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

Quotes

Chase & Simon

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

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

Fernand Gobet

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

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

...

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

Four Stages

De Groot defined four stages of the thought process:

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

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

Euratom

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

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

Selected Publications

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

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

External Links

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

References

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

What links here?

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

Up one level

Adrian Millett

GerdIsenberg — Wed, 12 Jul 2017 20:41:44 GMT

Home * People * Adrian Millett

Adrian Millett, (often misspelled as Adrian Millet)
a British Checkers and games programmer. He is author of the Checkers playing program Sage ^[1] ^[2] ^[3] and the Draughts and Draughts variant playing program Dynamo ^[4], and along with Derek Oldbury co-author of the Checkers playing program Checkermate. Sage Draughts competed at the 1st Computer Olympiad, London 1989, Checkermate at the 2nd Computer Olympiad, London 1990, both in 8x8 Checkers - Dynamo played 10x10 Draughts at the 4th Computer Olympiad, London 1992. In 1995, Adrian Millett introduced the Portable Draughts Notation based on Portable Game Notation in Chess ^[5]. Further, he developed the Windows GUI for Chess Genius 4 ^[6] ^[7] which evolved to a multi-engine GUI via Chess Genius 6 (6.5) to the Millennium Chess System ^[8], and the Chess Genius Classic GUI ^[9]. Recent versions of his programs were distributed by his PC Solutions company ^[10] with its ChessAndCheckers.com! site, last updated in 2001 ^[11].

Forum Posts

cg by Pc Solutions, rgc, December 29, 1994 » Chess Genius
endgame databases and misc by Pc Solutions, rgc, April 22, 1995
PDN - Portable Draughts Notation by Pc Sol, rgc, July 22, 1995
hash mem in win-chess progs by Pc Sol, rgcc, September 28, 1995 » Transposition Table, Windows
Re: mclane's christmas-tournament: #6 by Pc Solutions, rgcc, January 07, 1999 » Millennium Chess System
news: SAGE 5000.. by Pc Solutions, rgcc, May 12, 1999
Re: Deep Junior vs Genius6.5/Shredder4 by Pc Solutions, rgcc, April 11, 2000 » Millennium Chess System

External Links

References

^ Sage 4000
^ SAGE 4001 Checkers Program
^ Sage Draughts 9.0
^ Dynamo Draughts
^ PDN - Portable Draughts Notation by Pc Sol, rgc, July 22, 1995
^ cg by Pc Solutions, rgc, December 29, 1994
^ Richard Lang (1995). Chess Genius 4. Computer Chess Reports Vol. 5 No. 3+4, pp. 80
^ Schachclub Leinzell - Schach + PC - Shredder 5, Teil 1 by Peter Schreiner (German)
^ ChessGenius Classic 7.0 - The Chess Program that beat Kasparov!
^ Adrian Millett of PC Solutions
^ ChessAndCheckers.com!

What links here?

Page	Date Edited
1st Computer Olympiad	Jul 25, 2017
2nd Computer Olympiad	Jul 12, 2017
4th Computer Olympiad	Jul 15, 2017
Adrian Millett	Jul 12, 2017
Checkers	Dec 23, 2017
Chess Genius	Feb 26, 2018
Derek Oldbury	Jul 12, 2017
Draughts	Jul 12, 2017
MILLENNIUM 2000 GmbH	Jul 13, 2017
Millennium Chess System	Jul 12, 2017
People	Feb 28, 2018
Transposition Table	Apr 19, 2018
Windows	Nov 2, 2017

Up one level

Adrien Regimbald

GerdIsenberg — Tue, 27 May 2014 17:24:08 GMT

Home * People * Adrien Regimbald

		Adrien M. Regimbald, a Canadian computer engineer, chess player ^[1], organizer of chess tournaments throughout Alberta, and as computer chess programmer author of the open source chess program Faile ^[2].
Adrien Regimbald ^[3]

Forum Posts

Why the name Faile? by Adrien Regimbald, CCC, June 28, 2000
Faile 1.4 - Fritz 32 bit Engine (fixed) by Adrien Regimbald, CCC, July 20, 2000

External Links

Canadian Chess - Topics - University of Alberta
Ivanchuk, Shirov, Bologan at Canada Open - Canadian Open Chess Championship, Edmonton 2005 by Adrien Regimbald, ChessBase News, July 11, 2005
Ivanchuk, Shirov, et al. win Canadian Open - Canadian Open Chess Championship, Edmonton 2005 by Adrien Regimbald, ChessBase News, July 23, 2005

References

^ Edmonton Chess Club » Top Players
^ Homepage of Faile
^ Ivanchuk, Shirov, et al. win Canadian Open - Canadian Open Chess Championship, Edmonton 2005 by Adrien Regimbald, ChessBase News, July 23, 2005

What links here?

Page	Date Edited
Adrien Regimbald	May 27, 2014
Bruja	Feb 3, 2015
ChessBrainVB	Jun 24, 2017
Faile	May 27, 2014
Gavon	Apr 30, 2018
LarsenVB	Jun 24, 2017
Open Source Engines	Jul 14, 2015
People	Feb 28, 2018
Pepito	Nov 27, 2014
Sjeng	Aug 17, 2017
University of Alberta	Feb 20, 2018

Up one level

Agata Muszycka-Jones

GerdIsenberg — Thu, 04 May 2017 10:35:13 GMT

Home * People * Agata Muszycka-Jones

		Agata Muszycka-Jones, a Canadian computer scientist and software developer. She studied at the Technical University of Łódź and obtained her Master Degree in Computer Science on Searching Techniques and Pathology in Search ^[1] at the Concordia University in Montreal. She has been developing software for 8 years before joining IBM in 1995 ^[2] . In her 1985 paper along with Rajjan Shinghal An empirical comparison of pruning strategies in game trees, NegaScout and PVS was concluded superior to Alpha-Beta in practice ^[3] .
Agata Muszycka-Jones ^[4]

Selected Publications

External Links

References

What links here?

Selected Publications

^[5]

Agata Muszycka (1985). Game Trees: Searching Techniques and Pathological Phenomenon. Master of Computer Science, Department of Computer Science, Concordia University, Montreal, pdf
Agata Muszycka, Rajjan Shinghal (1985). An empirical comparison of pruning strategies in game trees. IEEE Transactions on Systems, Man, and Cybernetics, Vol. 15, No. 3

External Links

Agata Muszycka-Jones - LinkedIn

References

^ Agata Muszycka (1985). Game Trees: Searching Techniques and Pathological Phenomenon. Master of Computer Science, Department of Computer Science, Concordia University, Montreal
^ Eclipse as a Platform for Research and Teaching
^ Alexander Reinefeld, Tony Marsland (1987). A Quantitative Analysis of Minimal Window Search. IJCAI-87, pdf
^ Agata Muszycka-Jones - LinkedIn
^ ICGA Reference Database (pdf)

What links here?

Page	Date Edited
Agata Muszycka-Jones	May 4, 2017
NegaScout	Jul 6, 2016
People	Feb 28, 2018
Principal Variation Search	Oct 22, 2017
Rajjan Shinghal	Nov 4, 2013
Scout	Jan 28, 2018
Search Pathology	Nov 26, 2017
Technical University of Łódź	Apr 15, 2014

Up one level

Akihiro Kishimoto

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

Home * People * Akihiro Kishimoto

		Akihiro Kishimoto, a Japanese computer scientiest, research staff member at IBM Ireland, and before assistant professor at Future University Hakodate. His research interests covers AI, graph theory, and parallel/distributed computing and search. Along with Yasushi Tanase, and at times Ayumu Nagai and Norifumi Gotoh, Akihiro Kishimoto is author of the strong Shogi program ISshogi, and is further author of the Go program Akebono (9x9). Akihiro Kishimoto was a member of the GAMES group ^[1] in the Department of Computing Science at the University of Alberta, and worked with Jonathan Schaeffer et al. on solving Checkers ^[2]. Additionally, he worked with Martin Müller on Graph History Interaction, Proof-number search and Computer Go.
Akihiro Kishimoto ^[3]

Selected Publications

Selected Publications

^[4] ^[5]

1999

Akihiro Kishimoto, Yoshiyuki Kotani (1999). Parallel AND/OR tree search based on proof and disproof numbers. 5th Game Programming Workshop

2000 ...

Akihiro Kishimoto, Jonathan Schaeffer (2002). Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling, In Proc. of 31st International Conference on Parallel Processing (ICPP'02), pages 323-330, IEEE Computer Society Press. pdf via CiteSeerX
Akihiro Kishimoto, Jonathan Schaeffer (2002). Transposition Table Driven Work Scheduling in Distributed Game-Tree Search. Fifteenth Canadian Conference on Artificial Intelligence (AI'2002), Best Paper Prize, Volume 2338 of Lecture Notes in Artificial Intelligence (LNAI), pages 56-68, Springer
Akihiro Kishimoto, Martin Müller (2003). Df-pn in Go: An Application to the One-Eye Problem. Advances in Computer Games 10, pdf.
Akihiro Kishimoto, Martin Müller (2004). A General Solution to the Graph History Interaction Problem. AAAI National Conference, pdf

2005 ...

Xiaozhen Niu, Akihiro Kishimoto, Martin Müller (2005). Recognizing Seki in Computer Go. Advances in Computer Games 11
Akihiro Kishimoto (2005). Correct and Efficient Search Algorithms in the Presence of Repetitions. Ph.D. thesis, University of Alberta, Received the 2005 ChessBase Best-Publication Award, pdf
Akihiro Kishimoto, Martin Müller (2005). A Solution to the GHI Problem for Depth-First Proof-Number Search. 7th Joint Conference on Information Sciences (JCIS2003), pp. 489 - 492, pdf » Graph History Interaction
Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2005). Solving Checkers. IJCAI 2005
Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro Kishimoto, Kenjiro Taura (2006). Monte Carlo Go Has a Way to Go. AAAI 2006, pdf
Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller. (2007). Lambda Depth-First Proof-Number Search and Its Application to Go. IJCAI 2007, pdf
Jonathan Schaeffer, Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2007). Checkers is Solved. Science, Vol. 317, no. 5844
Akihiro Kishimoto, Martin Müller (2008). About the Completeness of Depth-First Proof-Number Search. CG 2008
Akihiro Kishimoto, Alex Fukunaga, Adi Botea (2009). Scalable, Parallel Best-First Search for Optimal Sequential Planning. In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS-2009) (Best Paper Award), pages 201-208, pdf

2010 ...

Richard Anthony Valenzano, Nathan Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto (2010). Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. ICAPS 2010: 177-184, pdf
Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa (2011). Scalable Distributed Monte Carlo Tree Search. SoCS2011, pdf
Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda (2011). Accelerated UCT and Its Application to Two-Player Games. Advances in Computer Games 13
Akihiro Kishimoto, Mark Winands, Martin Müller, Jahn-Takeshi Saito (2012). Game-Tree Search using Proof Numbers: The First Twenty Years. ICGA Journal, Vol. 35, No. 3
Kunihito Hoki, Tomoyuki Kaneko, Akihiro Kishimoto, Takeshi Ito (2013). Parallel Dovetailing and its Application to Depth-First Proof-Number Search. ICGA Journal, Vol. 36, No. 1 ^[6]
Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato (2013). Shared-Memory Parallel Frontier-Based Search. WALCOM 2013

External Links

References

What links here?

Page	Date Edited
10th Computer Olympiad	Jul 22, 2017
11th Computer Olympiad	Jul 22, 2017
7th Computer Olympiad	Jul 23, 2017
8th Computer Olympiad	Jul 22, 2017
Adi Botea	Jan 22, 2018
Advances in Computer Games 10	Dec 30, 2016
Advances in Computer Games 11	Dec 27, 2016
Advances in Computer Games 13	Jan 7, 2017
Akihiro Kishimoto	Jan 22, 2018
Ayumu Nagai	Dec 31, 2013
CG 2008	Jan 3, 2017
Checkers	Dec 23, 2017
ChessBase Best-Publication Awards to Include	Jan 7, 2017
Depth-First	Jun 25, 2016
Go	Jan 24, 2018
Graph History Interaction	Oct 16, 2017
Haruhiro Yoshimoto	Jun 25, 2013
Havannah	Jan 8, 2017
ICGA Journal	Dec 21, 2017
ICGA Journal Awards to Include	May 21, 2015
Jahn-Takeshi Saito	Jan 2, 2017
Jonathan Schaeffer	Jan 29, 2018
Junichi Hashimoto	Jan 4, 2017
Kazuki Yoshizoe	May 23, 2016
Kokolo Ikeda	Mar 15, 2016
Kunihito Hoki	Jul 9, 2016
Mark Winands	Sep 19, 2017
Martin Müller	Aug 12, 2017
Monte-Carlo Tree Search	Apr 26, 2018
Nathan Sturtevant	Oct 23, 2015
Neil Burch	Jan 10, 2018
Parallel Search	Dec 30, 2017
Paul Lu	Dec 13, 2016
People	Feb 28, 2018
Planning	Feb 12, 2018
Proof-number search	Jan 22, 2018
Repetitions	Jan 16, 2018
Rob Lake	Dec 5, 2016
Search	Feb 1, 2018
Shogo Takeuchi	Jun 16, 2016
Steve Sutphen	Jan 3, 2014
Takeshi Ito	Jan 6, 2017
Tomoyuki Kaneko	Oct 25, 2017
UCT	Jan 22, 2018
University of Alberta	Feb 20, 2018
Yasushi Tanase	Jan 1, 2017
Yngvi Björnsson	Jun 26, 2017
Yoshiyuki Kotani	Dec 27, 2016

Up one level

Wikispaces : chessprogramming - items matching description

A. Harry Klopf

Table of Contents

Selected Publications

1970 ...

1980 ...

1990 ...

2000 ...

References

What links here?

Aamir Syed

Table of Contents

Selected Publications

External Links

References

What links here?

Aaron Becker

Table of Contents

Selected Publications

Forum Posts

External Links

References

What links here?

Aaron L. Futer

Table of Contents

Selected Publications

See also

External Links

References

What links here?

Aaron Tay

Table of Contents

Forum Posts

External Links

References

What links here?

Aart Bik

Table of Contents

Compiler Architect

Java Compiler

Vectorization

Selected Publications

Forum Posts

2005 ...

2010 ...

2015 ...

External Links

References

What links here?

Abdallah Saffidine

Table of Contents

Selected Publications

2009

2010 ...

2015 ...

External Links

References

What links here?

Abdul Mateen Khan

Table of Contents

Engines

References

What links here?

Abdullah Al-Ghaznawi

Table of Contents

External Links

References

What links here?

Adam Berent

References

What links here?

Adam Hair

Table of Contents

Selected Publications

Forum Posts

External Links

References

What links here?

Adam Kujawski

Table of Contents