25,161
edits
Changes
Created page with "'''Home * Search * Node * Sibling Node''' '''Sibling nodes''' are the nodes with a common ancestor, differing only by the position of one or at..."
'''[[Main Page|Home]] * [[Search]] * [[Node]] * Sibling Node'''
'''Sibling nodes''' are the [[Node|nodes]] with a common ancestor, differing only by the position of one or at most two pieces. Some heuristics, most notably the [[Killer Heuristic]] and [[Sibling Prediction Pruning]] <ref>[[Jeroen Carolus|Jeroen W.T. Carolus]] ('''2006'''). ''Alpha-Beta with Sibling Prediction Pruning in Chess'', Masters thesis, [http://homepages.cwi.nl/%7Epaulk/theses/Carolus.pdf pdf]</ref>, rely on the assumption that the positions from the sibling nodes are similar to each other and ought to trigger the same behavior of a program.
=References=
<references />
'''[[Node|Up one Level]]'''
'''Sibling nodes''' are the [[Node|nodes]] with a common ancestor, differing only by the position of one or at most two pieces. Some heuristics, most notably the [[Killer Heuristic]] and [[Sibling Prediction Pruning]] <ref>[[Jeroen Carolus|Jeroen W.T. Carolus]] ('''2006'''). ''Alpha-Beta with Sibling Prediction Pruning in Chess'', Masters thesis, [http://homepages.cwi.nl/%7Epaulk/theses/Carolus.pdf pdf]</ref>, rely on the assumption that the positions from the sibling nodes are similar to each other and ought to trigger the same behavior of a program.
=References=
<references />
'''[[Node|Up one Level]]'''
