Asymptotic Results for the Queen Packing Problem
classification
🧮 math.CO
keywords
considerproblemsmallasymptoticattackedboardboundsderive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.