2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/126284We introduce QUEENS, a derivative chess problem based on the classical n-queens problem. We prove that QUEENS is NP-complete, with respect to polynomial-time reductions.Computational Complexitytext