Bound

toc
 * Home * Search * Score * Bound**

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.
 * Lower Bound
 * Upper Bound

=See also= > Exact Score
 * Alpha
 * Alpha-Beta
 * Beta
 * Fail-Hard
 * Fail-Soft
 * Integrated Bounds and Values
 * Score
 * Transposition Table

=Forum Posts=
 * [|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= > media type="youtube" key="41Uez9OXzcU"
 * [|Bound from Wikipedia]
 * [|Upper and lower bounds from Wikipedia]
 * [|Branch-and-bound from Wikipedia]
 * Kraan - [|Overseas Bound] (1975), [|YouTube] Video

=What links here?= include page="Bound" component="backlinks" limit="40"
 * Up one Level**