Abstract
In this paper we will describe some of the basic techniques that allow computers to play chess like human grandmasters. In the first part we will give an overview about the sequential algorithms used. In the second part we will describe the parallelization that has been developed by us. The resulting parallel search algorithm has been used successfully in the chess program Zugzwang even on massively parallel hardware. In 1992 Zugzwang became Vize World Champion at the Computer Chess Championships in Madrid, Spain, running on 1024 processors. Moreover, the parallelization proves to be flexible enough to be applied successfully to the new Zugzwang program, although the new program uses a different sequential search algorithm and runs on a completely different hardware.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.