Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!ucsd!ucbvax!iro.umontreal.CA!guogang From: guogang@iro.umontreal.CA (Gao Guogang) Newsgroups: comp.theory Subject: Queens problem Message-ID: <9010241834.AA06741@takwa.IRO.UMontreal.CA> Date: 1 Nov 90 19:54:22 GMT Sender: daemon@ucbvax.BERKELEY.EDU Reply-To: Gao Guogang Lines: 14 Here is the problem that interests me: can k*n queens be placed on an n*n chessboard such that no (k+1) queens are on the same rank, file, or diagonal? Comment: when k = 1, this is the so-called N-Queens problem in the literature. And it was solved in 1969 (I think). Well there are a couple of other solutions published in the past years. For k >= 2, I do not know whether anybody else has solved this problem. Can anybody provide me any clue on the case k >= 2 ? Thank you very much in advance. -- Guo-Gang Gao , Universite de Montreal, Dept d'IRO, C.P. 6128, Succ. A, Montreal (Quebec) Canada H3C 3J7