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

Abstract

We show that the minimum number of queens required to cover the n × n chessboard is at most 8 15n+ O(1). ? 2002 Elsevier Science B.V. All rights reserved. 
DOI: 10.1016/S0166-218X(01)00244-X

7 Figures and Tables