This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Reductions

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.

Contents
  1. Recursive Reductions
  2. Near the Tips
  3. Pruning after a reduced Search
  4. See also
  5. Forum Posts
    1. 1998 ...
    2. 2000 ...
    3. 2005 ...
    4. 2010 ...
    5. 2015 ...
    6. 2020 ...
  6. External Links
  7. References

Recursive Reductions

Near the Tips

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 ...

References

Up one level


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

What links here

Contributors: GerdIsenberg, ShawnXu.