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

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

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

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

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

Alan Blair

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

Home * People * Alan Blair

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

Selected Publications

External Links

References

What links here?

Selected Publications

^[7] ^[8]

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

External Links

References

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

What links here?

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

Up one level

Alan H. Bond

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

Home * People * Alan H. Bond

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

Photos

Selected Publications

Photos

Alan Bond at Pittsburgh Zoo: 1966 ^[7]

Selected Publications

^[8] ^[9]

1968

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

1970 ...

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

1980 ...

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

1990 ...

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

2000 ...

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

External Links

Books

Other Alan Bonds

from Wikipedia:

References

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

What links here?

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

Up one level

Alan Kotok

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

Home * People * Alan Kotok

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

Selected Publications

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

External Links

Alan Kotok from Wikipedia
Welcome to the Web site of Alan Kotok
Tech Model Railroad Club from Wikipedia
Alan Kotok from The Computer History Museum
The Mouse That Roared: PDP-1 Celebration Event Lecture, May 15, 2006, (1:53:44) Mountain View, CA, USA: © 2006, The Computer History Museum. Panel discussion including Alan Kotok (53:50-1:08:40) ^[5] and John McCarthy (1:27:20), moderated by Edward Fredkin from 17:40, YouTube Video

References

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

What links here?

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

Up one level

Alan Turing

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

Home * People * Alan Turing

		Alan Mathison Turing, (23 June 1912–7 June 1954) was an English mathematician, logician, and cryptographer. Alan Turing was based at Bletchley Park ^[1], Bletchley in Buckinghamshire, while acting as the leading cryptanalyst of German ciphers during the World War II. He was the central force in continuing to break the Enigma machine ^[2] ^[3] ^[4] ^[5] ^[6], and to crack the Lorenz cipher (codenamed "Tunny") ^[7]. Alan Turing was one of the pioneers of the information theory and computer science. He was highly influential in its development, giving a formalization of the concepts of "algorithm" and "computation" with the Turing machine, which can be considered a model of a general purpose computer ^[8].
Alan Turing ^[9]

Photos

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

Turing Machine

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

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

Turing Test

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

Chess and Go

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

Could one make a machine?

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

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

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

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

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

Andrew Hodges

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

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

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

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

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

Jack Good

Jack Good in 1998 ^[21]:

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

Punishment and Death

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

Selected Publications

^[24]

1936 ...

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

1940 ...

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

1950 ...

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

1990 ...

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

2000 ...

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

2010 ...

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

Forum Posts

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

External Links

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

Turing Machine

Devices and Computers

Turing Test

Turing Archive

Andrew Hodges

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

Literature

Turing Year 2012

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

Movies

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

References

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

What links here?

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

Up one level

Albert Xin Jiang

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

Home * People * Albert Xin Jiang

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

Selected Publications

External Links

References

What links here?

Selected Publications

^[3] ^[4]

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

External Links

References

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

What links here?

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

Up one level

Albert Zobrist

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

Home * People * Albert Zobrist

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

Computer Chess

Selected Publications

External Links

References

What links here?

Computer Chess

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

Selected Publications

^[7] ^[8]

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

External Links

References

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

What links here?

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

Up one level

Alberto Maria Segre

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

Home * People * Alberto Maria Segre

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

Selected Publications

External Links

References

What links here?

Selected Publications

^[3]

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

External Links

References

What links here?

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

Up one level

Albrecht Heeffer

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

Home * People * Albrecht Heeffer

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

Photos

Selected Publications

Photos



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

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

Selected Publications

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

1984

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

1985 ...

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

1995 ...

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

2000 ...

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

2005 ...

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

2010 ...

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

External Links

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

References

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

What links here?

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

Up one level

Alejandro González Romero

GerdIsenberg — Tue, 07 Feb 2017 20:35:16 GMT

