Back to Search Start Over

COKO III: The Cooper-Koz Chess Program.

Authors :
Kozdrowicki, Edward W.
Cooper, Dennis W.
Lawson, C. L.
Source :
Communications of the ACM; Jul1973, Vol. 16 Issue 7, p411-427, 17p, 21 Diagrams
Publication Year :
1973

Abstract

COKO III is a chess player written entirely in Fortran. On the IBM 360-65, COKO III plays a minimal chess game at the rate of .2 sec cpu time per move, with a level close to lower chess club play. A selective tree searching procedure controlled by tactical chess logistics allows a deploy merit of multiple minimal game calculations to achieve some optimal move selection. The tree searching algorithms are the heart of COKO's effectiveness, yet they are conceptually simple. in addition, an interesting phenomenon called a tree searching, catastrophe has plagued COKO's entire development just as it troubles a human player. Standard exponential growth is curbed to a large extent by the definition and trimming of the Fischer set. A clear distinction between tree pruning and selective tree searching is also made. Representation of the chess environment is described along with a strategical preanalysis procedure that maps the Lasker regions. Specific chess algorithms are described which could be used as a command structure by anyone desiring to do some chess program experimentation. A comparison is made of some mysterious actions of human players and COKO III. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
00010782
Volume :
16
Issue :
7
Database :
Complementary Index
Journal :
Communications of the ACM
Publication Type :
Periodical
Accession number :
5263830
Full Text :
https://doi.org/10.1145/362280.362288