Abstract
The twenty-four positions of the Bratko-Kopec test (Kopec and Bratko 1982) represent one of several attempts to quantify the playing strength of chess computers and human subjects. Although one may disagree with the choice of test set, question its adequacy and completeness and so on, the fact remains that the designers of computer-chess programs still do not have an acceptable means of estimating the performance of chess programs, without resorting to time-consuming and expensive “matches” against other subjects. Clearly there is considerable scope for improvement, as the success of test sets in related areas like pattern recognition attest.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
This chapter is an expanded version of a paper in the New Directions in Game-Tree Search Workshop proceedings, T.A. Marsland (ed.), Edmonton, May 1989, pp. 135–139. Later it appeared in the Journal of the International Computer Chess Association, vol. 13, no. 1, pp. 15–19.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this paper
Cite this paper
Marsland, T.A. (1990). The Bratko-Kopec Test Revisited. In: Marsland, T.A., Schaeffer, J. (eds) Computers, Chess, and Cognition. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9080-0_13
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9080-0_13
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9082-4
Online ISBN: 978-1-4613-9080-0
eBook Packages: Springer Book Archive