Sibling Prediction Pruning

From Chessprogramming wiki
Jump to: navigation, search

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

References

  1. Jeroen Carolus (2006). Alpha-Beta with Sibling Prediction Pruning in Chess. Masters thesis, pdf

Up one Level