Abstract
The game of chess has been in use as a testing ground for artificial intelligence research for over thirty years. Recent research into computer chess has focused on endgames. Programming the end game has proved to be surprisingly difficult; even programming correct play in the most elementary end games has turned out to be recalcitrant, if ‘correct’ is taken to mean: winning, within the rules of the game, whenever possible.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1988 David Levy
About this chapter
Cite this chapter
van den Herick, J. (1988). Goal-Directed Search in Chess End Games. In: Levy, D. (eds) Computer Chess Compendium. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1968-0_30
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1968-0_30
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