Title of article :
An upper bound for the minimum number of queens covering the n×n chessboard Original Research Article
Author/Authors :
A.P. Burger، نويسنده , , C.M. Mynhardt، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Abstract :
We show that the minimum number of queens required to cover the n×n chessboard is at most 815n+O(1).
Keywords :
Queens domination problem , Chessboard , Queens graph
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
