Bibliographic Details
| Title: |
An upper bound for the minimum number of queens covering the n×n chessboard |
| Authors: |
Burger, A.P.1, Mynhardt, C.M.1 mynhacm@hotmail.com |
| Source: |
Discrete Applied Mathematics. Sep2002, Vol. 121 Issue 1-3, p51. 10p. |
| Subjects: |
Dominating set, Chess problems |
| Abstract: |
We show that the minimum number of queens required to cover the n×n chessboard is at most 8/15n+O(1). [Copyright &y& Elsevier] |
|
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
