Download bibtex

[nqueenscompletion]
Ian P. Gent, Christopher Jefferson, and Peter Nightingale
Complexity of n-Queens Completion
JAIR, 2017

[28002]
Jeff Erickson
Complexity of n-queens-completion?
December 2014 howpublished: Theoretical Computer Science Stack Exchange
Note: URL:http://cstheory.stackexchange.com/q/28002 (version: 2014-12-29)

[blocked-queens]
Gayathri Namasivayam and Miroslaw Truszczynski
Blocked N-Queens
2009 howpublished: https://dtai.cs.kuleuven.be/events/ASP-competition/Benchmarks/BlockedQueens.shtml

[asp-competition-07]
Martin Gebser, Lengning Liu, Gayathri Namasivayam, André Neumann, Torsten Schaub, and Mirosław Truszczyński
The First Answer Set Programming System Competition
Proceedings of the International Conference on Logic Programming and Nonmonotonic Reasoning, 3-17, 2007

[nauck1850a]
Franz Nauck
Schach: Eine in das Gebiet der Mathematik fallende Aufgabe von Herrn Dr. Nauck in Schleusingen
Illustrirte Zeitung 14(361), 352, June 1850