Abstract
This paper describes an algorithm for dividing the set of positions in a single-pawn Rook end-game into winning ones for White and drawing. Data arrangement and processing methods are described whereby within reasonable computer time, large (up to about 1500-milion bits) data arrays can be studied; a number of procedures are put forward, such as search for problem symmetry, levels of data arrangement, data restructuring, batch processing of data, and others.
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
Arlazarov, V., Futer, A. (1988). Computer Analysis of a Rook Endgame. In: Levy, D. (eds) Computer Chess Compendium. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1968-0_31
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1968-0_31
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