Home * People * Alejandro González Romero

		Alejandro González Romero, a Mexican computer scientist affiliated with the Barcelona School of Informatics (Facultat d'Informàtica de Barcelona, FIB) of Polytechnic University of Catalonia, Barcelona, Spain, and before with the University of Edinburgh and the National Autonomous University of Mexico. His research interests include artificial intelligence, computer chess and Scrabble. Alejandro González operated FIBChess by primary author Guillermo Baches García during the WCCC 2004.
Alejandro González Romero ^[1]

Selected Publication

^[2]

2004 ...

Alejandro González Romero, René Alquézar (2004). Learning Through the KRKa2 Chess Ending. CIARP 2004
Alejandro González Romero, René Alquézar (2004). To Block or Not to Block? IBERAMIA 2004
Alejandro González Romero (2005). King Race. Advances in Computer Games 11 ^[3]
René Alquézar, A. Gonzalez Camargo, Alejandro González Romero (2006). Evolving Plans for the KRKa2 Chess Ending. Artificial Intelligence and Applications 2006
Alejandro González Romero, René Alquézar (2008). Building Policies for Scrabble. CCIA 2008 ^[4]
Arturo Ramírez, Francisco González Acuña, Alejandro González Romero, René Alquézar, Enric Hernández, Amador Roldán Aguilar, Ian García Olmedo (2009). A Scrabble Heuristic Based on Probability That Performs at Championship Level. MICAI 2009

2010 ...

Alejandro González Romero, René Alquézar, Arturo Ramírez Flores, Francisco González Acuña (2012). Heuristics and Fishing in Scrabble. ECAI CGW 2012

External Links

Alejandro Gonzalez Romero | LinkedIn

References

^ Image clipped from the WCCC 2004 group photo, Computer Games events at Ban-Ilan University (ICGA Images)
^ DBLP: Alejandro González Romero
^ King Race from Refdoc.fr
^ Building Policies for Scrabble from ACM Portal

What links here?

Page	Date Edited
Advances in Computer Games 11	Dec 27, 2016
Alejandro González Romero	Feb 7, 2017
ECAI CGW 2012	May 21, 2015
FibChess	Jan 7, 2016
Learning	Feb 20, 2018
People	Feb 28, 2018
Planning	Feb 12, 2018
University of Edinburgh	Nov 26, 2017
WCCC 2004	Jan 28, 2018

Up one level

Aleksander Sadikov

GerdIsenberg — Mon, 02 Jan 2017 16:47:19 GMT

Home * People * Aleksander Sadikov

		Aleksander Sadikov, a Slovenian computer scientist and researcher at the Artificial Intelligence Laboratory University of Ljubljana. His research interests covers search techniques in AI, heuristic evaluation functions, computer game-playing, and automated explanation / tutoring systems.
Aleksander Sadikov ^[1]

Selected Publications

Selected Publications

^[2] ^[3]

2000 ...

Aleksander Sadikov, Ivan Bratko, Igor Kononenko (2003). Search versus Knowledge: An Empirical Study of Minimax on KRK. Advances in Computer Games 10, pdf

2005 ...

Aleksander Sadikov (2005). Propagation of Heuristic Evaluation Errors in Game Graphs. Doctoral dissertation, University of Ljubljana
Aleksander Sadikov, Ivan Bratko, Igor Kononenko (2005). Bias and pathology in minimax search. Theoretical Computer Science, Volume 349, Issue 2, pdf
Aleksander Sadikov, Martin Možina, Matej Guid, Jana Krivec, Ivan Bratko (2006). Automated Chess Tutor. CG 2006
Aleksander Sadikov, Ivan Bratko (2006). Search Versus Knowledge Revisited Again. CG 2006
Aleksander Sadikov, Ivan Bratko (2007). Solving 20x20 Puzzles. CGW 2007
Matej Guid, Martin Možina, Jana Krivec, Aleksander Sadikov, Ivan Bratko (2008). Learning Positional Features for Annotating Chess Games: A Case Study. CG 2008, pdf
Martin Možina, Matej Guid, Jana Krivec, Aleksander Sadikov, Ivan Bratko (2008). Fighting Knowledge Acquisition Bottleneck with Argument Based Machine Learning. 18th European Conference on Artificial Intelligence (ECAI 2008), Patras, Greece. pdf

2010 ...

Matej Guid, Martin Možina, Aleksander Sadikov, Ivan Bratko (2010). Deriving Concepts and Strategies from Chess Tablebases. Advances in Computer Games 12, pdf
Matej Guid, Martin Možina, Ciril Bohak, Aleksander Sadikov, Ivan Bratko (2013). Building an Intelligent Tutoring System for Chess Endgames. CSEDU 2013

External Links

References

What links here?

Page	Date Edited
Advances in Computer Games 10	Dec 30, 2016
Advances in Computer Games 12	Jan 5, 2017
Aleksander Sadikov	Jan 2, 2017
Bad bishop	Jun 22, 2015
CG 2006	Dec 28, 2016
CG 2008	Jan 3, 2017
CGW 2007	Jan 2, 2017
Endgame	Sep 18, 2017
Endgame Tablebases	Mar 6, 2018
Igor Kononenko	May 23, 2016
Ivan Bratko	Aug 16, 2017
Jana Krivec	Jul 15, 2017
KBNK Endgame	Nov 26, 2016
Knowledge	Jul 22, 2017
KRK	Nov 26, 2016
Learning	Feb 20, 2018
Martin Možina	Jun 11, 2016
Matej Guid	Jan 6, 2018
People	Feb 28, 2018
Search Pathology	Nov 26, 2017
University of Ljubljana	Aug 5, 2015

Up one level

Aleš Zamuda

GerdIsenberg — Tue, 19 Jan 2016 14:32:41 GMT

Home * People * Aleš Zamuda

		Aleš Zamuda, a Slovenian computer scientist and teaching assistant at Computer Architecture and Languages Laboratory ^[1], Institute of Computer Science ^[2] at University of Maribor, where he received his B.Sc., M.Sc., and Ph.D. degrees in 2006, 2008, and 2012, respectively. His research interests include multi-objective optimization, genetic programming, differential evolution, artificial life, and computer animation. As games programmer, Aleš is author of the open source chess program QuTeChess under the GNU General Public License ^[3].
Aleš Zamuda ^[4]

Selected Publications

Selected Publications

^[5]

2007 ...

Aleš Zamuda, Janez Brest, Borko Bošković, Viljem Žumer (2007). Differential Evolution for Multiobjective Optimization with self Adaptation. IEEE Congress on Evolutionary Computation 2007, pdf
Janez Brest, Aleš Zamuda, Borko Bošković, Sašo Greiner, Viljem Žumer (2008). An Analysis of the Control Parameters’ Adaptation in DE. Advances in Differential Evolution, Studies in Computational Intelligence, ISBN: 978-3-540-68827-3
Borko Bošković, Sašo Greiner, Janez Brest, Aleš Zamuda, Viljem Žumer (2008). An Adaptive Differential Evolution Algorithm with Opposition-Based Mechanisms, Applied to the Tuning of a Chess Program. Advances in Differential Evolution, Studies in Computational Intelligence, ISBN: 978-3-540-68827-3

2010 ...

Borko Bošković, Janez Brest, Aleš Zamuda, Sašo Greiner, Viljem Žumer (2011). History mechanism supported differential evolution for chess evaluation function tuning. Soft Computing, Vol. 15, No. 4
Aleš Zamuda, Janez Brest, Borko Bošković, Viljem Žumer (2011). Differential Evolution for Parameterized Procedural Woody Plant Models Reconstruction. Applied Soft Computing, Vol. 11, No. 8, pdf preprint ^[6]
Aleš Zamuda (2012). Differential Evolution for Parameterized Procedural Woody Plant Models Reconstruction. Ph.D. thesis. Faculty of Electrical Engineering and Computer Science, University of Maribor
Aleš Zamuda, Janez Brest (2014). Vectorized Procedural Models for Animated Trees Reconstruction using Differential Evolution. Information Sciences, Vol. 278, pdf

External Links

References

What links here?

Page	Date Edited
Aleš Zamuda	Jan 19, 2016
Automated Tuning	Feb 27, 2018
BBChess (SI)	Jan 12, 2015
Borko Bošković	May 23, 2016
Genetic Programming	Dec 26, 2017
Janez Brest	May 23, 2016
People	Feb 28, 2018
QuTeChess	May 7, 2012
Sašo Greiner	May 23, 2016
University of Maribor	Nov 10, 2016
Viljem Žumer	May 23, 2016

Up one level

Alessandro Cincotti

GerdIsenberg — Sat, 23 Jan 2016 14:56:37 GMT

Home * People * Alessandro Cincotti

		Alessandro Cincotti, an Italian computer scientist and Assistant Professor at Japan Advanced Institute of Science and Technology (JAIST). He holds a Ph.D. from University of Catania, and starts postdoctoral research at JAIST in 2005. His research interests include Combinatorial game theory, surreal numbers, and Multi-player combinatorial games, such as N-player partizan games.
Alessandro Cincotti ^[1]

Selected Publications

^[2]

Alessandro Cincotti (2006). Counting the Number of Three-Player Partizan Cold Games. CG 2006
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
Alessandro Cincotti (2010). The Game of Synchronized Quadromineering. International Journal of Computational and Mathematical Sciences 4:4 2010, pdf
Alessandro Cincotti (2010). N-player partizan games. Theoretical Compututer Science, Vol. 411, No. 34-36, doi: 10.1016/j.tcs.2010.05.018
Yuichiro Sato, Alessandro Cincotti, Hiroyuki Iida (2012). An Analysis of Voting Algorithm in Games. ECAI CGW 2012
Taichi Ishitobi, Alessandro Cincotti, Hiroyuki Iida (2013). Shape-Keeping Technique and Its Application to Checkmate Problem Composition. 2013 AIIDE Workshop

External Links

JAIST School of Information Science, Alessandro Cincotti, Assistant Professor

References

What links here?

Page	Date Edited
Alessandro Cincotti	Jan 23, 2016
CG 2006	Dec 28, 2016
CG 2008	Jan 3, 2017
Checkmate	Apr 13, 2018
ECAI CGW 2012	May 21, 2015
Games	Feb 20, 2018
Hiroyuki Iida	Aug 11, 2017
JAIST	Jan 23, 2016
People	Feb 28, 2018
Taichi Ishitobi	Jan 23, 2016

Up one level

Alex B. Meijer

GerdIsenberg — Sun, 31 Aug 2014 10:32:32 GMT

HUGO

Selected Publications

External Links

References

What links here?

Home * People * Alex B. Meijer

Alex B. Meijer,
a Dutch computer scientist and AI researcher, in 2007 affiliated with the Department of Medical Decision Making, Leiden University ^[1], and before with the Delft University of Technology as member of the Knowledge Based Systems Group ^[2], where he along with Henk Koppelaar, worked and published on learning and planning in Go.

HUGO

A learning architecture for the game of Go, Abstract ^[3]:

In this paper, a three-component architecture of a learning environment for Go is sketched, which can be applied to any two-player, deterministic, full information, partizan, combinatorial game. The architecture called HUGO has natural and human-like reasoning components. Its most abstract component deals with the selection of subgames of Go. The second component is concerned with initiative. The notion of gote no sente (a move that loses initiative but creates new lines of play that will hold initiative) is formalized. In the third component, game values are computed with a new kind of alpha-beta algorithm based on fuzzy, partial ordering. Our approach leaves some valuable control parameters and others ways to apply further machine learning techniques.

Selected Publications

Alex B. Meijer, Henk Koppelaar (2001). A learning architecture for the game of Go. Game-On 2001
Alex B. Meijer, Henk Koppelaar (2001). Pursuing abstract goals in the game of Go. BNAIC 2001
Alex B. Meijer, Henk Koppelaar (2003). Towards Multi-Objective Game Theory - with Application to Go. Game-On 2003, pdf
Alex B. Meijer (2007). A Methodology for Automated Extraction of the Optimal Pathways from Influence Diagrams. Artificial Intelligence in Medicine

External Links

Knowledge Based Systems Group, TU Delft

References

What links here?

Page	Date Edited
Alex B. Meijer	Aug 31, 2014
Delft University of Technology	Feb 4, 2018
Go	Jan 24, 2018
Henk Koppelaar	Aug 31, 2014
Learning	Feb 20, 2018
Leiden University	Jul 5, 2016
People	Feb 28, 2018
Planning	Feb 12, 2018

Up one level

Alex Bell

GerdIsenberg — Wed, 01 Mar 2017 10:57:28 GMT

Home * People * Alex Bell

		Alex G. Bell, a British computer scientist and early computer chess and game programmer from Manchester University and Atlas Computer Laboratory. Bell started chess and games programming in the early 60s, initially working for Nils Barricelli and his chess program for symbio-organisms research. He also wrote his own programs for Kalah and Chess, which was called Atlas. Alex Bell published various papers about those topics, his 1972 book Games Playing with Computers is a real quarry and covers a broad range of basic AI-algorithms and games. Fortunately, thanks to the Rutherford Appleton Laboratory (RAL) archive, it is available online ^[1], as well as other valuable resources quoted here in the chess programming wiki. In the 70s Atlas evolved to Master in collaboration with Peter Kent, John Birmingham and chess expert John Waldron. Alex Bell was further involved to establish computer chess conferences .
Alex and Margaret Bell 1965 ^[2]

Photos

Atlas

Master

Computer Chess Conferences

Selected Publications

External Links

References

What links here?

Photos

Chess on the 360/195. Alex Bell, Geoff Lambert, Peter Kent, John Birmingham and John Waldron ^[3]

Atlas

In 1962, when Bell was at Manchester University, Nils Barricelli arrived there with the intention to write a chess program for the Atlas Computer, which would be used to study certain theories of evolution. Alex Bell was hired by Atlas Computer Laboratory at Chilton site, Oxfordshire for the purpose to write a list legal moves generator for Barricelli's project. Bell later reproduced the Barricelli chess program in Algol with quite a good user interface.

Master

When Alex Bell left Atlas Laboratory in 1969, his fellow Peter Kent took over his code. In 1973 after Alex' return, he joined forces with Peter and John Birmingham from Harwell to work on the chess playing program Master (Minimax algorithm Tester), which competed at the First World Computer Chess Championship 1974 in Stockholm ^[4]. Alex left Chilton a second time and moved to CSIRO in Canberra in 1975, and Master played the following World Computer Chess Championships, WCCC 1977 and WCCC 1980 with Peter Kent and John Birmingham as sole authors ^[5].

Computer Chess Conferences

Alex Bell was initiator and co-organizer of the two first computer chess conferences in 1973 and 1975, while the latter became the Advances in Computer Chess 1 conference ^[6].

Selected Publications

^[7]

Alex Bell (1968). Kalah on Atlas. Literature: Reports hosted by Atlas Computer Laboratory
Alex Bell (1970). How to program a computer to play legal chess, The Computer Journal, May 1970
Alex Bell (1970). Partitioning Integers in N dimensions, The Computer Journal, Vol. 13, No. 3, pp. 278-83
Alex Bell (1972). Games Playing with Computers. Allen & Unwin, index
Alex Bell (1973). Himmelbett. The Computer Journal, Vol. 16, No. 3, Literature: Reports hosted by Atlas Computer Laboratory
Alex Bell (ed.) (1973). Computer Chess. Proceedings May 1973 Meeting on chess playing by computer. Science Research Council, Atlas Computer Laboratory
Alex Bell (1978). The Machine Plays Chess. Pergamon Press, from amazon

Alex Bell, N. Jacobi (1979). How to read, make and store chess moves. The Computer Journal Vol. 22, No. 1, 71-75
Alex Bell (1983). Chess for three gives the White Knight a winning gambit. The Micro User Magazine, December 1983 » White Knight

External Links

Alex Bell from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)

