Abstract
Recursive depth-first searching dominated computer chess and other fields of computer game-playing since their nascent days in the early 1950s. While surveys and introductory texts on the subject area abound, we specifically like to mention and recommend only two of them. The excellent overviews by Kaindl [126] and Marsland [146] concentrate on the computer-chess related aspects of the most important search techniques and their successful application in real programs. We briefly introduce the game of Chess itself before diving into our own explanations of basic and advanced search methods and their implementation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2000 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Heinz, E.A. (2000). Computer-Chess Primer. In: Scalable Search in Computer Chess. Computational Intelligence. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-90178-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-322-90178-1_2
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-528-05732-9
Online ISBN: 978-3-322-90178-1
eBook Packages: Springer Book Archive