๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Chess-Playing Programs and the Problem of Complexity

โœ Scribed by Newell, Allen; Shaw, J. C.; Simon, H. A.

Book ID
115459263
Publisher
IBM
Year
1958
Tongue
English
Weight
876 KB
Volume
2
Category
Article
ISSN
0018-8646

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Measuring the performance potential of c
Measuring the performance potential of chess programs
โœ Hans J. Berliner; Gordon Goetsch; Murray S. Campbell; Carl Ebeling ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 715 KB

Chess programs can differ in depth of search or in the evaluation function applied to leaf nodes or both. Over the past 10 years, the notion that the principal way to strengthen a chess program is to improve its depth of search has held sway. Improving depth of search undoubtedly does improve a prog

Some methods of controlling the tree sea
Some methods of controlling the tree search in chess programs
โœ G.M. Adelson-Velskiy; V.L. Arlazarov; M.V. Donskoy ๐Ÿ“‚ Article ๐Ÿ“… 1975 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 982 KB

This paper describes several tree search methods that have been implemented in our chess playing program (KAISSA) and some perspectives on this domain. The most general and most flexible method of program organization is exhaustive search with cutoffs. Therefore our program is based on searching exh