Abstract
A number of people are interested in problems of the “White to play and mate in two” variety. Although these problems are not really part of chess (since the positions are normally quite artificial) the same techniques that are used in chess programming could easily be employed to solve problems. In fact the Northwestern program has, for some time, announced mate whenever it detected a forced mate within its horizon. A program could be made to find all mates within a certain number of moves simply by performing an exhaustive search to the required depth, and for this reason such a program would be, in my opinion, of little value. (But that is because I dislike both chess problems and exhaustive searches). Some of the microprocessor machines described above already solve such problems.
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
A game is drawn if fifty successive moves are played by each side without a pawn being moved or a capture being made
Rights and permissions
Copyright information
© 1982 Computer Science Press, Inc.
About this chapter
Cite this chapter
Levy, D., Newborn, M. (1982). Computer Chess Miscellany. In: All About Chess and Computers. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85538-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-85538-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85540-5
Online ISBN: 978-3-642-85538-2
eBook Packages: Springer Book Archive