Explicit solutions to the N-queens problem for all N

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Explicit solutions to the N-queens problem for all N

Full text

Pdf (45 KB)

Source

ACM SIGART Bulletin archive
Volume 2 , Issue 2 (April 1991) table of contents

Page: 7

Year of Publication: 1991

ISSN:0163-5719

Author

Bo Bernhardsson

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 28, Downloads (12 Months): 67, Citation Count: 5

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/122319.122322 What is a DOI?

ABSTRACT

The n-queens problem is often used as a benchmark problem for AI research and in combinatorial optimization. An example is the recent article [1] in this magazine that presented a polynomial time algorithm for finding a solution. Several CPU-hours were spent finding solutions for some n up to 500,000.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Rok Sosic , Jun Gu, A polynomial time algorithm for the N-Queens problem, ACM SIGART Bulletin, v.1 n.3, p.7-11, Oct. 1990 [doi>10.1145/101340.101343]
	2	Hoffman, E.J., Loessi, J.C. and Moore, R.C. (1969): Constructions for the Solution of the <i>m</i> Queens Problem, <i>Mathematics Magazine,</i> p. 66--72.

CITED BY 5

	R. Sosic , J. Gu, Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem, IEEE Transactions on Knowledge and Data Engineering, v.6 n.5, p.661-668, October 1994
	Marco Valtorta, Correspondence: Response to "Explicit Solutions to the N-Queens Problem for all N", ACM SIGART Bulletin, v.2 n.4, p.4-5, Aug. 1991
	Jun Gu, On a general framework for large-scale constraint-based optimization, ACM SIGART Bulletin, v.2 n.2, p.8, April 1991
	Timothy J. Rolfe, Las Vegas does n-queens, ACM SIGCSE Bulletin, v.38 n.2, June 2006
	Jing-Chao Chen, An efficient non-probabilistic search algorithm for the N-queens problem, Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology, p.393-396, April 02-04, 2007, Phuket, Thailand