Las Vegas does n-queens

Authors:
Timothy J. Rolfe
Affiliations:
Eastern Washington University, Cheney, Washington
Venue:
ACM SIGCSE Bulletin
Year:
2006

Citing 4
Cited 0

Algorithms & data structures

Algorithms & data structures
A polynomial time algorithm for the N-Queens problem

ACM SIGART Bulletin
Explicit solutions to the N-queens problem for all N

ACM SIGART Bulletin
Program development by stepwise refinement

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

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.