25,161
edits
Changes
no edit summary
* [[Gary Lindstrom]] ('''1979'''). ''[http://dl.acm.org/citation.cfm?id=357063 Backtracking in a Generalized Control Setting]''. [[ACM#TOPLAS|ACM Transactions on Programming Languages and Systems]], Vol. 1, No. 1
==1980 ...==
* [[Paul W. Purdom]], [http://web.cecs.pdx.edu/%7Ecbrown/ [Mathematician#CABrown|Cynthia A. Brown]], [https://www.cs.indiana.edu/%7Eedrbtsn/ Edward L. Robertson] ('''1981'''). ''Backtracking with Multi-Level Dynamic Search Rearrangement''. [http://ftp.math.utah.edu/pub//tex/bib/toc/actainfo.html#15%282%29:December:1981 Acta Informatica Vol. 15, No. 2]
* [[Robert A. Wagner]], [[Mathematician#RGeist|Robert Geist]] ('''1984'''). ''The Crippled Queen Placement Problem''. [https://dblp.uni-trier.de/db/journals/scp/scp4.html Science of Computer Programming, Vol. 4], No. 3, [https://core.ac.uk/download/pdf/82594002.pdf pdf]
* [[Oliver Vornberger]], [[Burkhard Monien]], [[Ewald Speckenmeyer]] ('''1986'''). ''Superlinear Speedup for Parallel Backtracking.'' Technical Report 30, [[Paderborn University]]
=Forum Posts=
* [httphttps://groups.google.com/groupg/rec.games.chess.misccomputer/browse_frmc/threadty2-qKDlJUI/b72dbea8a0e52542 m/Wt292BRnL14J N-Queens number for large boards] by [[Truman Collins]], [[Computer Chess Forums|rgcm]], January 30, 1997
* [http://www.talkchess.com/forum/viewtopic.php?t=66016 N Queens Puzzle Algorithm] by Aaron Alfer, [[CCC]], December 15, 2017
