On the Complexity of a Derivative Chess Problem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Computational Complexity

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/126284

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0701049
 http://arxiv.org/abs/cs/0701049

Collections

arXiv