On the Complexity of a Derivative Chess Problem

Details On the Complexity of a Derivative Chess Problem On the Complexity of a Derivative Chess Problem

2007-01-08

arxiv.org/abs/cs/0701049v2

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of a Derivative Chess Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of a Derivative Chess Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of a Derivative Chess Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-721701