Article

Unknown

06/2004;
Source: CiteSeer

ABSTRACT The modular n-queen problem in higher dimensions was introduced by Nudelman [6]. He showed that for a complete solution to exist in the d-dimensional modular n-chessboard, it is necessary that gcd(n, (2d 1)!) = 1, and that it is su#cient that gcd(n, (2 1)!) = 1. He conjectured that the last condition is also necessary and showed that this is indeed the case for the class of linear solutions. In this notes, we observe that the conjecture is true for the larger class of polynomial solutions, which are solutions we present as a natural generalization of the bidimensional solutions developed by Klove [3]. We also generalize constructions of bidimensional solutions developed also by Klove [4].

0 0
 · 
0 Bookmarks
 · 
14 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

bidimensional solutions
 
complete solution
 
conjecture
 
last condition
 
linear solutions
 
modular n-queen problem
 
natural generalization
 
notes
 
Nudelman
 
polynomial solutions