article

Free access

3,000,000 Queens in less than one minute

Authors:

Rok Sosic,

Jun GuAuthors Info & Claims

ACM SIGART Bulletin, Volume 2, Issue 2

Pages 22 - 24

https://doi.org/10.1145/122319.122325

Published: 01 February 1991 Publication History

PDF eReader

Abstract

The n - queens problem is a classical combinatorial search problem. In this paper we give a linear time algorithm for this problem. The algorithm is an extension of one of our previous local search algorithms [3, 4, 6]. On an IBM RS 6000 computer, this algorithm is capable of solving problems with 3,000,000 queens in approximately 55 seconds.

References

[1]

J. Gaschnig. Performance Measurements and Analysis of Certain Search Algorithams. PhD thesis, Carnigie-Mellon University, Dept. of Computer Science, May 1979.

Digital Library

Google Scholar

[2]

R. M. Haralick and G. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263--313, 1980.

Crossref

Google Scholar

[3]

R. Sosic and J. Gu. Fast n - queen search on VAX and Bobcat machines. Unpublished CS 547 AI Class Student Project Report, Winter Quarter 1988.

Google Scholar

[4]

R. Sosic and J. Gu. How to search for million queens. Technical Report UUCS-TR-88--008, Dept. of Computer Science, Univ. of Utah, Feb. 1988 (also available from authors).

Google Scholar

[5]

J. Gu. Parallel Algorithms and Architectures for Very Fast AI Search (PhD Thesis). Technical Report UUCS-TR-88--005, Univ. of Utah, Dept. of Computer Science, Jul., 1988.

Digital Library

Google Scholar

[6]

R. Sosic and J. Gu. A polynomial time algorithm for the n - queens problem. SIGART Bulletin, 1(3):7--11, Oct. 1990.

Digital Library

Google Scholar

[7]

S. Minton, M.D. Johnston, A.B. Philips, and P. Laird. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings of AAAI90, pages 17--24, Aug. 1990.

Google Scholar

[8]

H.S. Stone and P. Sipala. The average complexity of depth-first search with backtracking and cutoff. IBM J. Res. Develop., 30(3):242--258, May 1986.

Digital Library

Google Scholar

[9]

H.S. Stone and J.M. Stone. Effecient search techniques - an empirical study of the n - queens problem. IBM J. Res. Develop., 31(4):464--474, July 1987.

Digital Library

Google Scholar

Cited By

View all

Shivappa N(2023)A Survey on Classic Examples of Constraint Satisfaction Problems with Solutions and Applications2023 3rd International Conference on Smart Generation Computing, Communication and Networking (SMART GENCON)10.1109/SMARTGENCON60755.2023.10442726(1-7)Online publication date: 29-Dec-2023
https://doi.org/10.1109/SMARTGENCON60755.2023.10442726
KARABULUT BERGÜZEN AÜNVER H(2022)A Linear Time Pattern Based Algorithm for N-Queens ProblemN-Vezir Problemi için Lineer Zamanlı Örüntü Temelli AlgoritmaPoliteknik Dergisi10.2339/politeknik.76296725:2(615-622)Online publication date: 1-Jun-2022
https://doi.org/10.2339/politeknik.762967
Alharbi SVenkat I(2017)A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens ProblemJournal of Optimization10.1155/2017/56503642017(1-8)Online publication date: 2017
https://doi.org/10.1155/2017/5650364
Show More Cited By

Index Terms

3,000,000 Queens in less than one minute
1. Computing methodologies
  1. Artificial intelligence
2. Mathematics of computing
  1. Discrete mathematics

Recommendations

A polynomial time algorithm for the N-Queens problem

The n-queens problem is a classical combinatorial problem in the artificial intelligence (AI) area. Since the problem has a simple and regular structure, it has been widely used as a testbed to develop and benchmark new AI search problem-solving ...
Different perspectives of the N-Queens problem
CSC '92: Proceedings of the 1992 ACM annual conference on Communications

The N-Queens problem is a commonly used example in computer science. There are numerous approaches proposed to solve the problem. We introduce several definitions of the problem, and review some of the algorithms. We classify the algorithms for the N-...
A group-based search for solutions of the n-queens problem

The n-queens problem is a well-known problem in mathematics, yet a full search for n-queens solutions has been tackled until now using only simple algorithms (with the exception of the Rivin-Zabih algorithm). In this article, we discuss optimizations ...

Comments

Information & Contributors

Information

Published In

ACM SIGART Bulletin Volume 2, Issue 2

April 1991

50 pages

ISSN:0163-5719

DOI:10.1145/122319

Editor:
Jon Doyle
MIT Lab., Cambridge, MA

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1991

Published in SIGAI Volume 2, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
1,034
Total Downloads

Downloads (Last 12 months)167
Downloads (Last 6 weeks)17

Reflects downloads up to 04 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shivappa N(2023)A Survey on Classic Examples of Constraint Satisfaction Problems with Solutions and Applications2023 3rd International Conference on Smart Generation Computing, Communication and Networking (SMART GENCON)10.1109/SMARTGENCON60755.2023.10442726(1-7)Online publication date: 29-Dec-2023
https://doi.org/10.1109/SMARTGENCON60755.2023.10442726
KARABULUT BERGÜZEN AÜNVER H(2022)A Linear Time Pattern Based Algorithm for N-Queens ProblemN-Vezir Problemi için Lineer Zamanlı Örüntü Temelli AlgoritmaPoliteknik Dergisi10.2339/politeknik.76296725:2(615-622)Online publication date: 1-Jun-2022
https://doi.org/10.2339/politeknik.762967
Alharbi SVenkat I(2017)A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens ProblemJournal of Optimization10.1155/2017/56503642017(1-8)Online publication date: 2017
https://doi.org/10.1155/2017/5650364
San Segundo P(2011)New decision rules for exact search in N-QueensJournal of Global Optimization10.1007/s10898-011-9653-x51:3(497-514)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1007/s10898-011-9653-x
Hürlimann T(2008)Modeling Languages in Optimization: A New ParadigmEncyclopedia of Optimization10.1007/978-0-387-74759-0_399(2297-2304)Online publication date: 2008
https://doi.org/10.1007/978-0-387-74759-0_399
Chen J(2007)An efficient non-probabilistic search algorithm for the N-queens problemProceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology10.5555/1322468.1322534(393-396)Online publication date: 2-Apr-2007
https://dl.acm.org/doi/10.5555/1322468.1322534
Jaam J(2005)Ramsey numbers by stochastic algorithms with new heuristicsCombinatorics and Computer Science10.1007/3-540-61576-8_81(163-181)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61576-8_81
Munehisa TKobayashi MYamazaki H(2001)Cooperative updating in the Hopfield modelIEEE Transactions on Neural Networks10.1109/72.95015312:5(1243-1251)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1109/72.950153
Hürlimann T(2001)Modeling Languages in Optimization: a New ParadigmEncyclopedia of Optimization10.1007/0-306-48332-7_302(1504-1511)Online publication date: 2001
https://doi.org/10.1007/0-306-48332-7_302
Gu JPurdom PFranco JWah B(1999)Algorithms for the Satisfiability (SAT) ProblemHandbook of Combinatorial Optimization10.1007/978-1-4757-3023-4_7(379-572)Online publication date: 1999
https://doi.org/10.1007/978-1-4757-3023-4_7
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

A polynomial time algorithm for the N-Queens problem

Different perspectives of the N-Queens problem

A group-based search for solutions of the n-queens problem

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations