Changes

Jump to: navigation, search

Sibling Prediction Pruning

1,184 bytes added, 18:11, 26 September 2018
Created page with "'''Home * Search * Selectivity * Pruning * Sibling Prediction Pruning''' '''Sibling Prediction Pruning''',<br/> a forward pruning technique at Fro..."
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Pruning]] * Sibling Prediction Pruning'''

'''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 to exceed the best score so far aka [[Alpha|alpha]].
Carolus' implementation even breaks the move loop, assuming an ordered [[Move List|move list]].

=See also=
* [[Futility Pruning]]
* [[Reverse Futility Pruning]]

=Publications=
* [[Jeroen Carolus]] ('''2006'''). ''Alpha-Beta with Sibling Prediction Pruning in Chess''. Masters thesis, [http://homepages.cwi.nl/%7Epaulk/theses/Carolus.pdf pdf]

=Publications=
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=47920 sibling prediction pruning] by [[Marco Belli]], [[CCC]], May 05, 2013

=References=
<references />

'''[[Pruning|Up one Level]]'''

Navigation menu