25,161
edits
Changes
no edit summary
* [[Late Move Reductions]] - LMR
* [[Null Move Reductions]]
* [[RankCut]]
* [[Razoring]]
* [[Chun Ye]] ('''1992'''). ''Experiments in Selective Search Extensions''. MSc. thesis, Department of Computing Science, [[University of Alberta]], [https://era.library.ualberta.ca/public/datastream/get/uuid:e4fbf48d-7603-490f-85cc-5497bbecf5a8/DS1 pdf]
* [[Chun Ye]], [[Tony Marsland]] ('''1992'''). ''Selective Extensions in Game-Tree Search''. [[3rd Computer Olympiad#Workshop|Heuristic Programming in AI 3]]
* [[David McAllester]], [[Deniz Yuret]] ('''1993'''). ''Alpha-Beta Conspiracy Search''. [http://ttic.uchicago.edu/~dmcallester/abc.ps ps (draft)] » [[Alpha-Beta Conspiracy Search]]
* [[Javier Ros Padilla]] ('''1994'''). ''Estimating Asymmetry and Selectivity in Chess Programs''. [[ICGA Journal#17_1|ICCA Journal, Vol. 17, No. 1]] <ref>[https://groups.google.com/d/msg/rec.games.chess/5_dMbe0_juo/bXQQVYVEpykJ ICCA Journal, Vol. 17, No. 1] by [[Jos Uiterwijk]], [[Computer Chess Forums|rgcc]], May 02, 1994</ref>
* [[Deniz Yuret]] ('''1994'''). ''[https://scholar.google.com/citations?view_op=view_citation&hl=en&user=EJurXJ4AAAAJ&cstart=40&citation_for_view=EJurXJ4AAAAJ:TQgYirikUcIC The Principle of Pressure in Chess]''. TAINN 1994
* [[Paul E. Utgoff]], [[Richard P. Cochran]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_1 A Least-Certainty Heuristic for Selective Search]''. [[CG 2000]], [http://people.cs.umass.edu/~utgoff/papers/springer-lcf.pdf pdf] » [[Richard P. Cochran#LCF|LCF]]
* [[Yngvi Björnsson]], [[Tony Marsland]] ('''2000'''). ''Selective Depth-First Search Methods''. in [[Jaap van den Herik]], [[Hiroyuki Iida]] (eds.) ('''2000'''). ''Games in AI Research''. [[Maastricht University|Universiteit Maastricht]], [http://www.cs.ualberta.ca/%7Etony/RecentPapers/nec97w.pdf pdf preprint]
* [[Ulf Lorenz]], [[Burkhard Monien]] ('''2002'''). ''[http://www.springerlink.com/content/f6b4wb6l63dpd0jv/ The Secret of Selective Game Tree Search, When Using Random-Error Evaluations]''. Proceedings of 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS)* [[David McAllester]], [[Deniz Yuret]] ('''2002'''). ''Alpha-Beta Conspiracy Search''. [[ICGA Journal#25_1|ICGA Journal, Vol. 25, No. 1]] » [[Alpha-Beta Conspiracy Search]]* [[httpBrian Sheppard]] ('''2004'''). ''[https://wwwlink.top-5000springer.nlcom/chapter/ps10.1007/The%20secret%20of%20selective%20earch%20when%20using%20random11674399_1 Efficient Control of Selective Simulations]''.pdf pdf[[CG 2004]]* [[Brian Sheppard]] ('''2004'''). ''Efficient Control of Selective Simulations''. [[ICGA Journal#27_2|ICGA Journal, Vol. 27, No. 2]] <ref>slightly revised version of the [[CG 2004]] paper</ref>* [[Pálmi Skowronski]] ('''2009'''). ''Gradual Focus: A Method for Automated Feature Discovery in Selective Search''. MSc-Thesis, [http://www.ruM.is/lisalib/getfileSc.aspx?itemid=12149 pdf]thesis
==2010 ...==
* [[Eli David|Omid David]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2010'''). ''Optimizing Selective Search in Chess''. ICML - Workshop on Machine Learning and Games, Haifa, Israel
* [[Maarten Schadd]] ('''2011'''). ''Selective Search in Games of Different Complexity''. Ph.D. Thesis. Department of Knowledge Engineering, [[Maastricht University]]
* [http://www.talkchess.com/forum/viewtopic.php?t=29905 Extensions/Reductions] by [[Luca Hemmerich]], [[CCC]], September 28, 2009
==2010 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=42677 Counting depth as a function of number of legal moves] by [[Pio Korinth]], [[CCC]], February 28, 2012 » [[Depth]]* [http://www.talkchess.com/forum/viewtopic.php?t=44686 Nullmove vs classic selective search] by [[Ed Schroder|Ed Schröder]], [[CCC]], August 04, 2012 <ref>[http://www.top-5000.nl/authors/rebel/chess840.htm#SELECTIVE%20SEARCH Selective Search Techniques in REBEL (introduction)] from [http://www.top-5000.nl/authors/rebel/chess840.htm [Rebel#ProgrammerCorner|Programmer Corner]] by [[Ed Schroder|Ed Schröder]]</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=45624 Houdini 3 reducing the depth feature] by Maurizio Maglio, [[CCC]], October 17, 2012 » [[Houdini]]
* [http://www.talkchess.com/forum/viewtopic.php?t=51264 selective depth definition] by [[Uri Blass]], [[CCC]], February 13, 2014 » [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66298 Is modern chess software lossless or lossy?] by Meni Rosenfeld, [[CCC]], January 10, 2018 » [[Playing Strength]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=68082 Names of selectivity algorithms] by [[Vivien Clauzon]], [[CCC]], July 26, 2018
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=70165 delaying tactics: prune or extend?] by [[Harm Geert Muller]], [[CCC]], March 10, 2019 » [[Tactics]]
==2020 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=74170 Tactical search] by [[Alvaro Cardoso]], [[CCC]], June 13, 2020 » [[Tactics]]
=External Links=
* [http://www.vincent-peirani.com/projets Living Being Quintet] - On the heights, [http://www.altitudejazz.com/programme-concerts-festival-jazz-hautes-alpes.html Altitude Jazz Festival 2015], [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: [[Videos#VincentPeirani:Category:Vincent Peirani|Vincent Peirani]], [[Videos#EmileParisien:Category:Émile Parisien|Émile Parisien]], [[Videos#TonyPaeleman:Category:Tony Paeleman|Tony Paeleman]], [http://www.julienherne.com/ Julien Herné], [http://www.simonoviez.com/english/YoannSerraus.htm Yoann Serra]
: {{#evu:https://www.youtube.com/watch?v=xoaSRUrL8lE|alignment=left|valignment=top}}
'''[[Search|Up one level]]'''
[[Category:Tony Paeleman]]
[[Category:Émile Parisien]]
[[Category:Vincent Peirani]]