References

^ Games Playing with Computers
^ Alex Bell from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
^ Slide 28: 23.08.74 to 01.11.74 from Rutherford's Photographic Section for the Atlas Computer Laboratory
^ Alex Bell (1978). MASTER at IFIPS. from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL), excerpt from Alex Bell (1978). The Machine Plays Chess. Pergamon Press, from amazon
^ Master's ICGA Tournaments
^ 1975 Press Releases - Techniques for playing the end game from Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
^ Games Playing with Computers - References

What links here?

Page	Date Edited
8x8 Board	Aug 29, 2017
Advances in Computer Chess 1	Oct 22, 2015
Alan H. Bond	Oct 7, 2014
Alex Bell	Mar 1, 2017
Alpha-Beta	Jan 28, 2018
Array	Dec 1, 2016
Atlas	Nov 5, 2017
Atlas (ESP)	Jan 28, 2018
Atlas Computer Laboratory	Feb 10, 2015
Barbara Liskov	Oct 30, 2014
BBC Micro	Dec 16, 2016
Board Representation	Dec 11, 2017
CHAOS	Dec 28, 2017
Cognition	Dec 8, 2017
Dietrich Prinz	Oct 14, 2016
Donald Michie	Dec 23, 2017
Engines	Mar 10, 2018
Freedom	Dec 28, 2017
Games	Feb 20, 2018
Hans Berliner	Jun 10, 2017
Huberman	Aug 9, 2013
IBM 360	Jan 2, 2016
John Birmingham	Jan 7, 2016
John J. Scott	Aug 30, 2016
John Waldron	Aug 25, 2014
Kalah	Dec 22, 2016
Lancaster	Aug 30, 2016
Mailbox	Apr 14, 2018
Martin Bryant	Dec 11, 2016
Master	Dec 28, 2017
Mate-in-two	Oct 14, 2016
Minimax	Dec 29, 2017
Move Generation	Jan 29, 2018
Moves	Feb 19, 2018
Nils Barricelli	Nov 29, 2017
People	Feb 28, 2018
Peter Kent	Jan 7, 2016
Piece-Lists	Feb 13, 2017
Recommended Reading	Nov 17, 2017
Ron Atkin	Oct 26, 2016
Soei Tan	Oct 27, 2012
Table-driven Move Generation	Feb 19, 2017
University of Manchester	May 24, 2017
WCCC 1974	Jan 19, 2018
WCCC 1980	Dec 25, 2017
White Knight	Dec 12, 2016
wiedza-zebine : nb_Nils_Aall_Barricelli	Apr 29, 2010

