
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
R. Sosic, J. Gu, "Efficient Local Search with Conflict Minimization: A Case Study of the nQueens Problem," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 5, pp. 661668, October, 1994.  
BibTex  x  
@article{ 10.1109/69.317698, author = {R. Sosic and J. Gu}, title = {Efficient Local Search with Conflict Minimization: A Case Study of the nQueens Problem}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {6}, number = {5}, issn = {10414347}, year = {1994}, pages = {661668}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.317698}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Efficient Local Search with Conflict Minimization: A Case Study of the nQueens Problem IS  5 SN  10414347 SP661 EP668 EPD  661668 A1  R. Sosic, A1  J. Gu, PY  1994 KW  operations research; search problems; minimisation; constraint handling; local search; conflict minimization; nqueens problem; backtracking search; constraintbased search problem; exponential growth; computing time; benchmark constraintbased search problem; local search algorithm; linear time; large size nqueens problems; workstation; nonbacktracking search VL  6 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Backtracking search is frequently applied to solve a constraintbased search problem, but it often suffers from exponential growth of computing time. We present an alternative to backtracking search: local search with conflict minimization. We have applied this general search framework to study a benchmark constraintbased search problem, the nqueens problem. An efficient local search algorithm for the nqueens problem was implemented. This algorithm, running in linear time, does not backtrack. It is capable of finding a solution for extremely large size nqueens problems. For example, on a workstation it can find a solution for 3000000 queens in less than 55 s.
[1] B. Abramson and M. Yung, "Divide and conquer under global constraints: A solution to thenqueens problems,"J. Parallel Distrib. Computing, vol. 6, pp. 649662, 1989.
[2] W. Ahrens,Mathematische Unterhaltungen und Spiele(in German). Leipzig, Germany: B. G. Teubner, 19181921.
[3] B. Bernhardsson, "Explicit solutions to thenqueens problems for alln,"ACM SIGART Bull., vol. 2, p. 7, Apr. 1991.
[4] J. R. Bitner and E. M. Reingold, "Backtrack programming techniques,"Commun. ACM, vol. 18, no. 11, pp. 651656, Nov. 1975.
[5] T.H. Cormen, C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms, McGrawHill, Cambridge, Mass., 1990.
[6] B. J. Falkowski and L. Schmitz, "A note on the queens problem,"Inform. Processing Lett., vol. 23:3946, July 1986.
[7] J. Gaschnig, "A constraint satisfaction method for inference making," inProc. 12th Ann. Allerton Conf. Circuit Syst. Theory, 1974.
[8] J. Gaschnig, "Performance measurement and analysis of certain search algorithms," Ph.D. thesis, CarnegieMellon Univ., Comput. Sci. Dept., Pittsburgh, PA, 1979.
[9] J. Gu, "Parallel algorithms and architectures for very fast search," Tech. Rep. UUCSTR88005, Ph.D. dissertation, Univ. of Utah, Dept. of Comput. Sci., July 1988.
[10] J. Gu, "How to solve very largescale satisfiability (VLSS) problems," Tech. Rep., 1988 (present in part in J. Gu, "Benchmarking SAT algorithms," Tech. Rep. UCECETR90002, 1990).
[11] J. Gu, "On a general framework for largescale constraintbased optimization,"SIGART Bull., vol. 2, p. 8, Apr. 1991.
[12] J. Gu, "Efficient local search for very largescale satisfiability problem,"SIGART Bull., vol. 3, pp. 812, Jan. 1992.
[13] J. Gu, "Benchmarking SAT algorithms," Tech. Rep. UCECETR90 002, Oct. 1990.
[14] J. Gu,ContraintBased Search. New York: Cambridge University Press, 1995 (in press).
[15] R. M. Haralick and G. Elliot, "Increasing tree search efficiency for constraint satisfaction problems,"Artificial Intell., vol. 14, pp. 263313, 1980.
[16] E. J. Hoffman, J. C. Loessi, and R. C. Moore, "Constructions for the solution of thenqueens problem,"Mathemat. Mag., 1969, pp. 6672.
[17] L. Johnson, editor letter,SIGART Bull., Oct. 1990 to Oct. 1991.
[18] L. V. Kalé, "An almost perfect heuristic for thennonattacking queens problem,"Inform. Processing Lett., vol. 34, pp. 173178, Apr. 1990.
[19] S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, "Solving largescale constraint satisfaction and scheduling problems using a heuristic repair method," inProc. AAAI90, 1990, pp. 1724.
[20] P. W. Purdom and C. A. Brown, "An analysis of backtracking with search rearrangement,"SIAM J. Comput., vol. 12, no. 4, pp. 717733, Nov. 1983.
[21] P. W. Purdom, C. A. Brown, and E. L. Robertson, "Backtracking with multilevel dynamic search rearrangement,"Acta Informatica, vol. 15, pp. 99113, 1981.
[22] M. Reichling, "A simplified solution of thenqueens problem,"Inform. Processing Lett., vol. 25, pp. 253255, June 1987.
[23] R. Sosic and J. Gu, "How to search for million queens," Tech. Rep. UUCSTR88008, Dept. of Comput. Sci., Univ. of Utah, Feb. 1988.
[24] R. Sosic and J. Gu, "Fast search algorithms for thenqueens problem,"IEEE Trans. Syst., Man, Cybernetics, vol. 21, pp. 15721576, Nov./Dec. 1991.
[25] R. Sosic and J. Gu, "A polynomial time algorithm for thenqueens problem,"SIGART Bull., vol. 1, no. 3, pp. 711, Oct. 1990.
[26] R. Sosic and J. Gu, "3,000,000 queens in less than a minute,"SIGART Bull., vol. 2, no. 2, pp. 2224, Apr. 1991.
[27] H. S. Stone and J. M. Stone, "Efficient search techniques: An empirical study of thenqueens problem,"IBM J. Res. Dev., vol. 31, no. 4, pp. 464474, July 1987.