A survey of known results and research areas for n-queens

被引:106
作者
Bell, Jordan [1 ]
Stevens, Brett [1 ]
机构
[1] Carleton Univ, Sch Math & Stat, Ottawa, ON K1S 5B6, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
n-queens problem; Modular n-queens problem; Queens graph; Chessboard graph; Chessboard problems; MAXIMAL PARTIAL SPREADS; PANDIAGONAL LATIN SQUARES; DECIMATION LATTICE; NUMBER; GRAPHS; DESIGNS; THEOREM;
D O I
10.1016/j.disc.2007.12.043
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper we survey known results for the n-queens problem of placing n nonattacking queens on an n x n chessboard and consider extensions of the problem, e.g. other board topologies and dimensions. For all solution constructions, we either give the construction, an outline of it, or a reference. In our analysis of the modular board, we give a simple result for finding the intersections of diagonals. We then investigate a number of open research areas for the problem, stating several existing and new conjectures. Along with the known results for n-queens that we discuss, we also give a history of the problem. In particular, we note that the first proof that n nonattacking queens can always be placed on an n x n board for n > 3 is by E. Pauls, rather than by W. Ahrens who is typically cited. We have attempted in this paper to discuss all the mathematical literature in all languages on the n-queens problem. However, we look only briefly at computational approaches. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 31
页数:31
相关论文
共 199 条
[1]   Birkhoff's theorem for panstochastic matrices [J].
Alvis, D ;
Kinyon, M .
AMERICAN MATHEMATICAL MONTHLY, 2001, 108 (01) :28-37
[2]   A contribution to queens graphs:: A substitution method [J].
Ambrus, G ;
Barát, J .
DISCRETE MATHEMATICS, 2006, 306 (12) :1105-1114
[3]  
Andrews W. S., 1960, Magic Squares and Cubes, V2nd
[4]  
[Anonymous], 1892, MATH RECREATIONS PRO
[5]  
[Anonymous], 1953, Mathematical Recreations
[6]  
[Anonymous], 1991, SIGART B
[7]  
[Anonymous], 1999, Oxford Mathematics Monographs
[8]  
[Anonymous], 1979, COMPUTERS INTRACTABI
[9]  
[Anonymous], ARCH MATH PHYS
[10]  
[Anonymous], MEMORIAL SCI MATH