NP-completeness of minimal queen completion on chessboards
Statement
Let be a positive integer and let be a set of queens placed on an chessboard. For a nonnegative integer , the minimal chessboard domination queen completion problem asks whether there is a set of size such that and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.