Asymptotic Results for the Queen Packing Problem

arXiv1703.04538MaRDI QIDQ6284285FDOQ6284285

Publication date: 13 March 2017

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 page was built for publication: Asymptotic Results for the Queen Packing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284285)