Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem.

@article{DBLP:journals/tkde/SosicG94,
  author    = {Rok Sosic and
               Jun Gu},
  title     = {Efficient Local Search with Conflict Minimization: A Case Study
               of the n-Queens Problem},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {6},
  number    = {5},
  year      = {1994},
  pages     = {661-668},
  ee        = {db/journals/tkde/SosicG94.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1994 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

...

[2]

...

[3]

...

[4]

James R. Bitner, Edward M. Reingold: Backtrack Programming Techniques. Commun. ACM 18(11): 651-656(1975) BibTeX

[5]

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest: Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8,0-07-013143-0
BibTeX

[6]

Bernd-Jürgen Falkowski, Lothar Schmitz: A Note on the Queens' Problem. Inf. Process. Lett. 23(1): 39-46(1986) BibTeX

[7]

...

[8]

...

[9]

...

[10]

...

[11]

...

[12]

...

[13]

...

[14]

...

[15]

Robert M. Haralick, Gordon L. Elliott: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artif. Intell. 14(3): 263-313(1980) BibTeX

[16]

...

[17]

...

[18]

Laxmikant V. Kalé: An Almost Perfect Heuristic for the N Nonattacking Queens Problem. Inf. Process. Lett. 34(4): 173-178(1990) BibTeX

[19]

Steven Minton, Mark D. Johnston, Andrew B. Philips, Philip Laird: Solving Large-Scale Constraint-Satisfaction and Scheduling Problems Using a Heuristic Repair Method. AAAI 1990: 17-24 BibTeX

[20]

Paul Walton Purdom Jr., Cynthia A. Brown: An Analysis of Backtracking with Search Rearrangement. SIAM J. Comput. 12(4): 717-733(1983) BibTeX

[21]

Paul Walton Purdom Jr., Cynthia A. Brown, Edward L. Robertson: Backtracking with Multi-Level Dynamic Search Rearrangement. Acta Inf. 15: 99-113(1981) BibTeX

[22]

Matthias Reichling: A Simplified Solution of the n Queens Problem. Inf. Process. Lett. 25(4): 253-255(1987) BibTeX

[23]

...

[24]

...

[25]

Rok Sosic, Jun Gu: A Polynomial Time Algorithm for the N-Queens Problem. SIGART Bulletin 1(3): 7-11(1990) BibTeX

[26]

Rok Sosic, Jun Gu: 3000000 Queens in Less Than One Minute. SIGART Bulletin 2(2): 22-24(1991) BibTeX

[27]

Harold S. Stone, Janice M. Stone: Efficient Search Techniques - An Empirical Study of the N-Queens Problem. IBM Journal of Research and Development 31(4): 464-474(1987) BibTeX

Referenced by

1. Jun Gu: Global Optimization for Satisfiability (SAT) Problem. IEEE Trans. Knowl. Data Eng. 6(3): 361-381(1994)