On the Complexity of a Derivative Chess Problem
classification
💻 cs.CC
keywords
problemchessderivativequeensclassicalcomplexityintroducen-queens
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.