Home * Search * Selectivity * Reductions

Reductions (as opposed to pruning) are 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 ...


External Links


References

  1. ^ Programmer Corner - How Rebel Plays Chess - Reductions by Ed Schröder, pdf reprint

What links here?


Up one level