{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:28Z","timestamp":1750308148128,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCSE Bull."],"published-print":{"date-parts":[[2006,6]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/1138403.1138429","type":"journal-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T17:00:26Z","timestamp":1153760426000},"page":"37-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Las Vegas does n-queens"],"prefix":"10.1145","volume":"38","author":[{"given":"Timothy J.","family":"Rolfe","sequence":"first","affiliation":[{"name":"Eastern Washington University, Cheney, Washington"}]}],"member":"320","published-online":{"date-parts":[[2006,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/0025570X.1969.11975924"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/122319.122322"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/101340.101343"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/21.135698"},{"key":"e_1_2_1_5_1","unstructured":"http:\/\/www.acmcontest-pacnw.org\/ProblemSet\/2005\/Problem I.  http:\/\/www.acmcontest-pacnw.org\/ProblemSet\/2005\/Problem I."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/362575.362577"},{"key":"e_1_2_1_7_1","unstructured":"Niklaus Wirth Algorithms and Data Structures (Prentice-Hall 1986) pp. 153--157.   Niklaus Wirth Algorithms and Data Structures (Prentice-Hall 1986) pp. 153--57."},{"key":"e_1_2_1_8_1","unstructured":"http:\/\/penguin.ewu.edu\/~trolfe\/QueenLasVegas\/  http:\/\/penguin.ewu.edu\/~trolfe\/QueenLasVegas\/"}],"container-title":["ACM SIGCSE Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1138403.1138429","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1138403.1138429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:41Z","timestamp":1750263521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1138403.1138429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["10.1145\/1138403.1138429"],"URL":"https:\/\/doi.org\/10.1145\/1138403.1138429","relation":{},"ISSN":["0097-8418"],"issn-type":[{"type":"print","value":"0097-8418"}],"subject":[],"published":{"date-parts":[[2006,6]]},"assertion":[{"value":"2006-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}