Difference between revisions of "Bound"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 31: | Line 31: | ||
'''[[Score|Up one Level]]''' | '''[[Score|Up one Level]]''' | ||
[[Category:Kraan]] | [[Category:Kraan]] | ||
| + | [[Category:Hellmut Hattler]] | ||
Latest revision as of 23:18, 1 August 2020
A Bound is a limit imposed on a node value, beyond which changes of the value have no effect on the shape of the search tree.
See also
Forum Posts
- bounds in alpha-beta by Walter Ravenek, rgcc, June 05, 1996 » Fail-Soft, Arthur, Crafty
- Alpha beta fail soft, pruning & hash bounds? by Steve Maughan, CCC, December 14, 2000 » Fail-Soft, Pruning
- Using just Upperbounds and Lowerbounds by Alvaro Jose Povoa Cardoso, CCC, February 01, 2001 » Upper Bound, Lower Bound
- bound type in PVS ? by Mahmoud Uthman, CCC, January 23, 2017 » Principal Variation Search
External Links
- Bound from Wikipedia
- Upper and lower bounds from Wikipedia
- Branch-and-bound from Wikipedia
- Kraan - Overseas Bound (1975), YouTube Video
