ACM Home Page
Please provide us with feedback. Feedback
Las Vegas does n-queens
Full text PdfPdf (264 KB)
Source ACM SIGCSE Bulletin archive
Volume 38 ,  Issue 2  (June 2006) table of contents
COLUMN: Featured column table of contents
Pages: 37 - 38  
Year of Publication: 2006
ISSN:0097-8418
Author
Timothy J. Rolfe  Eastern Washington University, Cheney, Washington
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 31,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1138403.1138429
What is a DOI?

ABSTRACT

This paper presents two Las Vegas algorithms to generate single solutions to the n-queens problem. One algorithm generates and improves on random permutation vectors until it achieves one that is a successful solution, while the other algorithm randomly positions queens within each row in positions not under attack from above.


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
E. J. Hoffman, J. C. Loessi and R. C. Moore, "Constructions for the Solution of the m Queens Problem", Mathematics Magazine, Vol. 42, No. 2 (Mar. 1969), p. 66--72. The construction is that of A. M. Yaglom and I. M. Yaglom, Neelementarnye Zadachi v Elementarnom Izlozhenii (Moscow, 1954), translated by James McCawley, Jr., revised and edited by Basil Gordon, Challenging Mathematical Problems with Elementary Solutions: Volume I, Combinatorial Analysis and Probability Theory (1964, reprinted by Dover 1987), pp. 92--98.
2
3
 
4
Rok Sosič and Jun Gu, "Fast Search Algorithms for the N-Queens Problem", IEEE Transactions on Systems, Man, and Cybernetics, Vo. 21, No. 6 (Nov/Dec 1991), pp. 1572--76.
 
5
6
 
7
 
8