Skip Navigation

The Computer Journal 1989 32(6):567-570; doi:10.1093/comjnl/32.6.567
© 1989 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Robison, A. D.
Right arrow Articles by Skiena, S. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Computer Games: Eight Pieces Cannot Cover a Chess Board*

A. D. Robison1, B. J. Hafner1 and S. S. Skiena2

1 Department of Computer Science, University of Illinois, Urbana, IL 61801, USA
2 Department of Computer Science, State University of New York, Stony Brook, Stony Brook, NY 11794, USA

Received 1 July 1988; The problem of maximising the number of squares on a chess board which can be attacked by a configuration of the eight main pieces was first posed in 1849. We report on a computer search which proves that at most 63 squares can be simultaneously attacked, and we give results for other variations of the problem. Our search technique, which pruned the space of 2.27 x 1012 positions to 1.03x108, is of independent interest.

* The research of the first author was supported by a Shell Fellowship in Computer Science.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.