Difference between revisions of "Reductions"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Search * Selectivity * Reductions''' '''Reductions''' (as opposed to pruning),<br/> a class of search heuristics that decrease the...")
 
Line 8: Line 8:
 
* [[Fail-High Reductions]] - FHR
 
* [[Fail-High Reductions]] - FHR
 
* [[Null Move Reductions]]
 
* [[Null Move Reductions]]
 +
* [[RankCut]]
  
 
=Near the Tips=
 
=Near the Tips=

Revision as of 12:19, 24 May 2019

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

External Links

References

Up one level