Experiments in Distributed Game-Tree Searching
Jonathan Schaeffer · ICGA Journal · 1987
three catagories of possible errors, each with its own cause and each with a different level of solvability.Shapiro and Michie describe a self-commenting facility whereby expert-supplied text fragments attached to individual attributes are recognized to form run-time explanations of decisions made by rules previously induced.A theoretical paper is given by Schrllfer.He analyses the apparent paradox that experience shows that a deeper tree-search yields better play, whereas mathematical investigation of the problem predicts less reliable results for deeper searches.The majority of the articles is very original, and of high quality.The amount of background knowledge needed to comprehend the papers ranges from the elementary (Levy, Kopec, Hartson, and Lindner) to the sophisticated (Schrllfer).It is a superb book for its contents as well as for its design.Like its three predecessors, it is an excellent snapshot of the state of the art in Computer-Chess research, a must for anyone seriously interested in the field.