Difference between revisions of "Reductions"

From Chessprogramming wiki
Jump to: navigation, search
Line 49: Line 49:
 
* [http://www.talkchess.com/forum/viewtopic.php?t=61425 Floating Move Reduction] by [[Dennis Sceviour]], [[CCC]], September 14, 2016
 
* [http://www.talkchess.com/forum/viewtopic.php?t=61425 Floating Move Reduction] by [[Dennis Sceviour]], [[CCC]], September 14, 2016
 
* [http://www.talkchess.com/forum/viewtopic.php?t=65586 EMR based on Null Move threat] by [[Michael Sherwin]], [[CCC]], October 30, 2017
 
* [http://www.talkchess.com/forum/viewtopic.php?t=65586 EMR based on Null Move threat] by [[Michael Sherwin]], [[CCC]], October 30, 2017
 +
==2020 ...==
 +
* [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]]
  
 
=External Links=
 
=External Links=

Revision as of 00:51, 3 February 2020

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