Difference between revisions of "Selectivity"

From Chessprogramming wiki
Jump to: navigation, search
Line 64: Line 64:
 
* [[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]
 
* [[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]
 
==2010 ...==
 
==2010 ...==
* [[Omid David]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2010'''). ''Optimizing Selective Search in Chess''. ICML Workshop on Machine Learning and Games, Haifa, Israel
+
* [[Eli David|Omid David]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2010'''). ''Optimizing Selective Search in Chess''. ICML - Workshop on Machine Learning and Games
 
* [[Maarten Schadd]] ('''2011'''). ''Selective Search in Games of Different Complexity''. Ph.D. Thesis. Department of Knowledge Engineering, [[Maastricht University]]  
 
* [[Maarten Schadd]] ('''2011'''). ''Selective Search in Games of Different Complexity''. Ph.D. Thesis. Department of Knowledge Engineering, [[Maastricht University]]  
  

Revision as of 14:13, 27 August 2018

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

Up one level