# Asymptotic Results for the Queen Packing Problem

## TL;DR

This paper investigates the queen packing problem, aiming to minimize attacked squares when placing a small number of queens on a large chessboard, and provides nearly optimal bounds for this scenario.

## Contribution

It derives nearly tight bounds for the queen packing problem specifically when the number of queens is small relative to the board size.

## Key findings

- Derived nearly tight bounds for small k relative to n
- Analyzed the asymptotic behavior of the problem
- Provided theoretical insights into queen placement optimization

## 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.