Difference between revisions of "Selectivity"

From Chessprogramming wiki
Jump to: navigation, search
Line 55: Line 55:
 
* [[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]] ('''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]]
 
* [[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>
 
* [[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
 
* [[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
Line 63: Line 64:
 
* [[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]
 
* [[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)
 
* [[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)
* [[Pálmi Skowronski]] ('''2009'''). ''Gradual Focus: A Method for Automated Feature Discovery in Selective Search''. MSc-Thesis, [http://www.ru.is/lisalib/getfile.aspx?itemid=12149 pdf]
+
* [[David McAllester]], [[Deniz Yuret]] ('''2002'''). ''Alpha-Beta Conspiracy Search''. [[ICGA Journal#25_1|ICGA Journal, Vol. 25, No. 1]] » [[Alpha-Beta Conspiracy Search]]
 +
* [[Pálmi Skowronski]] ('''2009'''). ''Gradual Focus: A Method for Automated Feature Discovery in Selective Search''. M.Sc. thesis
 
==2010 ...==
 
==2010 ...==
 
* [[Eli David|Omid David]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2010'''). ''Optimizing Selective Search in Chess''. ICML - Workshop on Machine Learning and Games
 
* [[Eli David|Omid David]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2010'''). ''Optimizing Selective Search in Chess''. ICML - Workshop on Machine Learning and Games

Revision as of 10:58, 9 December 2019

Home * Search * Selectivity

Selectivity gives a whiff of Shannon's Type B search to Shannon's Type A or brute-force. The goal is to search "interesting" and forced branches which are or are likely to become part of the principal variation deeper than nominal, but to reduce uninteresting branches.

Extensions

Pruning

Reductions

See also

Publications

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

Forum Posts

1998 ...

2000 ...

2010 ...

External Links

Vincent Peirani, Émile Parisien, Tony Paeleman, Julien Herné, Yoann Serra

References

  1. ICCA Journal, Vol. 17, No. 1 by Jos Uiterwijk, rgcc, May 02, 1994
  2. Selective Search Techniques in REBEL (introduction) from Programmer Corner by Ed Schröder

Up one level