Asymptotic Results for the Queen Packing Problem
Combinatorics
2017-03-16 v1
Abstract
We consider the problem of placing k queens on an nxn board so that the total number of attacked squares is as small as possible. In particular, we consider the domain where k is small relative to n and derive nearly tight bounds in this setting.
Cite
@article{arxiv.1703.04538,
title = {Asymptotic Results for the Queen Packing Problem},
author = {Daniel M Kane},
journal= {arXiv preprint arXiv:1703.04538},
year = {2017}
}