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 ...==
* [https://www.cs.indiana[Paul W.edu/%7Epwp/ Paul Walton Purdom, Jr.]], [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]]
* [[Andrew Appel]], [[Guy Jacobson]] ('''1988'''). ''The World’s Fastest Scrabble Program''. [[ACM#Communications|Communications of the ACM]], Vol. 31, No. 5, [https://pdfs.semanticscholar.org/da31/cb24574f7c881a5dbf008e52aac7048c9d9c.pdf pdf] » [[Scrabble]]
==1990 ...==
* [[Ilan Vardi]] ('''1991'''). ''Computational Recreations in Mathematica''. Redwood City, CA: Addison-Wesley, ISBN 0201529890, [http://www.amazon.com/Computational-Recreations-Mathematica-Ilan-Vardi/dp/0201529890 amazon.com]
* [[Matthew L. Ginsberg]] ('''1993'''). ''[http://www.jair.org/papers/paper1.html Dynamic Backtracking]''. [http://www.jair.org/vol/vol1.html JAIR Vol. 1]
* [https://en.wikipedia.org/wiki/Patrick_Prosser Patrick Prosser] ('''1993'''). ''[https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1467-8640.1993.tb00310.x Hybrid Algorithms for the Constraint Satisfaction Problem]''. [https://en.wikipedia.org/wiki/Computational_Intelligence_(journal) Computational Intelligence], Vol. 9, No. 3
* [[Matthew L. Ginsberg]], [[David McAllester]] ('''1994'''). ''GSAT and Dynamic Backtracking''. [http://www.informatik.uni-trier.de/~ley/db/conf/kr/kr94.html#GinsbergM94 KR 1994] <ref>[https://en.wikipedia.org/wiki/WalkSAT WalkSAT from WIkipedia]</ref>
* [[Peter Sanders]] ('''1995'''). ''Better Algorithms for Parallel Backtracking''. [http://www.informatik.uni-trier.de/~ley/db/conf/irregular/irregular95.html#HoppS95 IRREGULAR 1995]
* [[Paul W. Purdom]], [https://dblp.uni-trier.de/pid/15/2493.html G. Neil Haven] ('''1996'''). ''Backtracking and Probing''. [https://dblp.uni-trier.de/db/conf/dimacs/dimacs35.html#PurdomH96 Satisfiability Problem: Theory and Applications 1996], [https://www.academia.edu/22023319/Backtracking_and_probing pdf]
* [https://github.com/basilv Basil Vandegriend], [[Joe Culberson]] ('''1998'''). ''[https://www.jair.org/index.php/jair/article/view/10213 The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 9, [https://arxiv.org/abs/1105.5443 arXiv:1105.5443] <ref>[https://en.wikipedia.org/wiki/Hamiltonian_path_problem Hamiltonian path problem from Wikipedia]</ref>
==2000 ...==
* [http://www.cs.cornell.edu/gomes/ Carla P. Gomes], [http://dblp.uni-trier.de/pers/hd/f/Fern=aacute=ndez:C=egrave=sar Cèsar Fernández], [[Bart Selman]], [http://dblp.uni-trier.de/pers/hd/b/Bessiere:Christian Christian Bessière] ('''2004'''). ''Statistical Regimes Across Constrainedness Regions''. [http://dblp.uni-trier.de/db/conf/cp/cp2004.html#GomesFSB04 CP 2004], [http://www.cs.cornell.edu/selman/papers/pdf/04.cp.stat-regimes.pdf pdf]
=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
