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

Monte Carlo tree search in Kriegspiel

โœ Scribed by Paolo Ciancarini; Gian Piero Favini


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
741 KB
Volume
174
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Pseudo-random trees in Monte Carlo
โœ Paul Frederickson; Robert Hiromoto; Thomas L. Jordan; Burton Smith; Tony Warnock ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 366 KB

We present the concept of a pseudo-random tree, and generalize the Lehmer pseudo-random number generator as an efficient implementation of the concept. Pseudo-random trees can be used to give reproducibility, as well as speed, in Monte Carlo computations on parallel computers with either the SIMD ar

Octree-search Kinetic Monte Carlo
โœ M.A. Gosรกlvez; Y. Xing; K. Sato; R.M. Nieminen ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 837 KB

We present a Kinetic Monte Carlo (KMC) method based on an octree data representation and search algorithm for the simulation of complex Micro Electro Mechanical Systems (MEMS) structures and, in general, complex, multi-valued surfaces propagating in 3D space. The experimental etch rate distribution

Monte Carlo study of search statistics
โœ G.F. Gieraltowski; L.G. Hyman; H.L. Tardy ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science โš– 468 KB