Up one level

Alex de Voogt

GerdIsenberg — Sat, 09 Aug 2014 08:37:02 GMT

Home * People * Alex de Voogt

		Alexander Johan (Alex) de Voogt, a Dutch psychologist, curator in African Ethnology at American Museum of Natural History ^[1], until 2009 assistant professor at Leiden and Maastricht University. De Voogt researched and published on diverse topics as seventh century Islam, Nubian architecture, and the history of writing systems ^[2], and is renowned Mancala game researcher holding a Ph.D. on Bao mastership from Leiden University ^[3]. He is member of the International Society for Board Game Studies ^[4] and is editor of its journal ^[5].
Alex de Voogt ^[6]

Selected Publications

External Links

References

What links here?

Selected Publications

^[7]

Alex de Voogt (1995). Limits of the Mind: Towards a Characterisation of Bao Mastership. Ph.D. Thesis, CNWS Publications
Jeroen Donkers, Alex de Voogt, Jos Uiterwijk (2000). Human versus Machine Problem Solving: Winning Openings in Dakon. Accepted for publication in Board Games studies.
Johan Weststeijn and Alex de Voogt (2002). Sa‘id bin Gubayr: piety, chess and rebellion. Arabica, Journal of Arabic and Islamic Studies 49(3):383–386 ^[8]
Alex de Voogt (2002). Reproducing board game positions: Western Chess and African Bao. Swiss Journal of Psychology, Vol 61, No. 4
Jeroen Donkers, Jos Uiterwijk, Alex de Voogt (2002). Mancala Games - Topics in Artificial Intelligence and Mathematics. In Jean Retschitzki, Rosita Haddad-Zubel (eds.) (2002). Step by step. Proceedings of the 4th colloquium Board games in academia. Edition Universitaires Fribourg Suisse
Alex de Voogt (2003). Muyaka's poetry in the history of Bao. Bulletin of the School of Oriental and African Studies, Vol. 66, No. 1
Fernand Gobet, Alex de Voogt, Jean Retschitzki (2004). Moves in Mind: The Psychology of Board Games. ISBN 1-84169-336-7, amazon.com
Alex de Voogt (2005). A Question of Excellence - a century of African masters. Africa World Press: Trenton, New Jersey
Tom Kronenburg, Jeroen Donkers, Alex de Voogt (2006). Never-Ending Moves in Bao. ICGA Journal, Vol. 29, No. 2, pdf
Johan Weststeijn, Alex de Voogt (2007). Dreams in Tabari: Husayn, Jubayr, and those in God’s favor in the Umayyad period. Le Muséon: Revue d’études orientales 120(1): 225–29 ^[9] ^[10]

