Computer games: Eight pieces cannot cover a chess board

A. D. Robison; B. J. Hafner; S. S. Skiena

doi:10.1093/comjnl/32.6.567

Computer games: Eight pieces cannot cover a chess board

A. D. Robison
, B. J. Hafner
, S. S. Skiena

Computer Science

University of Illinois at Urbana-Champaign

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

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 × 10¹² positions to 1.03×10⁸, is of independent interest.

Original language	English
Pages (from-to)	567-570
Number of pages	4
Journal	Computer Journal
Volume	32
Issue number	6
DOIs	https://doi.org/10.1093/comjnl/32.6.567
State	Published - Dec 1989

Access to Document

10.1093/comjnl/32.6.567

Cite this

@article{11b17fff06fc48bdaf90af2bf1685ee4,

title = "Computer games: Eight pieces cannot cover a chess board",

abstract = "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 × 1012 positions to 1.03×108, is of independent interest.",

author = "Robison, \{A. D.\} and Hafner, \{B. J.\} and Skiena, \{S. S.\}",

year = "1989",

month = dec,

doi = "10.1093/comjnl/32.6.567",

language = "English",

volume = "32",

pages = "567--570",

journal = "Computer Journal",

issn = "0010-4620",

number = "6",

}

TY - JOUR

T1 - Computer games

T2 - Eight pieces cannot cover a chess board

AU - Robison, A. D.

AU - Hafner, B. J.

AU - Skiena, S. S.

PY - 1989/12

Y1 - 1989/12

N2 - 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 × 1012 positions to 1.03×108, is of independent interest.

AB - 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 × 1012 positions to 1.03×108, is of independent interest.

UR - https://www.scopus.com/pages/publications/0024911064

U2 - 10.1093/comjnl/32.6.567

DO - 10.1093/comjnl/32.6.567

M3 - Article

AN - SCOPUS:0024911064

SN - 0010-4620

VL - 32

SP - 567

EP - 570

JO - Computer Journal

JF - Computer Journal

IS - 6

ER -

Computer games: Eight pieces cannot cover a chess board

Abstract

Access to Document

Other files and links

Fingerprint

Cite this