Some new results for the queens domination problem

Computing techniques are described which have resulted in the establishment of new results for the queens domination problem. In particular it is shown that the minimum cardinalities of independent sets of dominating queens for chessboards of size 14, 15, and 16 are 8, 9, and 9 respectively, and that the minimum cardinalities of sets of dominating queens for chessboards of size 29, 41, 45, and 57 are 15, 21,23 and 29 respectively. As a by-product the numbers of non-isomorphic ways of covering a chessboard of size n with k independent queens for 1 :; n :; 15 and 1 :; k :; 8, as well as the case n = 16, k = 8, are computed.