External Links

References

^ Faculty - Alex de Voogt - Richard Gilder Graduate School - American Museum of Natural History
^ AMNH Expeditions: Our Experts
^ Alex de Voogt (1995). Limits of the Mind: Towards a Characterisation of Bao Mastership. Ph.D. Thesis, CNWS Publications
^ Board Game Studies
^ International Journal for the Study of Board Games
^ AMNH Expeditions: Our Experts
^ Alex de Voogt - CV - Selected Publications (pdf)
^ Sa'id ibn Jubayr from Wikipedia
^ Husayn ibn Ali from Wikipedia
^ Umayyad Caliphate from Wikipedia

What links here?

Page	Date Edited
Alex de Voogt	Aug 9, 2014
Bao	Dec 23, 2016
Chess Position	Sep 10, 2017
Cognition	Dec 8, 2017
Fernand Gobet	May 11, 2017
Games	Feb 20, 2018
ICGA Journal	Dec 21, 2017
Jean Retschitzki	Jul 1, 2014
Jeroen Donkers	Dec 23, 2016
Jos Uiterwijk	Aug 11, 2017
Leiden University	Jul 5, 2016
Maastricht University	May 15, 2017
People	Feb 28, 2018
Rosita Haddad-Zubel	Aug 7, 2013

Up one level

Wikispaces : chessprogramming - items matching description

A. Harry Klopf

Table of Contents

Selected Publications

1970 ...

1980 ...

1990 ...

2000 ...

References

What links here?

Aaron Becker

Table of Contents

Selected Publications

Forum Posts

External Links

References

What links here?

Abdallah Saffidine

Table of Contents

Selected Publications

2009

2010 ...

2015 ...

External Links

References

What links here?

Adi Botea

Table of Contents

Selected Publications

External Links

References

What links here?

Akihiro Kishimoto

Table of Contents

Selected Publications

1999

2000 ...

2005 ...

2010 ...

External Links

References

What links here?

Alan Blair

Table of Contents

Selected Publications

External Links

References

What links here?

Alan H. Bond

Table of Contents

Photos

Selected Publications

1968

1970 ...

1980 ...

1990 ...

2000 ...

External Links

Books

Other Alan Bonds

References

What links here?

Alan Kotok

Table of Contents

See also

Selected Publications

External Links

References

What links here?

Alan Turing

Table of Contents

Photos

Turing Machine

Turing Test

Chess and Go

Could one make a machine?

Andrew Hodges

Jack Good

Punishment and Death

See also