On the Complexity of a Derivative Chess Problem
Computational Complexity
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.cs/0701049,
title = {On the Complexity of a Derivative Chess Problem},
author = {Barnaby Martin},
journal= {arXiv preprint arXiv:cs/0701049},
year = {2007}
}