From Chessprogramming wiki
Jump to: navigation, search

Home * Search * Selectivity * Reductions

Reductions (as opposed to pruning),
a class of search heuristics that decrease the depth to which a certain branch of the tree is searched, also interpreted as negative extension.

Recursive Reductions

Near the Tips

Pruning after a reduced Search

Some dynamic pruning techniques base their pruning decision on a reduced search by factor R, also applied recursively:

A none recursive pruning based on reduction at some fixed depth is applied by:

See also

Forum Posts

1998 ...

2000 ...

2005 ...

2010 ...

2015 ...

2020 ...

External Links


Up one level