An upper bound for the minimum number of queens covering the n × n chessboard

  • Authors:

  • A. P. Burger;C. M. Mynhardt

  • Affiliations:

  • Department of Mathematics, University of South Africa, P.O. Box 392, 0003 Pretoria, South Africa;Department of Mathematics, University of South Africa, P.O. Box 392, 0003 Pretoria, South Africa

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2002

Quantified Score

Hi-index 0.04

Visualization

Abstract

We show that the minimum number of queens required to cover the n × n chessboard is at most 8/15 n+O(1).