DIVIDE AND CONQUER UNDER GLOBAL CONSTRAINTS - A SOLUTION TO THE N-QUEENS PROBLEM

被引：21

作者：

ABRAMSON, B

YUNG, M

机构：

[1] UNIV SO CALIF,DEPT COMP SCI,LOS ANGELES,CA 90089

[2] COLUMBIA UNIV,DEPT COMP SCI,NEW YORK,NY 10027

来源：

关键词：

D O I：

10.1016/0743-7315(89)90011-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：649 / 662

页数：14

共 24 条

[1]

BALL WWR, 1973, MATH RECREATIONS ESS

[2]

CARTER L, 1985, MAY S THEOR COMP ACM, P449

[3]

Chandra A. K., 1974, Journal of Combinatorial Theory, Series A, V16, P111, DOI 10.1016/0097-3165(74)90076-4

[4]

DIJKSTRA EW, 1972, STRUCT PROGRAM, P1

[5]

FILMAN RE, 1984, COORDINATED COMPUTIN

[6] DIB - A DISTRIBUTED IMPLEMENTATION OF BACKTRACKING [J].

FINKEL, R ;

MANBER, U .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1987, 9 (02) :235-256

[7] NONDETERMINISTIC ALGORITHMS [J].

FLOYD, RW .

[8] A SUFFICIENT CONDITION FOR BACKTRACK-BOUNDED SEARCH [J].

FREUDER, EC .

[9]

Gardner M., 1969, UNEXPECTED HANGING O

[10]

Gaschnig J. G., 1979, THESIS CARNEGIE MELL