On the Complexity of a Derivative Chess Problem

Simple item page
dc.creatorMartin, Barnaby
dc.date2007-01-08
dc.date2007-03-26
dc.date.accessioned2026-07-07T07:53:36Z
dc.date.available2026-07-07T07:53:36Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0701049
dc.identifierhttp://arxiv.org/abs/cs/0701049
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126284
dc.subjectComputational Complexity
dc.titleOn the Complexity of a Derivative Chess Problem
dc.typetext

Files

Collections

arXiv