package prbnmcn-mcts
Monte-Carlo tree search based on UCB1 bandits
Install
Dune Dependency
Authors
Maintainers
Sources
0.0.2.tar.gz
md5=bc21c58f681780879d82e783bcd3deba
sha512=7be82aff6a4f5db7423e8f986654c338d69eae72a6d2fcd6f9ab4719384ba29b988eb6d5282dea086771bb726170a3a80a15a3c0276aebe84fc003d34c61ded1
Description
This library provides a monadic API to describe lazily evaluated, finitely branching trees. It allows to use Monte-Carlo tree search to perform reward-guided exploration of these trees.
Published: 20 Mar 2025
README
prbnmcn-mcts
A Monte-Carlo tree search implementation based on UCB1 bandits.
sectionYPositions = computeSectionYPositions($el), 10)" x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)">
On This Page