On the Complexity of a Derivative Chess Problem
<|reference_start|>On the Complexity of a Derivative Chess Problem: We 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.<|reference_end|>
@article{martin2007on,
    title={On the Complexity of a Derivative Chess Problem},
    author={Barnaby Martin},
    journal={arXiv preprint arXiv:cs/0701049},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0701049},
    primaryClass={cs.CC}
}