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
Pages
10
From page
51
To page
60
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
Serial Year
2002
Journal title
Discrete Applied Mathematics
Record number
885424
Link To Document