Abstract
It would be easy to imagine that at this 6th World Computer Chess Championship we shall learn more about how well today’s computer programs play chess. What we will actually learn is more restricted, although none-the-less interesting, namely: How well do today’s chess programs play against each other? Levy (1986a) has written:
One of the unique aspects of programming a computer to play chess is the fact that concrete methods exist for calibrating the success or failure of the program.
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 a revised and updated version of “Brute Force in Chess and Science,” Procs. COPS Conference, Edmonton, May 1989, pp. 82–111. Also, Journal of the International Computer Chess Association, vol 12, no. 3, pp. 127–143. It is reproduced here with the permission of the Canadian Information Processing Society and the International Computer Chess Association.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this paper
Cite this paper
Michie, D. (1990). Brute Force in Chess and Science. 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_15
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9080-0_15
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