Sibling Prediction Pruning
Revision as of 18:11, 26 September 2018 by GerdIsenberg (talk | contribs) (Created page with "'''Home * Search * Selectivity * Pruning * Sibling Prediction Pruning''' '''Sibling Prediction Pruning''',<br/> a forward pruning technique at Fro...")
Home * Search * Selectivity * Pruning * Sibling Prediction Pruning
Sibling Prediction Pruning,
a forward pruning technique at frontier nodes (depth == 1) introduced by Jeroen Carolus in his 2006 Masters thesis [1].
It works like Futility Pruning, to skip quiet, none checking moves, if they have no postential to exceed the best score so far aka alpha.
Carolus' implementation even breaks the move loop, assuming an ordered move list.
See also
Publications
- Jeroen Carolus (2006). Alpha-Beta with Sibling Prediction Pruning in Chess. Masters thesis, pdf
Publications
- sibling prediction pruning by Marco Belli, CCC, May 05, 2013
References
- ↑ Jeroen Carolus (2006). Alpha-Beta with Sibling Prediction Pruning in Chess. Masters thesis, pdf