7
edits
Changes
m
no edit summary
'''Sibling Prediction Pruning''',<br/>
a forward pruning technique at [[Frontier Nodes|frontier nodes]] ([[Depth|depth]] == 1) introduced by [[Jeroen Carolus]] in his 2006 Masters thesis <ref> [[Jeroen Carolus]] ('''2006'''). ''Alpha-Beta with Sibling Prediction Pruning in Chess''. Masters thesis, [http://homepages.cwi.nl/%7Epaulk/theses/Carolus.pdf pdf]</ref>.
It works like [[Futility Pruning]], to skip [[Quiet Moves|quiet]], none checking moves, if they have no postential potential to exceed the best score so far aka [[Alpha|alpha]].
Carolus' implementation even breaks the move loop, assuming an ordered [[Move List|move list]].
