Difference between revisions of "Sibling Node"
GerdIsenberg (talk | contribs) (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...") |
GerdIsenberg (talk | contribs) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
'''[[Main Page|Home]] * [[Search]] * [[Node]] * Sibling Node''' | '''[[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 | + | '''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]] ('''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. |
| + | |||
| + | =External Links= | ||
| + | * [https://en.wikipedia.org/wiki/Sibling Sibling from Wikipedia] | ||
=References= | =References= | ||
Latest revision as of 17:24, 26 September 2018
Home * Search * Node * Sibling Node
Sibling nodes are the 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 [1], 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.
External Links
References
- ↑ Jeroen Carolus (2006). Alpha-Beta with Sibling Prediction Pruning in Chess. Masters thesis, pdf
