What is it about?
The search processes range from minimax to alpha beta search. Many search enhancements are discussed, such as hash tables, killer heuristics. Moreover proof-number search is dealt with as is Monte Carlo Tree Search.
Featured Image
Why is it important?
The increase of the playing strength is most remarkable of all, with as milestones: (1) the defeat of the human world champion, (2) the defeat of the computer world champion machine by a deep-learning machine.
Perspectives
On the longer run, the paper provides a wonderful insight into the raise of the playing strength and the use of supercomputers.
h. jaap van den herik
Universiteit Leiden
Read the Original
This page is a summary of: Computer chess: From idea to DeepMind1, ICGA Journal, March 2019, IOS Press,
DOI: 10.3233/icg-180075.
You can read the full text:
Contributors
The following have contributed to this page
