The $n$-Queens Problem in Higher Dimensions

Details The $n$-Queens Problem in Higher Dimensions The $n$-Queens Problem in Higher Dimensions

2007-12-14

arxiv.org/abs/0712.2309v1

Elemente der Mathematik 61 (4), 2006, pp. 133--137

Mathematics

Combinatorics

Scientific paper

A well-known chessboard problem is that of placing eight queens on the chessboard so that no two queens are able to attack each other. (Recall that a queen can attack anything on the same row, column, or diagonal as itself.) This problem is known to have been studied by Gauss, and can be generalized to an (n \times n) board, where (n \geq 4). We consider this problem in $d$-dimensional chess spaces, where (d \geq 3), and obtain the result that in higher dimensions, $n$ queens do not always suffice (in any arrangement) to attack all board positions. Our methods allow us to obtain the first lower bound on the number of queens that are necessary to attack all positions in a $d$-dimensional chess space of size $n$, and further to show that for any $k$, there are higher-dimensional chess spaces in which not all positions can be attacked by (n^k) queens.

Affiliated with

Also associated with

No associations

Rating

The $n$-Queens Problem in Higher Dimensions 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 The $n$-Queens Problem in Higher Dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The $n$-Queens Problem in Higher Dimensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662359