The Use of Domain-Dependent Descriptions in Tree Searching
暂无分享，去创建一个
[1] Eliot Slater,et al. Statistics for the chess computer and the factor of mobility , 1953, Trans. IRE Prof. Group Inf. Theory.
[2] Allen Newell,et al. The chess machine: an example of dealing with a complex task by adaptation , 1955, AFIPS '55 (Western).
[3] Elwyn R. Berlekamp,et al. Program for Double-Dummy Bridge Problems—A New Strategy for Mechanical Game Playing , 1963, JACM.
[4] Donald E. Eastlake,et al. The Greenblatt chess program , 1967, AFIPS '67 (Fall).
[5] James R. Slagle,et al. Experiments With Some Programs That Search Game Trees , 1969, JACM.
[6] Kathryn T. Spoehr,et al. The direct measurement of hypothesis-sampling strategies , 1973 .
[7] H. Simon,et al. Perception in chess , 1973 .
[8] Hans J. Berliner,et al. Some Necessary Conditions for a Master Chess Program , 1973, IJCAI.
[9] Larry R. Harris. The Bandwidth Heuristic Search , 1973, IJCAI.
[10] Hans J. Berliner,et al. Chess as problem solving: the development of a tactics analyzer. , 1975 .
[11] Donald E. Knuth,et al. The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.
[12] G. M. Adelson-Velskiy,et al. Some Methods of Controlling the Tree Search in Chess Programs , 1975, Artif. Intell..