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

https://doi.org/10.1016/S0166-218X(01)00244-XGet rights and content
Under an Elsevier user license
open archive

Abstract

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

Keywords

Chessboard
Queens graph
Queens domination problem

Cited by (0)