guogang@iro.umontreal.CA (Gao Guogang) (11/02/90)
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 <guogang@IRO.UMontreal.CA>, Universite de Montreal, Dept d'IRO, C.P. 6128, Succ. A, Montreal (Quebec) Canada H3C 3J7