ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer and let QQ be a set of kk queens placed on an n×nn\times n chessboard. For a nonnegative integer ll, the minimal chessboard domination queen completion problem asks whether there is a set Q′Q' of size k+lk+l such that Q⊂Q′Q\subset Q' and Q′Q' dominates the chessboard.

Chessboard queen completion conjecture. The minimal chessboard domination queen completion problem is NP-complete.

The problem concerns completing a prescribed partial queen placement to a dominating placement with a specified increase in size. The paper presents the claim as an open conjecture and does not provide a proof of NP-completeness.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.