Abstract
A chess program has been developed which plays good chess (for a program) using a very simple structure. It is based on a brute force search of the move tree with no forward pruning, using material as the only terminal evaluation function, and using a limited positional analysis at the top level for a tiebreak between moves which are materially equal Because of the transparent structure, this program is proposed as a technological benchmark for chess programs which will continue to improve as computer technology increases.
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.
Editor information
Rights and permissions
Copyright information
© 1988 David Levy
About this chapter
Cite this chapter
Gillogly, J.J. (1988). The Technology Chess Program. In: Levy, D. (eds) Computer Chess Compendium. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1968-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1968-0_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-1970-3
Online ISBN: 978-1-4757-1968-0
eBook Packages: Springer Book Archive