THE N-QUEENS PROBLEM

被引：38
作者：
RIVIN, I
VARDI, I
ZIMMERMANN, P
机构：
[1] INRIA LORRAINE,NANCY,FRANCE
[2] MSRI,BERKELEY,CA 94720
来源：
AMERICAN MATHEMATICAL MONTHLY | 1994年 / 101卷 / 07期
关键词：
D O I：
10.2307/2974691
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：629 / 639
页数：11
相关论文
共 34 条
[1]  
Ahrens W., 1921, MATH UNTERHALTUNGEN, V1
[2]  
BEASLY JD, 1990, MATH GAMES
[3]  
CLARK D, 1985, MONTHLY, V92, P725
[4]   A NOTE ON THE QUEENS PROBLEM [J].
FALKOWSKI, BJ ;
SCHMITZ, L .
INFORMATION PROCESSING LETTERS, 1986, 23 (01) :39-46
[5]   AN APPLICATION OF GRAPH-THEORY AND INTEGER PROGRAMMING - CHESSBOARD NON-ATTACKING PUZZLES [J].
FOULDS, LR ;
JOHNSTON, DG .
MATHEMATICS MAGAZINE, 1984, 57 (02) :95-104
[6]  
GARDNER M, 1986, UNEXPECTED HANGING O
[7]  
GAUSS CF, 1929, WERKE, V12, P20
[8]  
GLAISHER JWL, 1974, PHILOS MAG, V18, P457
[9]   BACKTRACK PROGRAMMING [J].
GOLOMB, SW ;
BAUMERT, LD .
JOURNAL OF THE ACM, 1965, 12 (04) :516-&
[10]   INCREASING TREE-SEARCH EFFICIENCY FOR CONSTRAINT SATISFACTION PROBLEMS [J].
HARALICK, RM ;
ELLIOTT, GL .
ARTIFICIAL INTELLIGENCE, 1980, 14 (03) :263-313
1234