5 problems

Four-sided hypercube queen conjecture. The maximal non-attacking queen set problem on a $d$-dimensional hypercube of side length $4$ has solution size

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

Convex-polyomino maximal queen domination conjecture. The maximal domination problem for non-attacking queens on convex polyominoes is NP-complete.

Convex-polyomino queen domination conjecture. The minimal domination problem for attacking, or non-attacking, queens on convex polyominoes is NP-complete.

Maximal independent queen domination conjecture. The maximal independent queen domination problem on polyominoes is NP-complete.