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

Corrections to "Parallel game tree-search''

โœ Scribed by Marsland, T. A.; Popowich, Fred


Book ID
117930809
Publisher
IEEE
Year
1985
Tongue
English
Weight
209 KB
Volume
PAMI-7
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


APHID: Asynchronous Parallel Game-Tree S
โœ Mark G. Brockington; Jonathan Schaeffer ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 488 KB

Most parallel game-tree search approaches use synchronous methods, where the work is concentrated within a specific part of the tree or at a given search depth. This article shows that asynchronous game-tree search algorithms can be as efficient as or better than synchronous methods in determining t

Search-hide games on trees
โœ Buyang Cao ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 572 KB