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

Comparison of two different tree algorithms

โœ Scribed by Junichiro Making

Book ID
107788993
Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
785 KB
Volume
88
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A comparison of minimax tree search algo
A comparison of minimax tree search algorithms
โœ Murray S. Campbell; T.A. Marsland ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 849 KB

Although theoretic performance measures of most game-searching algorithms exist, for various reasons their practicality is limited. This paper examines and extends the existing search methods, and reports on empirical performance studies on trees with useful size and ordering properties. Emphasis is

The Variance of Two Game Tree Algorithms
The Variance of Two Game Tree Algorithms
โœ Yanjun Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 210 KB

This article studies the variance of two game tree algorithms, โฃ-โค search and SCOUT, in the stochastic i.i.d. model. The problem of determining the variance of the classic โฃ-โค search algorithm in the i.i.d. model was long open. This article resolves this problem partially. It is shown, by the martin

A parallel tree difference algorithm
A parallel tree difference algorithm
โœ D.B. Skillicorn ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 455 KB