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.
- Exact Score
- 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
Up one Level