Selectivity

From Chessprogramming wiki
Jump to: navigation, search

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