๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Limiting theorems for the nodes in binary search trees

โœ Scribed by Jie Liu; Su Chun; Chen Yu

Publisher
SP Science China Press
Year
2008
Tongue
English
Weight
234 KB
Volume
51
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The *-minimax search procedure for trees
The *-minimax search procedure for trees containing chance nodes
โœ Bruce W. Ballard ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1001 KB

An extention of the alpha-beta tree priming strategy to game trees with "probability" nodes, whose values are defined as the (possibly weighted) average of their successors' values, is developed. These '\*-minhnax' trees pertain to games involving chance but no concealed infornzation. Based upon our