Las Vegas does n-queens

Timothy J. Rolfe · ACM SIGCSE Bulletin · 2006

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.

Read the paper · More papers on PaperTik