Difference between revisions of "Reductions"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 52: Line 52:
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=72981 Pruning / reduction depending on king safety] by [[Vivien Clauzon]], [[CCC]], February 02, 2020 » [[King Safety]]
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=72981 Pruning / reduction depending on king safety] by [[Vivien Clauzon]], [[CCC]], February 02, 2020 » [[King Safety]]
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=74769 An alternative to IID] by [[Ed Schroder|Ed Schröder]], [[CCC]], August 13, 2020 » [[Internal Iterative Deepening|IID]]
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=74769 An alternative to IID] by [[Ed Schroder|Ed Schröder]], [[CCC]], August 13, 2020 » [[Internal Iterative Deepening|IID]]
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=77644 Futility reductions] by [[Jost Triller]], [[CCC]], July 05, 2021 »  [[Futility Pruning]]
  
 
=External Links=
 
=External Links=

Latest revision as of 09:49, 8 July 2021

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

References

Up one level